Search

We prove a new effective Chebotarev density theorem for Galois extensions $L/\mathbb{Q}$ that allows one to count small primes (even as small as an arbitrarily small power of the discriminant of $L$); this theorem holds for the Galois closures of "almost all" number fields that lie in an appropriate family of field extensions. Previously, applying Chebotarev in such small ranges required assuming the Generalized Riemann Hypothesis. The error term in this new Chebotarev density theorem also avoids the effect of an exceptional zero of the Dedekind zeta function of $L$, without assuming GRH. We give many different "appropriate families," including families of arbitrarily large degree. To do this, we first prove a new effective Chebotarev density theorem that requires a zero-free region of the Dedekind zeta function. Then we prove that almost all number fields in our families yield such a zero-free region. The innovation that allows us to achieve this is a delicate new method for controlling zeroes of certain families of non-cuspidal $L$-functions. This builds on, and greatly generalizes the applicability of, work of Kowalski and Michel on the average density of zeroes of a family of cuspidal $L$-functions. A surprising feature of this new method, which we expect will have independent interest, is that we control the number of zeroes in the family of $L$-functions by bounding the number of certain associated fields with fixed discriminant. As an application of the new Chebotarev density theorem, we prove the first nontrivial upper bounds for $\ell$-torsion in class groups, for all integers $\ell \geq 1$, applicable to infinite families of fields of arbitrarily large degree., Comment: 52 pages. This shorter version aligns with the published paper. Note that portions of Section 8 of the longer v1 have been developed as a separate paper with identifier arXiv:1902.02008

In the authors' first paper, Beurling-Rudin-Korenbljum type characterization of the closed ideals in a certain algebra of holomorphic functions was used to describe the lattice of invariant subspaces of the shift plus a complex Volterra operator. Current work is an extension of the previous work and it describes the lattice of invariant subspaces of the shift plus a positive integer multiple of the complex Volterra operator on the Hardy space. Our work was motivated by a paper by Ong who studied the real version of the same operator., We deleted a proposition and a corollary from section 4, and simplified the proof of the main theorem. **The article has been published in Archiv der Mathematik**

A wide class of problems in combinatorics, computer science and physics can be described along the following lines. There are a large number of variables ranging over a finite domain that interact through constraints that each bind a few variables and either encourage or discourage certain value combinations. Examples include the $k$-SAT problem or the Ising model. Such models naturally induce a Gibbs measure on the set of assignments, which is characterised by its partition function. The present paper deals with the partition function of problems where the interactions between variables and constraints are induced by a sparse random (hyper)graph. According to physics predictions, a generic recipe called the "replica symmetric cavity method" yields the correct value of the partition function if the underlying model enjoys certain properties [Krzkala et al., PNAS 2007]. Guided by this conjecture, we prove general sufficient conditions for the success of the cavity method. The proofs are based on a "regularity lemma" for probability measures on sets of the form $\Omega^n$ for a finite $\Omega$ and a large $n$ that may be of independent interest., Comment: This version replaces version 1 and the RANDOM 2015 version of the paper, which contained critical errors affecting the main results

The Naruse hook-length formula is a recent general formula for the number of standard Young tableaux of skew shapes, given as a positive sum over excited diagrams of products of hook-lengths. In 2015 we gave two different $q$-analogues of Naruse's formula: for the skew Schur functions, and for counting reverse plane partitions of skew shapes. In this paper we give an elementary proof of Naruse's formula based on the case of border strips. For special border strips, we obtain curious new formulas for the Euler and $q$-Euler numbers in terms of certain Dyck path summations., Comment: 33 pages, 10 figures. This is the second paper of the series "Hook formulas for skew shapes". Most of Sections 8 and 9 in this paper used to be part of arxiv:1512.08348 (v1,v2); v2 fixed several typos; v3 made precision in definition of flagged tableaux in Section 3.2 and fixed typo in Example 3.3; v4 fixed small typos in proof of Corollary 7.6

This paper is concerned with the performance of Orthogonal Matching Pursuit (OMP) algorithms applied to a dictionary $\mathcal{D}$ in a Hilbert space $\mathcal{H}$. Given an element $f\in \mathcal{H}$, OMP generates a sequence of approximations $f_n$, $n=1,2,\dots$, each of which is a linear combination of $n$ dictionary elements chosen by a greedy criterion. It is studied whether the approximations $f_n$ are in some sense comparable to {\em best $n$ term approximation} from the dictionary. One important result related to this question is a theorem of Zhang \cite{TZ} in the context of sparse recovery of finite dimensional signals. This theorem shows that OMP exactly recovers $n$-sparse signal, whenever the dictionary $\mathcal{D}$ satisfies a Restricted Isometry Property (RIP) of order $An$ for some constant $A$, and that the procedure is also stable in $\ell^2$ under measurement noise. The main contribution of the present paper is to give a structurally simpler proof of Zhang's theorem, formulated in the general context of $n$ term approximation from a dictionary in arbitrary Hilbert spaces $\mathcal{H}$. Namely, it is shown that OMP generates near best $n$ term approximations under a similar RIP condition., 12 pages

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that any graph is close to being the disjoint union of expanders. Our goal in this paper is to show that in several of the instantiations of the above approach, the quantitative bounds that were obtained are essentially best possible. Three examples of our results are the following: A classical result of Lipton, Rose and Tarjan from 1979 states that if F is a hereditary family of graphs and every graph in F has a vertex separator of size n/(log⁡n)1+o(1), then every graph in F has O(n) edges. We construct a hereditary family of graphs with vertex separators of size n/(log⁡n)1−o(1) such that not all graphs in the family have O(n) edges. Trevisan and Arora-Barak-Steurer have recently shown that given a graph G, one can remove only 1% of its edges to obtain a graph in which each connected component has good expansion properties. We show that in both of these decomposition results, the expansion properties they guarantee are essentially best possible, even when one is allowed to remove 99% of G's edges. Sudakov and the second author have recently shown that every graph with average degree d contains an n-vertex subgraph with average degree at least (1−o(1))d and vertex expansion 1/(log⁡n)1+o(1). We show that one cannot guarantee a better vertex expansion even if allowing the average degree to be O(1). The above results are obtained as corollaries of a new family of graphs which we construct in this paper. These graphs have a super-linear number of edges and nearly logarithmic girth, yet each of their subgraphs has (optimally) poor expansion properties.

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence. The expansions are finite sequences of nonnegative integer coefficients (satisfying certain technical conditions to guarantee uniqueness of the decomposition) and which can be viewed as analogs of sequences of variable-length words made from some fixed alphabet. In this paper we present a new approach and construction for uniform measures on expansions, identifying them as the distribution of a Markov chain conditioned not to hit a set. This gives a unified approach that allows us to easily recover results on the expansions from analogous results for Markov chains, and in this paper we focus on laws of large numbers, central limit theorems for sums of digits, and statements on gaps (zeros) in expansions. We expect the approach to prove useful in other similar contexts., Comment: Version 1.0, 25 pages. Keywords: Zeckendorf decompositions, positive linear recurrence relations, distribution of gaps, longest gap, Markov processes

Let X={X(t),t∈ℝ N } be a Gaussian random field with values in ℝ d defined by $$X(t) = (X_1(t), \ldots, X_d(t)),\quad t \in {\mathbb{R}}^N,$$ where X 1,…,X d are independent copies of a real-valued, centered, anisotropic Gaussian random field X 0 which has stationary increments and the property of strong local nondeterminism. In this paper we determine the exact Hausdorff measure function for the range X([0,1] N ). We also provide a sufficient condition for a Gaussian random field with stationary increments to be strongly locally nondeterministic. This condition is given in terms of the spectral measures of the Gaussian random fields which may contain either an absolutely continuous or discrete part. This result strengthens and extends significantly the related theorems of Berman (Indiana Univ. Math. J. 23:69–94, 1973, Stochast. Process. Appl. 27:73–84, 1988), Pitt (Indiana Univ. Math. J. 27:309–330, 1978) and Xiao (Asymptotic Theory in Probability and Statistics with Applications, pp. 136–176, 2007, A Minicourse on Stochastic Partial Differential Equations, Lecture Notes in Math, vol. 1962, pp. 145–212, 2009), and will have wider applicability beyond the scope of the present paper.

We characterize the polynomial decay of orbits of Hilbert space $C_0$-semigroups in resolvent terms. We also show that results of the same type for general Banach space semigroups and functions obtained recently in the paper by C.J.K.Batty and T.Duyckaerts, Non-uniform stability for bounded semi-groups on Banach spaces (J. Evol. Eq. 2008), are sharp. This settles a conjecture posed in the paper by C.J.K.Batty and T.Duyckaerts., 21 pages, to appear in Matematische Annalen

International audience; In the context of Mather's theory of Lagrangian systems, we study the decomposition in chain-transitive classes of the Mather invariant sets. As an application, we prove, under appropriate hypotheses, the semi-continuity of the so-called Aubry set as a function of the Lagrangian. In the study of Lagrangian systems, John Mather introduced several invariant sets composed of globally minimizing extremals. He developed methods to construct several orbits undergoing interesting behaviors in phase space under some assumptions on these invariant sets, see [14]. In order to pursue this theory and to apply it on examples, it is necessary to have tools to describe precisely the invariant sets. At least two points of view can be adopted. One can study the invariant set from a purely topological point of view in the style of Conley as compact metric spaces with flows, and study their transitive components. One can also study these set from the point of view of action minimization, and decompose them in invariant subsets that have been called static classes. These points of view are very closely related, but each of them has specific features. For example, understanding the decomposition in static classes is necessary for the variational construction of interesting orbits, while the topological decomposition behaves well under perturbations. Our goal in the present paper is to explicit the links between these two decompositions. We explain that the topological decomposition is finer than the variational one, and that they coincide for most (but not all) systems. As an application, we prove a result of semi-continuity of the so-called Aubry set as a function of the Lagrangian, under certain non-degeneracy hypotheses. The semi-continuity of the Aubry set is a subtle problem, which has remained open for several years, until John Mather gave a counter example, see §18 in [16]. In the same paper, he also states without proof that semi-continuity holds under appropriate hypotheses. Our result extends the one of Mather. The methods we use are inspired from the recent work of Fathi, Figalli and Rifford, [9].

Fomin and Kirillov initiated a line of research into the realization of the cohomology and K-theory of generalized flag varieties G/B as commutative subalgebras of certain noncommutative algebras. This approach has several advantages, which we discuss. This paper contains the most comprehensive result in a series of papers related to the mentioned line of research. More precisely, we give a model for the T -equivariant K-theory of a generalized flag variety KT (G/B) in terms of a certain braided Hopf algebra called the Nichols-Woronowicz algebra. Our model is based on the Chevalley-type multiplication formula for KT (G/B) due to the first author and Postnikov; this formula is stated using certain operators defined in terms of so-called alcove paths (and the corresponding affine Weyl group). Our model is derived using a type-independent and concise approach. Dedicated to Professor Kenji Ueno on the occasion of his sixtieth birthday

Let V be a finite dimensional vector space over a local field. Let us say that a complex function on V is elementary if it is a product of the additive character of a rational function Q on V and multiplicative characters of polynomials on V. In this paper we study when the Fourier transform of an elementary function is elementary. If Q has a nonzero Hessian, a necessary condition for this is that the Legendre transform Q_* of Q is rational. The basic example is a nondegenerate quadratic form. We study such functions Q, give examples, and find all of them such that both Q and Q_* are of the form f(x)/t, where f is a cubic form in many variables (the simplest case after quadratic forms). It turns out that this classification is closely related to Zak's classification of Severi varieties. The second half of the paper is devoted to finding and classifying elementary functions with elementary Fourier transforms when Q is a fixed function with rational Q_*. We consider the simplest case when Q is a monomial, and classify combinations of multiplicative characters that can arise. The answer (for real and complex fields) is given in terms of exact covering systems. We also describe examples related to prehomogeneous vector spaces. Finally, we consider examples over p-adic fields, and in particular give a local proof of an integral formula of D.K. that could previously be proved only by a global method., Comment: 31 pages, latex; the proof of Theorem 3.10 given in the previous version was found to be incomplete. We have added a remark about this and a reference to a paper by Chaput and Sabatino that gives a complete proof

The main goal of the present paper is two-fold. First we extend the theory of toroidal embeddings introduced by Kempf, Knudsen, Mumford and Saint-Donat to the class of toroidal varieties with stratifications (which is the main body of the paper). Second we give a proof of the following weak factorization theorem as an application and illustration of the theory: A birational map between complete nonsingular varieties over an algebraically closed field K of characteristic zero is a composite of blow ups and blow downs with smooth centers. Another proof of the weak factorization theorem appeared in a joint paper with Abramovich, Karu and Matsuki (math.AG/9904135) In that paper the theorem is stated and proven in general for proper algebraic and analytic spaces., Comment: 69 pages, a revised version with conceptual simplifications. The present version is self-contained and it does not rely on weak factorization theorem for toric varieties

Let g be a symmetrisable Kac-Moody algebra, and U_h(g) the corresponding quantum group. We showed in arXiv:1610.09744 and arXiv:1610.09741 that the braided quasi-Coxeter structure on integrable, category O representations of U_h(g) which underlies the R-matrix actions arising from the Levi subalgebras of U_h(g) and the quantum Weyl group action of the generalised braid group B_g can be transferred to integrable, category O representations of g. We prove in this paper that, up to unique equivalence, there is a unique such structure on the latter category with prescribed restriction functors, R--matrices, and local monodromies. This extends, simplifies and strengthens a similar result of the second author valid when g is semisimple, and is used in arXiv:1512.03041 to describe the monodromy of the rational Casimir connection of g in terms of the quantum Weyl group operators of U_h(g). Our main tool is a refinement of Enriquez's universal algebras, which is adapted to the PROP describing a Lie bialgebra graded by the non-negative roots of g., Expanded Introduction and Sec. 5 to discuss convolution product (5.11), cosimplicial structure on basis elements (5.13) and module structure on coinvariants (5.15). Minor revisions in Sec. 7.1 (gradings), 7.4 (deformation DY modules), 9.7 (exposition), 15.7 (Drinfeld double) and 15.15 (rigidity for diagrammatic KM algebras). Final version, to appear in Adv. Math. 81 pages

A classical P��lya urn scheme is a Markov process whose evolution is encoded by a replacement matrix $(R_{i,j})_{1\leq i,j\leq d}$. At every discrete time-step, we draw a ball uniformly at random, denote its colour $c$, and replace it in the urn together with $R_{c,j}$ balls of colour $j$ (for all $1\leq j\leq d$). We are interested in multi-drawing P��lya urns, where the replacement rule depends on the random drawing of a set of $m$ balls from the urn (with or without replacement). This generalisation has already been studied in the literature, in particular by Kuba & Mahmoud (ArXiv:1503.09069 and 1509.09053), where second order asymptotic results are proved for $2$-colour urns under the balanced and the affinity assumptions. The main idea of this work is to apply stochastic approximation methods to this problem, which enables us to remove the affinity hypothesis of Kuba & Mahmoud and generalise the result to more-than-two-colour urns. We also give some partial results in the two-colour non-balanced case., This new arxiv version (v6) corrects a mistake that we discovered in the previous versions of this paper (v1-5). The mistake was in Theorem 1$(a)$ and in the last sentence of Theorem 4. In this new version, Theorem 1$(a)$ has been corrected, and Theorem 4 has been deleted

Let $G$ be a finite connected graph, and let $\rho$ be the spectral radius of its universal cover. For example, if $G$ is $k$-regular then $\rho=2\sqrt{k-1}$. We show that for every $r$, there is an $r$-covering (a.k.a. an $r$-lift) of $G$ where all the new eigenvalues are bounded from above by $\rho$. It follows that a bipartite Ramanujan graph has a Ramanujan $r$-covering for every $r$. This generalizes the $r=2$ case due to Marcus, Spielman and Srivastava (2013). Every $r$-covering of $G$ corresponds to a labeling of the edges of $G$ by elements of the symmetric group $S_{r}$. We generalize this notion to labeling the edges by elements of various groups and present a broader scenario where Ramanujan coverings are guaranteed to exist. In particular, this shows the existence of richer families of bipartite Ramanujan graphs than was known before. Inspired by Marcus-Spielman-Srivastava, a crucial component of our proof is the existence of interlacing families of polynomials for complex reflection groups. The core argument of this component is taken from a recent paper of them (2015). Another important ingredient of our proof is a new generalization of the matching polynomial of a graph. We define the $r$-th matching polynomial of $G$ to be the average matching polynomial of all $r$-coverings of $G$. We show this polynomial shares many properties with the original matching polynomial. For example, it is real rooted with all its roots inside $\left[-\rho,\rho\right]$., Comment: 38 pages, 4 figures, journal version (minor changes from previous arXiv version). Shortened version appeared in STOC 2016

Dvo\v{r}\'ak, Kr\'al' and Thomas gave a description of the structure of triangle-free graphs on surfaces with respect to 3-coloring. Their description however contains two substructures (both related to graphs embedded in plane with two precolored cycles) whose coloring properties are not entirely determined. In this paper, we fill these gaps., Comment: 15 pages, 1 figure; corrections from the review process. arXiv admin note: text overlap with arXiv:1509.01013

In this paper we find the optimal error bound (smallest possible estimate, independent of the starting point) for the linear convergence rate of the simultaneous projection method applied to closed linear subspaces in a real Hilbert space. We achieve this by computing the norm of an error operator which we also express in terms of the Friedrichs number. We compare our estimate with the optimal one provided for the alternating projection method by Kayalar and Weinert (1988). Moreover, we relate our result to the alternating projection formalization of Pierra (1984) in a product space. Finally, we adjust our results to closed affine subspaces and put them in context with recent dichotomy theorems., Accepted for publication in the Journal of Approximation Theory

Macaulay's Inverse System gives an effective method to construct Artinian Gorenstein k-algebras. To date a general structure for Gorenstein k-algebras of any dimension (and codimension) is not understood. In this paper we extend Macaulay's correspondence characterizing the submodules of the divided power ring in one-to-one correspondence with Gorenstein d-dimensional k-algebras. We discuss effective methods for constructing Gorenstein graded rings. Several examples illustrating our results are given., 19 pages, to appear in Advances in Mathematics

Let $X$ be a $d\times d$ symmetric random matrix with independent but non-identically distributed Gaussian entries. It has been conjectured by Lata��{a} that the spectral norm of $X$ is always of the same order as the largest Euclidean norm of its rows. A positive resolution of this conjecture would provide a sharp understanding of the probabilistic mechanisms that control the spectral norm of inhomogeneous Gaussian random matrices. This paper establishes the conjecture up to a dimensional factor of order $\sqrt{\log\log d}$. Moreover, dimension-free bounds are developed that are optimal to leading order and that establish the conjecture in special cases. The proofs of these results shed significant light on the geometry of the underlying Gaussian processes., 18 pages, 1 figure; final version, to appear in Trans. Amer. Math. Soc

Let $\unicode[STIX]{x1D6FD}\in (1,2)$ be a real number. For a function $\unicode[STIX]{x1D6F9}:\mathbb{N}\rightarrow \mathbb{R}_{\geq 0}$, define $W_{\unicode[STIX]{x1D6FD}}(\unicode[STIX]{x1D6F9})$ to be the set of $x\in \mathbb{R}$ such that for infinitely many $n\in \mathbb{N},$ there exists a sequence $(\unicode[STIX]{x1D716}_{i})_{i=1}^{n}\in \{0,1\}^{n}$ satisfying $0\leq x-\sum _{i=1}^{n}(\unicode[STIX]{x1D716}_{i}/\unicode[STIX]{x1D6FD}^{i})\leq \unicode[STIX]{x1D6F9}(n)$. In Baker [Approximation properties of $\unicode[STIX]{x1D6FD}$-expansions. Acta Arith. 168 (2015), 269–287], the author conjectured that for Lebesgue almost every $\unicode[STIX]{x1D6FD}\in (1,2)$, the condition $\sum _{n=1}^{\infty }2^{n}\unicode[STIX]{x1D6F9}(n)=\infty$ implies that $W_{\unicode[STIX]{x1D6FD}}(\unicode[STIX]{x1D6F9})$ is of full Lebesgue measure within $[0,1/(\unicode[STIX]{x1D6FD}-1)]$. In this paper we make a significant step towards proving this conjecture. We prove that given a sequence of positive real numbers $(\unicode[STIX]{x1D714}_{n})_{n=1}^{\infty }$ satisfying $\lim _{n\rightarrow \infty }\unicode[STIX]{x1D714}_{n}=\infty$, for Lebesgue almost every $\unicode[STIX]{x1D6FD}\in (1.497,\ldots ,2)$, the set $W_{\unicode[STIX]{x1D6FD}}(\unicode[STIX]{x1D714}_{n}\cdot 2^{-n})$ is of full Lebesgue measure within $[0,1/(\unicode[STIX]{x1D6FD}-1)]$. We also study the case where $\sum _{n=1}^{\infty }2^{n}\unicode[STIX]{x1D6F9}(n) in which the set $W_{\unicode[STIX]{x1D6FD}}(\unicode[STIX]{x1D6F9})$ has Lebesgue measure zero. Applying the mass transference principle developed by Beresnevich and Velani in [A mass transference principle and the Duffin–Schaeffer conjecture for Hausdorff measures. Ann. of Math. (2) 164(3) (2006), 971–992], we obtain some results on the Hausdorff dimension and the Hausdorff measure of $W_{\unicode[STIX]{x1D6FD}}(\unicode[STIX]{x1D6F9})$.

This paper presents the Gaussian subordination framework to generate optimal one-sided approximations to multidimensional real-valued functions by functions of prescribed exponential type. Such extremal problems date back to the works of Beurling and Selberg and provide a variety of applications in analysis and analytic number theory. Here we majorize and minorize (on $\mathbb{R}^N$) the Gaussian ${\bf x} \mapsto e^{-\pi \lambda |{\bf x}|^2}$, where $\lambda >0$ is a free parameter, by functions with distributional Fourier transforms supported on Euclidean balls, optimizing weighted $L^1$-errors. By integrating the parameter $\lambda$ against suitable measures, we solve the analogous problem for a wide class of radial functions. Applications to inequalities and periodic analogues are discussed. The constructions presented here rely on the theory of de Branges spaces of entire functions and on new interpolations tools derived from the theory of Laplace transforms of Laguerre-P\'{o}lya functions., Comment: 31 pages. To appear in Amer. J. Math

This paper is devoted to a detailed study of nowhere-zero flows on signed eulerian graphs. We generalise the well-known fact about the existence of nowhere-zero $2$-flows in eulerian graphs by proving that every signed eulerian graph that admits an integer nowhere-zero flow has a nowhere-zero $4$-flow. We also characterise signed eulerian graphs with flow number $2$, $3$, and $4$, as well as those that do not have an integer nowhere-zero flow. Finally, we discuss the existence of nowhere-zero $A$-flows on signed eulerian graphs for an arbitrary abelian group~$A$., 17 pages, 1 figure

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on Taylor expansions, and study their approximation by finite dimensional polynomial spaces $${{\mathcal {P}}}_\Lambda $$ described by lower sets $$\Lambda $$ . Given a budget n for the dimension of $${{\mathcal {P}}}_\Lambda $$ , we prove that certain lower sets $$\Lambda _n$$ , with cardinality n, provide a certifiable approximation error that is in a certain sense optimal, and that these lower sets have a simple definition in terms of simplices. Our main goal is to obtain approximation results when the number of variables d is large and even infinite, and so we concentrate almost exclusively on the case $$d=\infty $$ . We also emphasize obtaining results which hold for the full range $$n\ge 1$$ , rather than asymptotic results that only hold for n sufficiently large. In applications, one typically wants n small to comply with computational budgets.

We prove that the discrete harmonic function corresponding to smooth Dirichlet boundary conditions on orthodiagonal maps, that is, plane graphs having quadrilateral faces with orthogonal diagonals, converges to its continuous counterpart as the mesh size goes to 0. This provides a convergence statement for discrete holomorphic functions, similar to the one obtained by Chelkak and Smirnov for isoradial graphs. We observe that by the double circle packing theorem, any finite, simple, 3-connected planar map admits an orthodiagonal representation. Our result improves the work of Skopenkov and Werness by dropping all regularity assumptions required in their work and providing effective bounds. In particular, no bound on the vertex degrees is required. Thus, the result can be applied to models of random planar maps that with high probability admit orthodiagonal representation with mesh size tending to 0. In a companion paper, we show that this can be done for the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield., Comment: 44 pages, 11 figures

We establish estimates for the Lebesgue parameters of the Chebyshev weak thresholding greedy algorithm in the case of general bases in Banach spaces. These generalize and slightly improve earlier results in Dilworth et al. (Rev Mat Complut 28(2):393–409, 2015), and are complemented with examples showing the optimality of the bounds. Our results also clarify certain bounds recently announced in Shao and Ye (J Inequal Appl 2018(1):102, 2018), and answer some questions left open in that paper.

We prove novel results on interpolation of Fredholm operators including an abstract factorization theorem. The main result of this paper provides sufficient conditions on the parameters $\theta \in (0,1)$ and $q\in \lbrack 1,\infty ]$ under which an operator $A$ is a Fredholm operator from the real interpolation space $(X_{0},X_{1})_{\theta ,q}$ to $(Y_{0},Y_{1})_{\theta ,q} $ for a given operator $A\colon (X_{0},X_{1})\rightarrow (Y_{0},Y_{1})$ between compatible pairs of Banach spaces such that its restrictions to the endpoint spaces are Fredholm operators. These conditions are expressed in terms of the corresponding indices generated by the $K$-functional of elements from the kernel of the operator $A$ in the interpolation sum $X_{0}+X_{1}$. If in addition $q\in \lbrack 1,\infty )$ and $A$ is invertible operator on endpoint spaces, then these conditions are also necessary. We apply these results to obtain and present an affirmative solution of the famous Lions-Magenes problem on the real interpolation of closed subspaces. We also discuss some applications to the spectral theory of operators as well as to perturbation of the Hardy operator by identity on weighted $L_{p}$-spaces.

In this paper we study quasi-Monte Carlo integration of smooth functions using digital nets. We fold digital nets over $\mathbb{Z}_{b}$ by means of the $b$-adic tent transformation, which has recently been introduced by the authors, and employ such \emph{folded digital nets} as quadrature points. We first analyze the worst-case error of quasi-Monte Carlo rules using folded digital nets in reproducing kernel Hilbert spaces. Here we need to permit digital nets with "infinite digit expansions," which are beyond the scope of the classical definition of digital nets. We overcome this issue by considering the infinite product of cyclic groups and the characters on it. We then give an explicit means of constructing good folded digital nets as follows: we use higher order polynomial lattice point sets for digital nets and show that the component-by-component construction can find good \emph{folded higher order polynomial lattice rules} that achieve the optimal convergence rate of the worst-case error in certain Sobolev spaces of smoothness of arbitrarily high order.

A celebrated result due to Wolff says if $E$ is a compact subset of ${\Bbb R}^2$, then the Lebesgue measure of the distance set $\Delta(E)=\{|x-y|: x,y \in E \}$ is positive if the Hausdorff dimension of $E$ is greater than $\frac{4}{3}$. In this paper we improve the $\frac{4}{3}$ barrier by a small exponent for Cartesian products. In higher dimensions, also in the context of Cartesian products, we reduce Erdogan's $\frac{d}{2}+\frac{1}{3}$ exponent to $\frac{d^2}{2d-1}$. The proof uses a combination of Fourier analysis and additive comibinatorics., Comment: 9 pages

For any natural number $k$, consider the $k$-linear Hilbert transform $$ H_k( f_1,\dots,f_k )(x) := \operatorname{p.v.} \int_{\bf R} f_1(x+t) \dots f_k(x+kt)\ \frac{dt}{t}$$ for test functions $f_1,\dots,f_k: {\bf R} \to {\bf C}$. It is conjectured that $H_k$ maps $L^{p_1}({\bf R}) \times \dots \times L^{p_k}({\bf R}) \to L^p({\bf R})$ whenever $1 < p_1,\dots,p_k,p < \infty$ and $\frac{1}{p} = \frac{1}{p_1} + \dots + \frac{1}{p_k}$. This is proven for $k=1,2$, but remains open for larger $k$. In this paper, we consider the truncated operators $$ H_{k,r,R}( f_1,\dots,f_k )(x) := \int_{r \leq |t| \leq R} f_1(x+t) \dots f_k(x+kt)\ \frac{dt}{t}$$ for $R > r > 0$. The above conjecture is equivalent to the uniform boundedness of $\| H_{k,r,R} \|_{L^{p_1}({\bf R}) \times \dots \times L^{p_k}({\bf R}) \to L^p({\bf R})}$ in $r,R$, whereas the Minkowski and H��lder inequalities give the trivial upper bound of $2 \log \frac{R}{r}$ for this quantity. By using the arithmetic regularity and counting lemmas of Green and the author, we improve the trivial upper bound on $\| H_{k,r,R} \|_{L^{p_1}({\bf R}) \times \dots \times L^{p_k}({\bf R}) \to L^p({\bf R})}$ slightly to $o( \log \frac{R}{r} )$ in the limit $\frac{R}{r} \to \infty$ for any admissible choice of $k$ and $p_1,\dots,p_k,p$. This establishes some cancellation in the $k$-linear Hilbert transform $H_k$, but not enough to establish its boundedness in $L^p$ spaces., 17 pages, no figures. An error pointed out to the author by Pavel Zorin-Kranich has been corrected

The structure of the group (Z/nZ). and Fermat’s little theorem are the basis for some of the best-known primality testing algorithms. Many related concepts arise: Euler’s totient function and Carmichael’s lambda function, Fermat pseudoprimes, Carmichael and cyclic numbers, Lehmer’s totient problem, Giuga’s conjecture, etc. In this paper, we present and study analogues to some of the previous concepts arising when we consider the underlying group Gn := {a + bi 2 Z[i]/nZ[i] : a2 + b2 1 (mod n)}. In particular, we characterize Gaussian Carmichael numbers via a Korselt’s criterion and present their relation with Gaussian cyclic numbers. Finally, we present the relation between Gaussian Carmichael number and 1-Williams numbers for numbers n 3 (mod 4). There are also no known composite numbers less than 1018 in this family that are both pseudoprime to base 1 + 2i and 2-pseudoprime. D. Sadornil is partially supported by the Spanish Government under projects MTM2010– 21580–C02–02 and MTM2010–16051.

International audience; We describe all boundedly finite measures which are invariant by Cartesian powers of an infinite measure preserving version of Chacon transformation. All such ergodic measures are products of so-called diagonal measures, which are measures generalizing in some way the measures supported on a graph. Unlike what happens in the finite-measure case, this class of diagonal measures is not reduced to measures supported on a graph arising from powers of the transformation: it also contains some weird invariant measures, whose marginals are singular with respect to the measure invariant by the transformation. We derive from these results that the infinite Chacon transformation has trivial centralizer, and has no nontrivial factor. At the end of the paper, we prove a result of independent interest, providing sufficient conditions for an infinite measure preserving dynamical system defined on a Cartesian product to decompose into a direct product of two dynamical systems.

A well-studied geometric object in combinatorial optimization is the perfect matching polytope of a graph $G$. In any investigation concerning the perfect matching polytope, one may assume that $G$ is matching covered --- that is, it is a connected graph (of order at least two) and each edge lies in some perfect matching. A graph $G$ is Birkhoff-von Neumann (BvN) if its perfect matching polytope is characterized solely by non-negativity and degree constraints. A result of Balas (1981) implies that $G$ is BvN if and only if $G$ does not contain a pair of vertex-disjoint odd cycles $(C_1,C_2)$ such that $G-V(C_1)-V(C_2)$ has a perfect matching. It follows immediately that the corresponding decision problem is in co-NP. However, it is not known to be in NP. The problem is in P if the input graph is planar --- due to a result of Carvalho, Lucchesi and Murty (2004). These authors, along with Kothari (2018), have shown that this problem is equivalent to the seemingly unrelated problem of deciding whether a given graph is $\overline{C_6}$-free. The combinatorial diameter of a polytope is the diameter of its $1$-skeleton graph. A graph $G$ is PM-compact (PMc) if the combinatorial diameter of its perfect matching polytope equals one. A result of Chv\'atal (1975) implies that $G$ is PMc if and only if $G$ does not contain a pair of vertex-disjoint even cycles $(C_1,C_2)$ such that $G-V(C_1)-V(C_2)$ has a perfect matching. Once again the corresponding decision problem is in co-NP, but it is not known to be in NP. The problem is in P if the input graph is bipartite or is near-bipartite --- due to a result of Wang, Lin, Carvalho, Lucchesi, Sanjith and Little (2013). In this paper, we consider the "intersection" of the aforementioned problems. We give a complete characterization of matching covered graphs that are BvN as well as PMc. (Thus the corresponding decision problem is in P.), Comment: 27 pages, 10 figures. Accepted for publication in SIAM Discrete Math

In this paper, we give a brief review concerning diskcyclic operators and then we provide some further characterizations of diskcyclic operators on separable Hilbert spaces. In particular, we show that if $x\in {\mathcal H}$ has a disk orbit under $T$ that is somewhere dense in ${\mathcal H}$ then the disk orbit of $x$ under $T$ need not be everywhere dense in ${\mathcal H}$. We also show that the inverse and the adjoint of a diskcyclic operator need not be diskcyclic. Moreover, we establish another diskcyclicity criterion and use it to find a necessary and sufficient condition for unilateral backward shifts that are diskcyclic operators. We show that a diskcyclic operator exists on a Hilbert space ${\mathcal H}$ over the field of complex numbers if and only if $\dim({\mathcal H})=1$ or $\dim({\mathcal H})=\infty$ . Finally we give a sufficient condition for the somewhere density disk orbit to be everywhere dense., To appear in bull. malays. math. sci. soc

We introduce a notion of $k$th order stochastic monotonicity and duality that allows one to unify the notion used in insurance mathematics (sometimes refereed to as Siegmund's duality) for the study of ruin probability and the duality responsible for the so-called put - call symmetries in option pricing. Our general $k$th order duality can be financially interpreted as put - call symmetry for powered options. The main objective of the present paper is to develop an effective analytic approach to the analysis of duality leading to the full characterization of $k$th order duality of Markov processes in terms of their generators, which is new even for the well-studied case of put -call symmetries., Comment: To appear in Journal of Applied Probability 52:1 (March 2015)

A famous conjecture of P\'osa from 1962 asserts that every graph on $n$ vertices and with minimum degree at least $2n/3$ contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Koml\'os, S\'ark\"ozy and Szemer\'edi. In this paper we prove a degree sequence version of P\'osa's conjecture: Given any $\eta >0$, every graph $G$ of sufficiently large order $n$ contains the square of a Hamilton cycle if its degree sequence $d_1\leq \dots \leq d_n$ satisfies $d_i \geq (1/3+\eta)n+i$ for all $i \leq n/3$. The degree sequence condition here is asymptotically best possible. Our approach uses a hybrid of the Regularity-Blow-up method and the Connecting-Absorbing method., Comment: 52 pages, 5 figures, to appear in SIAM J. Discrete Math

International audience; Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such principles. In this paper we consider the No Restart Random Walk (NRRW) model where a walker builds its graph (tree) while moving around. In particular, the walker takes s steps (a parameter) on the current graph. A new node with degree one is added to the graph and connected to the node currently occupied by the walker. The walker then resumes, taking another s steps, and the process repeats. We analyze this process from the perspective of the walker and the network, showing a fundamental dichotomy between transience and recurrence for the walker as well as power law and exponential degree distribution for the network. More precisely, we prove the following results: s = 1: the random walk is transient and the degree of every node is bounded from above by a geometric distribution. s even: the random walk is recurrent and the degree of non-leaf nodes is bounded from below by a power law distribution with exponent decreasing in s. We also provide a lower bound for the fraction of leaves in the graph, and for s = 2 our bound implies that the fraction of leaves goes to one as the graph size goes to infinity. NRRW exhibits an interesting mutual dependency between graph building and random walking that is fundamentally influenced by the parity of s. Understanding this kind of coupled dynamics is an important step towards modeling more realistic network growth processes.

Differential and falsified sampling expansions $\sum_{k\in \mathbb{Z}^d}c_k\phi(M^jx+k)$, where $M$ is a matrix dilation, are studied. In the case of differential expansions, $c_k=Lf(M^{-j}\cdot)(-k)$, where $L$ is an appropriate differential operator. For a large class of functions $\phi$, the approximation order of differential expansions was recently studied. Some smoothness of the Fourier transform of $\phi$ from this class is required. In the present paper, we obtain similar results for a class of band-limited functions $\phi$ with the discontinuous Fourier transform. In the case of falsified expansions, $c_k$ is the mathematical expectation of random integral average of a signal $f$ near the point $M^{-j}k$. To estimate the approximation order of the falsified sampling expansions we compare them with the differential expansions. Error estimations in $L_p$-norm are given in terms of the Fourier transform of $f$., Comment: arXiv admin note: substantial text overlap with arXiv:1407.0321

Let G be a graph and p ϵ [1, oo]. The parameter fp(G) is the least integer k such that for all m and all vectors (rv)vϵV(G) ⊆ Rm, there exist vectors (qv)vϵV(G) ⊆ Rk satisfying ∥v - rw∥p = ∥qv - qw∥p for all vw ϵ E(G). It is easy to check that fp(G) is always finite and that it is minor monotone. By the graph minor theorem of Robertson and Seymour [J. Combin. Theory Ser. B, 92(2004), pp. 325-357], there are a finite number of excluded minors for the property fp(G) ≤ k. In this paper, we determine the complete set of excluded minors for f∞(G) ≤ 2. The two excluded minors are the wheel on five vertices and the graph obtained by gluing two copies of K4 along an edge and then deleting that edge. We also show that the same two graphs are the complete set of excluded minors for f1(G) ≤ 2. In addition, we give a family of examples that show that f∞, is unbounded on the class of planar graphs and f∞, is not bounded as a function of tree-width., SCOPUS: ar.j, info:eu-repo/semantics/published

In this paper we present a new correlation inequality and use it for proving an Almost Sure Local Limit Theorem for the so-called Dickman distribution. Several related results are also proved, 37 pages

A graph is Hamiltonian if it contains a cycle which passes through every vertex of the graph exactly once. A classical theorem of Dirac from 1952 asserts that every graph on $n$ vertices with minimum degree at least $n/2$ is Hamiltonian. We refer to such graphs as Dirac graphs. In this paper we extend Dirac's theorem in two directions and show that Dirac graphs are robustly Hamiltonian in a very strong sense. First, we consider a random subgraph of a Dirac graph obtained by taking each edge independently with probability $p$, and prove that there exists a constant $C$ such that if $p \ge C \log n / n$, then a.a.s. the resulting random subgraph is still Hamiltonian. Second, we prove that if a $(1:b)$ Maker-Breaker game is played on a Dirac graph, then Maker can construct a Hamiltonian subgraph as long as the bias $b$ is at most $cn /\log n$ for some absolute constant $c > 0$. Both of these results are tight up to a constant factor, and are proved under one general framework., 36 pages

Hurwitz numbers count branched covers of the Riemann sphere with specified ramification, or equivalently, transitive permutation factorizations in the symmetric group with specified cycle types. Monotone Hurwitz numbers count a restricted subset of these branched covers, related to the expansion of complete symmetric functions in the Jucys-Murphy elements, and have arisen in recent work on the the asymptotic expansion of the Harish-Chandra-Itzykson-Zuber integral. In previous work we gave an explicit formula for monotone Hurwitz numbers in genus zero. In this paper we consider monotone Hurwitz numbers in higher genera, and prove a number of results that are reminiscent of those for classical Hurwitz numbers. These include an explicit formula for monotone Hurwitz numbers in genus one, and an explicit form for the generating function in arbitrary positive genus. From the form of the generating function we are able to prove that monotone Hurwitz numbers exhibit a polynomiality that is reminiscent of that for the classical Hurwitz numbers, i.e., up to a specified combinatorial factor, the monotone Hurwitz number in genus g with ramification specified by a given partition is a polynomial indexed by g in the parts of the partition., Comment: 23 pages

We prove that an eulerian graph $G$ admits a decomposition into $k$ closed trails of odd length if and only if and it contains at least $k$ pairwise edge-disjoint odd circuits and $k\equiv |E(G)|\pmod{2}$. We conjecture that a connected $2d$-regular graph of odd order with $d\ge 1$ admits a decomposition into $d$ odd closed trails sharing a common vertex and verify the conjecture for $d\le 3$. The case $d=3$ is crucial for determining the flow number of a signed eulerian graph which is treated in a separate paper (arXiv:1408.1703v2). The proof of our conjecture for $d=3$ is surprisingly difficult and calls for the use of signed graphs as a convenient technical tool., 15 pages, 3 figures

In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete mathematics. It is, therefore, of interest to understand the properties of such polynomials and their probabilistic consequences. As an illustration we analyze probabilistic properties of tree--like tableaux, combinatorial objects that are connected to asymmetric exclusion processes. In particular, we show that the number of diagonal boxes in symmetric tree--like tableaux is asymptotically normal and that the number of occupied corners in a random tree--like tableau is asymptotically Poisson. This extends earlier results of Aval, Boussicault, Nadeau, and Laborde Zubieta, respectively., Version 2 is an extended abstract to appear in Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland, 4-8 July 2016

This paper is concerned with the study of diffraction intensities of a relevant class of binary Pisot substitutions via exponential sums. Arithmetic properties of algebraic integers are used to give a new and constructive proof of the fact that there are no diffraction intensities outside the Fourier module of the underlying cut and project schemes. The results are then applied in the context of random substitutions., Comment: 9 pages

Consider a selfadjoint unbounded operator D on a Hilbert space H and a one parameter norm continuous family of selfadjoint bounded operators {A(t)} parametrized by the real line. Then under certain conditions \cite{RS95} that include the assumption that the operators {D(t)= D+A(t)} all have discrete spectrum then the spectral flow along the path { D(t)} can be shown to be equal to the index of d/dt+D(t) when the latter is an unbounded Fredholm operator on L^2(R, H). In \cite{GLMST11} an investigation of the index=spectral flow question when the operators in the path may have some essential spectrum was started but under restrictive assumptions that rule out differential operators in general. In \cite{CGPST14a} the question of what happens when the Fredholm condition is dropped altogether was investigated. In these circumstances the Fredholm index is replaced by the Witten index. In this paper we take the investigation begun in \cite{CGPST14a} much further. We show how to generalise a formula known from the setting of the L^2 index theorem to the non-Fredholm setting. Our main theorem gives a trace formula relating the homological index of \cite{CaKa:TIH} to an integral formula that is known, for a path of selfadjoint Fredholms with compact resolvent and with unitarily equivalent endpoints, to compute spectral flow. Our formula however, applies to paths of selfadjoint non-Fredholm operators. We interpret this as indicating there is a generalisation of spectral flow to the non-Fredholm setting., Comment: 40 pages, the abstract has been shortened in order to accommodate the arXiv regulations

In a recent paper Ben-Zvi and Nadler proved that the induction map from $B$-bundles of degree 0 to semistable $G$-bundles of degree 0 over an elliptic curve is a small map with Galois group isomorphic to the Weyl group of $G$. We generalize their result to all connected components of $\Bun_G$ for an arbitrary reductive group $G$. We prove that for every degree (i.e. topological type) there exists a unique parabolic subgroup such that any semistable $G$\nobreakdash-bundle of this degree has a reduction to it and moreover the induction map is small with Galois group the relative Weyl group of the Levi. This provides new examples of simple automorphic sheaves which are constituents of Eisenstein sheaves for the trivial local system., Comment: 19 pages; contains one table; more typos corrected; there was a gap in the proof (a subsection was added to repair that); added a few references and some remarks about the slope map; comments are welcomed!

Motivated by the idea of $J$-frame for a Krein space $\textbf{\textit{K}}$, introduced by Giribet \textit{et al.} (J. I. Giribet, A. Maestripieri, F. Mart\'inez Per\'{i}a, P. G. Massey, \textit{On frames for Krein spaces}, J. Math. Anal. Appl. (1), {\bf 393} (2012), 122--137.), we introduce the notion of $\zeta-J$-tight frame for a Krein space $\textbf{\textit{K}}$. In this paper we characterize $J$-orthonormal basis for $\textbf{\textit{K}}$ in terms of $\zeta-J$-Parseval frame. We show that a Krein space is richly supplied with $\zeta-J$-Parseval frames. We also provide a necessary and sufficient condition when the linear sum of two $\zeta-J$-Parseval frames is again a $\zeta-J$-Parseval frame. We then generalize the notion of $J$-frame potential in Krein space from Hilbert space frame theory. Finally we provided a necessary and sufficient condition for a $J$-frame potential of the corresponding $\zeta-J$-tight frame to be minimum.

The ring of Fermat reals is an extension of the real field containing nilpotent infinitesimals, and represents an alternative to Synthetic Differential Geometry in classical logic. In the present paper, our first aim is to study this ring from using standard topological and algebraic structures. We present the Fermat topology, generated by a complete pseudo-metric, and the omega topology, generated by a complete metric. The first one is closely related to the differentiation of (non standard) smooth functions defined on open sets of Fermat reals. The second one is connected to the differentiation of smooth functions defined on infinitesimal sets. Subsequently, we prove that every (proper) ideal is a set of infinitesimals whose order is less than or equal to some real number. Finally, we define and study roots of infinitesimals. A computer implementation as well as an application to infinitesimal Taylor formulas with fractional derivatives are presented., Comment: 43 pages

Let $G$ be a finite group. In this paper we present a tool for counting the number of principle $G$-bundles over a surface. As an application, we express (non-standard) generating functions for double Hurwitz numbers as integrals over commutative Frobenius algebras, associated with symmetric groups., 15 pages, 5 figures