Search

Amdeberhan's conjectures on the enumeration, the average size, and the largest size of $(n,n+1)$-core partitions with distinct parts have motivated many research on this topic. Recently, Straub and Nath-Sellers obtained formulas for the numbers of $(n, dn-1)$ and $(n, dn+1)$-core partitions with distinct parts, respectively. Let $X_{s,t}$ be the size of a uniform random $(s,t)$-core partition with distinct parts when $s$ and $t$ are coprime to each other. Some explicit formulas for the $k$-th moments $\mathbb{E} [X_{n,n+1}^k]$ and $\mathbb{E} [X_{2n+1,2n+3}^k]$ were given by Zaleski and Zeilberger when $k$ is small. Zaleski also studied the expectation and higher moments of $X_{n,dn-1}$ and conjectured some polynomiality properties concerning them in arXiv:1702.05634. Motivated by the above works, we derive several polynomiality results and asymptotic formulas for the $k$-th moments of $X_{n,dn+1}$ and $X_{n,dn-1}$ in this paper, by studying the beta sets of core partitions. In particular, we show that these $k$-th moments are asymptotically some polynomials of n with degrees at most $2k$, when $d$ is given and $n$ tends to infinity. Moreover, when $d=1$, we derive that the $k$-th moment $\mathbb{E} [X_{n,n+1}^k]$ of $X_{n,n+1}$ is asymptotically equal to $\left(n^2/10\right)^k$ when $n$ tends to infinity. The explicit formulas for the expectations $\mathbb{E} [X_{n,dn+1}]$ and $\mathbb{E} [X_{n,dn-1}]$ are also given. The $(n,dn-1)$-core case in our results proves several conjectures of Zaleski on the polynomiality of the expectation and higher moments of $X_{n,dn-1}$., Comment: This paper has been accepted for publication in SCIENCE CHINA Mathematics

International audience; Let A * denote the free monoid generated by a finite nonempty set A. In this paper we introduce a new measure of complexity of languages L ⊆ A * defined in terms of the semigroup structure on A *. For each L ⊆ A * , we define its cost c(L) as the infimum of all real numbers α for which there exist a language S ⊆ A * with p S (n) = O(n α) and a positive integer k with L ⊆ S k. We also define the cost dimension d c (L) as the infimum of the set of all positive integers k such that L ⊆ S k for some language S with p S (n) = O(n c(L)). We are primarily interested in languages L given by the set of factors of an infinite word x = x 0 x 1 x 2 • • • ∈ A N of zero topological entropy, in which case c(L) < +∞. We establish the following characterisation of words of linear factor complexity: Let x ∈ A N and L = Fac(x) be the set of factors of x. Then p x (n) = Θ(n) if and only c(L) = 0 and d c (L) = 2. In other words, p x (n) = O(n) if and only if Fac(x) ⊆ S 2 for some language S ⊆ A + of bounded complexity (meaning lim sup p S (n) < +∞). In general the cost of a language L reflects deeply the underlying combinatorial structure induced by the semigroup structure on A *. For example, in contrast to the above characterisation of languages generated by words of sublinear complexity, there exist non factorial languages L of complexity p L (n) = O(log n) (and hence of cost equal to 0) and of cost dimension +∞. In this paper we investigate the cost and cost dimension of languages defined by infinite words of zero topological entropy. We establish the existence of words of cost zero and finite cost dimension having arbitrarily high polynomial complexity. In contrast we also show that for each α > 2 there exist infinite words x of positive cost and of complexity p x (n) = O(n α).

In this paper, we study the quotient and “blow-up” of graph-of-groups [Formula: see text] and of their automorphisms [Formula: see text]. We show that the existence of such a blow-up of any [Formula: see text], relative to a given family of “local” graph-of-groups isomorphisms [Formula: see text] depends crucially on the [Formula: see text]-conjugacy class of the correction term [Formula: see text] for any edge [Formula: see text] of [Formula: see text], where [Formula: see text]-conjugacy is a new but natural concept introduced here. As an application, we obtain a criterion as to whether a partial Dehn twist can be blown up relative to local Dehn twists, to give an actual Dehn twist. The results of this paper are also used crucially in the follow-up papers [Lustig and Ye, Normal form and parabolic dynamics for quadratically growing automorphisms of free groups, arXiv:1705.04110v2; Ye, Partial Dehn twists of free groups relative to local Dehn twists — A dichotomy, arXiv:1605.04479 ; When is a polynomially growing automorphism of [Formula: see text] geometric, arXiv:1605.07390 ].

In this paper we consider generalized eigenvalue problems for a family of operators with a quadratic dependence on a complex parameter. Our model is L ( λ ) = − △ + ( P ( x ) − λ ) 2 in L 2 ( R d ) where P is a positive elliptic polynomial in R d of degree m ⩾ 2 . It is known that for d even, or d = 1 , or d = 3 and m ⩾ 6 , there exist λ ∈ C and u ∈ L 2 ( R d ) , u ≠ 0 , such that L ( λ ) u = 0 . In this paper, we give a method to prove existence of non-trivial solutions for the equation L ( λ ) u = 0 , valid in every dimension d ⩾ 1 . This is a partial answer to a conjecture in Helffer, Robert and Xue Ping Wang (2004) [13] .

In this paper, we generalize a permutation model for free random variables which was first proposed by Biane in \cite{biane}. We also construct its classical probability analogue, by replacing the group of permutations with the group of subsets of a finite set endowed with the symmetric difference operation. These constructions provide new discrete approximations of the respective free and classical Wiener chaos. As a consequence, we obtain explicit examples of non random matrices which are asymptotically free or independent. The moments and the free (resp. classical) cumulants of the limiting distributions are expressed in terms of a special subset of (noncrossing) pairings. At the end of the paper we present some combinatorial applications of our results., Comment: 13 pages, to appear in Pacific Journal of Mathematics

In this paper we deal with the following family of exponential maps $(f_\lambda:z\mapsto \lambda(e^z-1))_{\lambda\in [1,+\infty)}$. Denoting $d(\lambda)$ the hyperbolic dimension of $f_\lambda$. It is known that the function $\lambda\mapsto d(\lambda)$ is real analytic in $(1,+\infty)$, and that it is continuous in $[1,+\infty)$. In this paper we prove that this map is C$^1$ on $[1,+\infty)$, with $d'(1^+)=0$. Moreover, depending on the value of $d(1)$, we give estimates of the speed of convergence towards 0., Comment: 32 pages. A para\^itre dans Annales Academi{\ae} Scientiarum Fennic{\ae} Mathematica

In two fundamental classical papers, Masur and Veech have independently proved that the Teichmueller geodesic flow acts ergodically on each connected component of each stratum of the moduli space of quadratic differentials. It is therefore interesting to have a classification of the ergodic components. Veech has proved that these strata are not necessarily connected. In a recent work, Kontsevich and Zorich have completely classified the components in the particular case where the quadratic differentials are given by the global square of Abelian differentials. Here we are interested in the complementary case. In a previous paper, we have described some particular component, namely the hyperelliptic connected components, and showed that some strata are non-connected. In this paper, we give the general classification theorem: up to four exceptional cases in low genera, the strata of meromorphic quadratic differentials are either connected, or have exactly two connected components. In this last case, one component is hyperelliptic, the other not. Our proof is based on a new approach of the so-called Jenkins-Strebel differential. We will present and use the notion of generalized permutations., 49 pages, 12 figures, submitted. major revision, typos corrected

This paper has been withdrawn by the author due to its publication, This paper has been withdrawn

In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n > m), and l = m - n empty places. For a noncomputer science-minded reader, we shall use the metaphore of n cars parking on m places: each car ci chooses a place pi at random, and if pi is occupied, ci tries successively pi + 1, pi + 2, until it finds an empty place. Pittel [42] proves that when l/m goes to some positive limit β > 1, the size B1m,l1 of the largest block of consecutive cars satisfies 2(β - 1 - log β)B1m,l - 3 log log m + Ξm, where Ξm converges weakly to an extreme-value distribution. In this paper we examine at which level for n a phase transition occurs between B1m,l = o(m) and m - B1m,l = o(m). The intermediate case reveals an interesting behavior of sizes of blocks, related to the standard additive coalescent in the same way as the sizes of connected components of the random graph are related to the multiplicative coalescent.

The Congruence Lattice Problem (CLP), stated by R. P. Dilworth in the forties, asks whether every distributive {∨, 0}-semilattice S is isomorphic to the semilattice Con c L of compact congruences of a lattice L. While this problem is still open, many partial solutions have been obtained, positive and negative as well. The solution to CLP is known to be positive for all S such that |S|≤ℵ1. Furthermore, one can then take Lwith permutable congruences. This contrasts with the case where |S|≥ℵ2, where there are counterexamples S for which Lcannot be, for example, sectionally complemented. We prove in this paper that the lattices of these counterexamples cannot have permutable congruences as well. We also isolate finite, combinatorial analogues of these results. All the "finite" statements that we obtain are amalgamation properties of the Con c functor. The strongest known positive results, which originate in earlier work by the first author, imply that many diagrams of semilattices indexed by the square22 can be lifted with respect to the Con c functor. We prove that the latter results cannot be extended to the cube, 23. In particular, we give an example of a cube diagram of finite Boolean semilattices and semilattice embeddings that cannot be lifted, with respect to the Con c functor, by lattices with permutable congruences. We also extend many of our results to lattices with almost permutable congruences, that is, α∨β=αβ ∪βα, for all congruences α and β. We conclude the paper with a very short proof that no functor from finite Boolean semilattices to lattices can lift the Con c functor on finite Boolean semilattices.

In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families $\mathcal F_1,\ldots, \mathcal F_s$ of tuples in $\{1,\ldots, n\}^k$, provided $s\ge 470.$

We prove an asymptotic formula for the mean-square average of L-functions associated with subgroups of characters of sufficiently large size. Our proof relies on the study of certain character sums ${\mathcal{A}}(p,d)$ recently introduced by E. Elma, where p ≥ 3 is prime and d ≥ 1 is any odd divisor of p − 1. We obtain an asymptotic formula for ${\mathcal{A}}(p,d),$ which holds true for any odd divisor d of p − 1, thus removing E. Elma’s restrictions on the size of d. This answers a question raised in Elma’s paper. Our proof relies on both estimates on the frequency of large character sums and techniques from the theory of uniform distribution. As an application, in the range $1\leq d\leq\frac{\log p}{3\log\log p}$, we obtain a significant improvement $h_{p,d}^- \leq 2(\frac{(1+o(1))p}{24})^{m/4}$ over the trivial bound $h_{p,d}^- \ll (\frac{dp}{24} )^{m/4}$ on the relative class numbers of the imaginary number fields of conductor $p\equiv 1\mod{2d}$ and degree $m=(p-1)/d$, where d ≥ 1 is odd.

In this paper we address the following shape optimization problem: find the planar domain of least area, among the sets with prescribed constant width and inradius. In the literature, the problem is ascribed to Bonnesen, who proposed it in \cite{BF}. In the present work, we give a complete answer to the problem, providing an explicit characterization of optimal sets for every choice of width and inradius. These optimal sets are particular Reuleaux polygons., Comment: to appear in Journal Ecole Polytechnique

We prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on the number, the degree and the number of variables of the polynomials describing a semi-algebraic set $S$ and a point $x$ in $\bar S$, we find a semi-algebraic path starting at $x$ and entering in $S$ with a description of degree $(O(d)^{3k+3},O(d)^{k})$ (using a precise definition of the description of a semi-algebraic path and its degree given in the paper). As a consequence, we prove that there exists a semi-algebraic path starting at $x$ and entering in $S$, such that the degree of the Zariski closure of the image of this path is bounded by $O(d)^{4k+3}$, improving a result of Jelonek and Kurdyka. We also give an algorithm for describing the real isolated points of $S$ whose complexity is bounded by $s^{2 k+1}d^{O(k)}$ improving a result of Le, Safey el Din, and de Wolff., Comment: Final version to appear in Mathematische Zeitschrift

Let f be a post-critically finite endomorphism (PCF map for short) on $${\mathbb {P}}^2$$ , let $$J_1$$ denote the Julia set and let $$J_2$$ denote the support of the measure of maximal entropy. In this paper we show that: 1. $$J_1\setminus J_2$$ is contained in the union of the (finitely many) basins of critical component cycles and stable manifolds of sporadic super-saddle cycles. 2. For every $$x\in J_2$$ which is not contained in the stable manifold of a sporadic super-saddle cycle, there is no Fatou disk containing x. Here sporadic means that the super-saddle cycle is not contained in a critical component cycle. Under the additional assumption that all branches of PC(f) are smooth and intersect transversally, we show that there is no sporadic super-saddle cycle. Thus in this case $$J_1\setminus J_2$$ is contained in the union of the basins of critical component cycles, and for every $$x\in J_2$$ there is no Fatou disk containing x. As consequences of our result: 1.We answer some questions of Fornaess-Sibony about the non-wandering set for PCF maps on $${\mathbb {P}}^2$$ with no sporadic super-saddle cycles. 2. We give a new proof of de Thelin’s laminarity of the Green currents in $$J_1\setminus J_2$$ for PCF maps on $${\mathbb {P}}^2$$ . 3. We show that for PCF maps on $${\mathbb {P}}^2$$ an invariant compact set is expanding if and only if it does not contain critical points, and we obtain characterizations of PCF maps on $${\mathbb {P}}^2$$ which are expanding on $$J_2$$ or satisfy Axiom A.

A hole in a graph is an induced cycle of length at least $4$, and an antihole is the complement of an induced cycle of length at least $4$. A hole or antihole is long if its length is at least $5$. For an integer $k$, the $k$-prism is the graph consisting of two cliques of size $k$ joined by a matching. The complexity of Maximum (Weight) Independent Set (MWIS) in long-hole-free graphs remains an important open problem. In this paper we give a polynomial time algorithm to solve MWIS in long-hole-free graphs with no $k$-prism (for any fixed integer $k$), and a subexponential algorithm for MWIS in long-hole-free graphs in general. As a special case this gives a polynomial time algorithm to find a maximum weight clique in perfect graphs with no long antihole, and no hole of length $6$. The algorithms use the framework of minimal chordal completions and potential maximal cliques.

Let N be a closed oriented k-dimensional submanifold of the (k+2)-dimensional sphere; denote its complement by C(N). Denote by x the 1-dimensional cohomology class in C(N), dual to N. The Morse-Novikov number of C(N) is by definition the minimal possible number of critical points of a regular Morse map f from C(N) to a circle, such that f belongs to x. In the first part of this paper we study the case when N is the twist frame spun knot associated to an m-knot K. We obtain a formula which relates the Morse-Novikov numbers of N and K and generalizes the classical results of D. Roseman and E.C. Zeeman about fibrations of spun knots. In the second part we apply the obtained results to the computation of Morse-Novikov numbers of surface-links in 4-sphere., 13 pages

This paper introduces a new method to solve the problem of the approximation of the diagonal for face-coherent families of polytopes. We recover the classical cases of the simplices and the cubes and we solve it for the associahedra, also known as Stasheff polytopes. We show that it satisfies an easy-to-state cellular formula. For the first time, we endow a family of realizations of the associahedra (the Loday realizations) with a topological and cellular operad structure; it is shown to be compatible with the diagonal maps., Comment: 19 pages, 7 figures. Comments are welcome

In the $r$-neighbour bootstrap process on a graph $G$, vertices are infected (in each time step) if they have at least $r$ already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising model of ferromagnetism, and kinetically constrained spin models of the liquid-glass transition, the most extensively-studied case is the two-neighbour bootstrap process on the two-dimensional grid $[n]^2$. Around 15 years ago, in a major breakthrough, Holroyd determined the sharp threshold for percolation in this model, and his bounds were subsequently sharpened further by Gravner and Holroyd, and by Gravner, Holroyd and Morris. In this paper we strengthen the lower bound of Gravner, Holroyd and Morris by proving that the critical probability $p_c\big( [n]^2,2 \big)$ for percolation in the two-neighbour model on $[n]^2$ satisfies \[p_c\big( [n]^2,2 \big) = \frac{\pi^2}{18\log n} - \frac{\Theta(1)}{(\log n)^{3/2}}\,.\] The proof of this result requires a very precise understanding of the typical growth of a critical droplet, and involves a number of technical innovations. We expect these to have other applications, for example, to the study of more general two-dimensional cellular automata, and to the $r$-neighbour process in higher dimensions., Comment: 53 pages, 6 figures, 1 appendix

For the random interval partition of $[0,1]$ generated by the uniform stick-breaking scheme known as GEM$(1)$, let $u_k$ be the probability that the first $k$ intervals created by the stick-breaking scheme are also the first $k$ intervals to be discovered in a process of uniform random sampling of points from $[0,1]$. Then $u_k$ is a renewal sequence. We prove that $u_k$ is a rational linear combination of the real numbers $1, \zeta(2), \ldots, \zeta(k)$ where $\zeta$ is the Riemann zeta function, and show that $u_k$ has limit $1/3$ as $k \to \infty$. Related results provide probabilistic interpretations of some multiple zeta values in terms of a Markov chain derived from the interval partition. This Markov chain has the structure of a weak record chain. Similar results are given for the GEM$(\theta)$ model, with beta$(1,\theta)$ instead of uniform stick-breaking factors, and for another more algebraic derivation of renewal sequences from the Riemann zeta function., Comment: 25 pages. This paper is published by https://www.ams.org/journals/tran/2019-371-08/S0002-9947-2018-07516-X/

In this paper, we study the behaviour of the shortest distance between orbits and show that under some rapidly mixing conditions, the decay of the shortest distance depends on the correlation dimension. For irrational rotations, we prove a different behaviour depending on the irrational exponent of the angle of the rotation. For random processes, this problem corresponds to the longest common substring problem. We extend the result of Arratia and Waterman on sequence matching to $\alpha$-mixing processes with exponential decay., Comment: Final version. Accepted for publication in Advances in Mathematics

In set theory without the axiom of Choice ZF, we prove that for every commutative field IK, the following statement D_{\IK}: "On every non null IK-vector space, there exists a non null linear form" implies the existence of a IK-linear extender on every vector subspace of a $\IK$-vector space. This solves a question raised in \cite{Mo09}. In the second part of the paper, we generalize our results in the case of spherically complete ultrametric valued fields, and show that Ingleton's statement is equivalent to the existence of "isometric linear extenders".

The infinite pigeonhole principle for 2-partitions asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we develop a new notion of forcing enabling a fine analysis of the computability-theoretic features of the pigeonhole principle. We deduce various consequences, such as the existence, for every set $A$, of an infinite subset of it or its complement of non-high degree. We also prove that every $\Delta^0_3$ set has an infinite low${}_3$ solution and give a simpler proof of Liu's theorem that every set has an infinite subset in it or its complement of non-PA degree., Comment: 20 pages

In 1994, Becker conjectured that if $F(z)$ is a $k$-regular power series, then there exists a $k$-regular rational function $R(z)$ such that $F(z)/R(z)$ satisfies a Mahler-type functional equation with polynomial coefficients where the initial coefficient satisfies $a_0(z)=1$. In this paper, we prove Becker's conjecture in the best-possible form; we show that the rational function $R(z)$ can be taken to be a polynomial $z^\gamma Q(z)$ for some explicit non-negative integer $\gamma$ and such that $1/Q(z)$ is $k$-regular., Comment: 19 pages

The Maker-Breaker domination game is played on a graph $G$ by Dominator and Staller. The players alternatively select a vertex of $G$ that was not yet chosen in the course of the game. Dominator wins if at some point the vertices he has chosen form a dominating set. Staller wins if Dominator cannot form a dominating set. In this paper we introduce the Maker-Breaker domination number $\gamma_{{\rm MB}}(G)$ of $G$ as the minimum number of moves of Dominator to win the game provided that he has a winning strategy and is the first to play. If Staller plays first, then the corresponding invariant is denoted $\gamma_{{\rm MB}}'(G)$. Comparing the two invariants it turns out that they behave much differently than the related game domination numbers. The invariant $\gamma_{{\rm MB}}(G)$ is also compared with the domination number. Using the Erd\H{o}s-Selfridge Criterion a large class of graphs $G$ is found for which $\gamma_{{\rm MB}}(G) > \gamma(G)$ holds. Residual graphs are introduced and used to bound/determine $\gamma_{{\rm MB}}(G)$ and $\gamma_{{\rm MB}}'(G)$. Using residual graphs, $\gamma_{{\rm MB}}(T)$ and $\gamma_{{\rm MB}}'(T)$ are determined for an arbitrary tree. The invariants are also obtained for cycles and bounded for union of graphs. A list of open problems and directions for further investigations is given., Comment: 20 pages, 5 figures

International audience; This paper is concerned with qualitative properties of solutions to nonlocal reaction-diffusion equations of the form$$ \int_{\mathbb{R}^N\setminus K} J(x-y)\,\big( u(y)-u(x) \big)\,\D y+f(u(x))=0, \quad x\in\R^N\setminus K,$$set in a perforated open set $\mathbb{R}^N\setminus K$, where $K\subset\mathbb{R}^N$ is a bounded compact ``obstacle" and $f$ is a bistable nonlinearity. When $K$ is convex, we prove some Liouville-type results for solutions satisfying some asymptotic limiting conditions at infinity. We also establish a robustness result, assuming slightly relaxed conditions on $K$.

In this paper, we provide refined sufficient conditions for the quadratic Chabauty method to produce a finite set of points, with the conditions on the rank of the Jacobian replaced by conditions on the rank of a quotient of the Jacobian plus an associated space of Chow-Heegner points. We then apply this condition to prove the finiteness of this set for any modular curves $X_{\mathrm{ns} }^+ (N)$ and $X_0 ^+ (N)$ of genus at least 2 with N prime. The proof relies on the existence of a quotient of their Jacobians whose Mordell-Weil rank is equal to its dimension (and at least 2), which is proven via analytic estimates for orders of vanishing of L-functions of modular forms, thanks to a Kolyvagin-Logachev type result., Comment: 51 pages, comments welcome

This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs. Unfortunately this strategy usually does not lead to an efficient recognition algorithm. On the other hand, many graph classes can be efficiently recognized by techniques based on some interesting orderings of the nodes, such as the ones given by traversals. We study specifically graph classes that have an ordering avoiding some ordered structures. More precisely, we consider what we call patterns on three nodes, and the recognition complexity of the associated classes. In this domain, there are two key previous works. Damashke started the study of the classes defined by forbidden patterns, a set that contains interval, chordal and bipartite graphs among others. On the algorithmic side, Hell, Mohar and Rafiey proved that any class defined by a set of forbidden patterns can be recognized in polynomial time. We improve on these two works, by characterizing systematically all the classes defined sets of forbidden patterns (on three nodes), and proving that among the 23 different classes (up to complementation) that we find, 21 can actually be recognized in linear time. Beyond this result, we consider that this type of characterization is very useful, leads to a rich structure of classes, and generates a lot of open questions worth investigating., Third version version. 38 pages

The model of FCFS infinite bipartite matching was introduced in caldentey-kaplan-weiss 2009. In this model there is a sequence of items that are chosen i.i.d. from $\mathcal{C}=\{c_1,\ldots,c_I\}$ and an independent sequence of items that are chosen i.i.d. from $\mathcal{S}=\{s_1,\ldots,s_J\}$, and a bipartite compatibility graph $G$ between $\mathcal{C}$ and $\mathcal{S}$. Items of the two sequences are matched according to the compatibility graph, and the matching is FCFS, each item in the one sequence is matched to the earliest compatible unmatched item in the other sequence. In adan-weiss 2011 a Markov chain associated with the matching was analyzed, a condition for stability was verified, a product form stationary distribution was derived and the rates $r_{c_i,s_j}$ of matches between compatible types $c_i$ and $s_j$ were calculated. In the current paper, we present several new results that unveil the fundamental structure of the model. First, we provide a pathwise Loynes' type construction which enables to prove the existence of a unique matching for the model defined over all the integers. Second, we prove that the model is dynamically reversible: we define an exchange transformation in which we interchange the positions of each matched pair, and show that the items in the resulting permuted sequences are again independent and i.i.d., and the matching between them is FCFS in reversed time. Third, we obtain product form stationary distributions of several new Markov chains associated with the model. As a by product, we compute useful performance measures, for instance the link lengths between matched items., Comment: 33 pages, 12 figures

International audience; Let S ⊆ N be a numerical semigroup with multiplicity m = min(S \ {0}), conductor c = max(N \ S) + 1 and minimally generated by e elements. Let L be the set of elements of S which are smaller than c. Wilf conjectured in 1978 that |L| is bounded below by c/e. We show here that if c ≤ 3m, then S satisfies Wilf's conjecture. Combined with a recent result of Zhai, this implies that the conjecture is asymptotically true as the genus g(S) = |N \ S| goes to infinity. One main tool in this paper is a classical theorem of Macaulay on the growth of Hilbert functions of standard graded algebras.

International audience; We consider small polynomial deformations of integrable systems of the form $dF=0, F\in\mathbb{C}[x,y]$ and the first nonzero term $M_\mu$ of the displacement function $\Delta(t,\epsilon)=\sum_{i=\mu}M_i(t)\epsilon^i$ along a cycle $\gamma(t)\in F^{-1}(t)$. It is known that $M_\mu$ is an iterated integral of length at most $\mu$. The bound $\mu$ epends on the deformation of $dF$.In this paper we give a universal bound for the length of the iterated integral expressing the first nonzero term $\mu$ depending only on the geometry of the unperturbed system $dF=0$. The result generalizes the result of Gavrilov and Iliev providing a sufficient condition for $M_\mu$ to be given by an abelian integral, i.e., by an iterated integral of length 1. We conjecture that our bound is optimal.

In the present paper, we introduce a new approach, relying on the Galois theory of difference equations, to study the nature of the generating series of walks in the quarter plane. Using this approach, we are not only able to recover many of the recent results about these series, but also to go beyond them. For instance, we give for the first time hypertranscendency results, {\it i.e.}, we prove that certain of these generating series do not satisfy any nontrivial nonlinear algebraic differential equation with rational coefficients., To appear in Inventiones Mathematicae

In this paper, we explore the fixed point theory of $n$-valued maps using configuration spaces and braid groups, focussing on two fundamental problems, the Wecken property, and the computation of the Nielsen number. We show that the projective plane (resp.\ the $2$-sphere ${\mathbb S}^{2}$) has the Wecken property for $n$-valued maps for all $n\in {\mathbb N}$ (resp.\ all $n\geq 3$). In the case $n=2$ and ${\mathbb S}^{2}$, we prove a partial result about the Wecken property. We then describe the Nielsen number of a non-split $n$-valued map $\phi\colon\thinspace X \multimap X$ of an orientable, compact manifold without boundary in terms of the Nielsen coincidence numbers of a certain finite covering $q\colon\thinspace \widehat{X} \to X$ with a subset of the coordinate maps of a lift of the $n$-valued split map $\phi\circ q\colon\thinspace \widehat{X} \multimap X$., Comment: To appear in Science China Math

The present paper presents a counterexample to the sequentially weak density of smooth maps between two manifolds $M$ and $N$ in the Sobolev space $W^{1, p} (M, N)$, in the case $p$ is an integer. It has been shown that, if $p, Comment: 68 pages

The elastic energy of a planar convex body is defined by $E(\Om)=\frac 12\,\int\_{\partial\Om} k^2(s)\,ds$where $k(s)$ is the curvature of the boundary. In this paper we are interested in the minimization problemof $E(\Om)$ with a constraint on the inradius of $\Om$. By contrast with all the other minimization problemsinvolving this elastic energy (with a perimeter, area, diameter or circumradius constraints) for which thesolution is always the disk, we prove here that the solution of this minimization problem is not the disk and we completely characterizeit in terms of elementary functions., Equipe EDP et Applications

In this paper, the spectrum of the following fourth order problem $$\begin{aligned} {\left\{ \begin{array}{ll} \varDelta ^2 u+\nu u=-\lambda \varDelta u &{}\quad \text {in } D_1,\\ u=\partial _r u= 0 &{}\quad \text {on } \partial D_1, \end{array}\right. } \end{aligned}$$ where $$D_1$$ is the unit ball in $${\mathbb {R}}^N$$ , is determined for $$\nu < 0$$ as well as the nodal properties of the corresponding eigenfunctions. In particular, we show that the first eigenvalue is simple and that the corresponding eigenfunction is radial and (up to a multiplicative factor) positive and decreasing with respect to the radius. This completes earlier results obtained for $$\nu \geqslant 0$$ (see Coster et al. in Positivity 19:843–875, 2015) and for $$\nu

Let $$\mathcal S$$ be an abelian group of automorphisms of a probability space $$(X, {\mathcal A}, \mu )$$ with a finite system of generators $$(A_1, \ldots , A_d).$$ Let $$A^{{\underline{\ell }}}$$ denote $$A_1^{\ell _1} \ldots A_d^{\ell _d}$$ , for $${{\underline{\ell }}}= (\ell _1, \ldots , \ell _d).$$ If $$(Z_k)$$ is a random walk on $${\mathbb {Z}}^d$$ , one can study the asymptotic distribution of the sums $$\sum _{k=0}^{n-1} \, f \circ A^{\,{Z_k(\omega )}}$$ and $$\sum _{{\underline{\ell }}\in {\mathbb {Z}}^d} {\mathbb {P}}(Z_n= {\underline{\ell }}) \, A^{\underline{\ell }}f$$ , for a function f on X. In particular, given a random walk on commuting matrices in $$SL(\rho , {\mathbb {Z}})$$ or in $${\mathcal M}^*(\rho , {\mathbb {Z}})$$ acting on the torus $${\mathbb {T}}^\rho $$ , $$\rho \ge 1$$ , what is the asymptotic distribution of the associated ergodic sums along the random walk for a smooth function on $${\mathbb {T}}^\rho $$ after normalization? In this paper, we prove a central limit theorem when X is a compact abelian connected group G endowed with its Haar measure (e.g., a torus or a connected extension of a torus), $$\mathcal S$$ a totally ergodic d-dimensional group of commuting algebraic automorphisms of G and f a regular function on G. The proof is based on the cumulant method and on preliminary results on random walks.

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our result is the first part towards a conjecture by Tan Lei, stating that all (cubic) Newton maps can be described as matings or captures., Comment: 15 figures

In this paper we consider the problem u in H^1_0 (Omega), - div (A(x) Du) = H(x, u, Du) + f(x) + a_0 (x) u in D'(Omega), where Omega is an open bounded set of R^N, N \geq 3, A(x) is a coercive matrix with coefficients in L^\infty(Omega), H(x, s, xi) is a Carath��odory function which satisfies for some gamma > 0 -c_0 A(x) xi xi \leq H(x, s, xi) sign (s) \leq gamma A(x) xi xi a.e. x in Omega, forall s in R, forall xi in R^N, f belongs to L^{N/2} (Omega), and a_0 \geq 0 to L^q (Omega ), q > N/2. For f and a_0 sufficiently small, we prove the existence of at least one solution u of this problem which is moreover such that e^{delta_0 |u|} - 1 belongs to H^1_0 (Omega) for some delta_0 \geq gamma, and which satisfies an a priori estimate., 37 pages, 2 figures

Toward a partial classification of monomial ideals with $d$-linear resolution, in this paper, some classes of $d$-uniform clutters which do not have linear resolution, but every proper subclutter of them has a $d$-linear resolution, are introduced and the regularity and Betti numbers of circuit ideals of such clutters are computed. Also, it is proved that for given two $d$-uniform clutters $\mathcal{C}_1, \mathcal{C}_2$, the Castelnuovo-Mumford regularity of the ideal $I(\bar{\mathcal{C}_1 \cup \mathcal{C}_2})$ is equal to the maximum of regularities of $I(\bar{\C}_1)$ and $I(\bar{\C}_2)$, whenever $V(\mathcal{C}_1) \cap V(\mathcal{C}_2)$ is a clique or ${\rm SC}(\mathcal{C}_1) \cap {\rm SC}(\mathcal{C}_2)=\emptyset$. As applications, alternative proofs are given for Fr\"oberg's Theorem on linearity of edge ideal of graphs with chordal complement as well as for linearity of generalized chordal hypergraphs defined by Emtander. Finally, we find minimal free resolutions of the circuit ideal of a triangulation of a pseudo-manifold and a homology manifold explicitly., Comment: 16 pages

In this paper, we introduce a new scale of tent spaces which covers, the (weighted) tent spaces of Coifman-Meyer-Stein and of Hofmann-Mayboroda-McIntosh, and some other tent spaces considered by Dahlberg, Kenig-Pipher and Auscher-Axelsson in elliptic equations. The strong factorizations within our tent spaces, with applications to quasi-Banach complex interpolation and to multiplier-duality theory, are established. This way, we unify and extend the corresponding results obtained by Coifman-Meyer-Stein, Cohn-Verbitsky and Hyt\"onen-Ros\'en., Comment: 20 pages. Comments are welcome

We consider a continuum percolation model on $$\mathbb {R}^d$$ , $$d\ge 1$$ . For $$t,\lambda \in (0,\infty )$$ and $$d\in \{1,2,3\}$$ , the occupied set is given by the union of independent Brownian paths running up to time t whose initial points form a Poisson point process with intensity $$\lambda >0$$ . When $$d\ge 4$$ , the Brownian paths are replaced by Wiener sausages with radius $$r>0$$ . We establish that, for $$d=1$$ and all choices of t, no percolation occurs, whereas for $$d\ge 2$$ , there is a non-trivial percolation transition in t, provided $$\lambda $$ and r are chosen properly. The last statement means that $$\lambda $$ has to be chosen to be strictly smaller than the critical percolation parameter for the occupied set at time zero (which is infinite when $$d\in \{2,3\}$$ , but finite and dependent on r when $$d\ge 4$$ ). We further show that for all $$d\ge 2$$ , the unbounded cluster in the supercritical phase is unique. Along the way a finite box criterion for non-percolation in the Boolean model is extended to radius distributions with an exponential tail. This may be of independent interest. The present paper settles the basic properties of the model and should be viewed as a springboard for finer results.

In this paper we study the topology of the stack $\mathcal{T}_g$ of smooth trigonal curves of genus g, over the complex field. We make use of a construction by the first named author and Vistoli, that describes $\mathcal{T}_g$ as a quotient stack of the complement of the discriminant. This allows us to use techniques developed by the second named author to give presentations of the orbifold fundamental group of $\mathcal{T}_g$, of its substrata with prescribed Maroni invariant and describe their relation with the mapping class group $\mathcal{M}ap_g$ of Riemann surfaces of genus g., To appear on Selecta Math

International audience; In this paper, we consider three problems about signs of the Fourier coefficients of a cusp form $\mathfrak{f}$ with half-integral weight:\begin{itemize}\item[--]The first negative coefficient of the sequence $\{\mathfrak{a}_{\mathfrak{f}}(tn^2)\}_{n\in \N}$,\item[--]The number of coefficients $\mathfrak{a}_{\mathfrak{f}}(tn^2)$ of same signs,\item[--]Non-vanishing of coefficients $\mathfrak{a}_{\mathfrak{f}}(tn^2)$ in short intervals and in arithmetic progressions,\end{itemize}where $\mathfrak{a}_{\mathfrak{f}}(n)$ is the $n$-th Fourier coefficient of $\mathfrak{f}$ and $t$ is a square-free integersuch that $\mathfrak{a}_{\mathfrak{f}}(t)\not=0$.

International audience; In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the number of fixed points that only depends on $D$. We then discover relationships between the number of fixed points of $f$ and problems in coding theory, especially the design of codes for the asymmetric channel. Using these relationships, we derive upper and lower bounds on the number of fixed points, which significantly improve those given in the literature. We also unveil some interesting behaviour of the number of fixed points of functions with a given signed digraph when the alphabet varies. We finally prove that signed digraphs with more (disjoint) positive cycles actually do not necessarily have functions with more fixed points.

The paper consists of two parts. In the first part, by using the Gauss-Bonnet curvature, which is a natural generalization of the scalar curvature, we introduce a higher order mass, the Gauss-Bonnet-Chern mass $m^{\H}_k$, for asymptotically hyperbolic manifolds and show that it is a geometric invariant. Moreover, we prove a positive mass theorem for this new mass for asymptotically hyperbolic graphs and establish a relationship between the corresponding Penrose type inequality for this mass and weighted Alexandrov-Fenchel inequalities in the hyperbolic space $\H^n$. In the second part, we establish these weighted Alexandrov-Fenchel inequalities in $\H^n$ for any horospherical convex hypersurface $\Sigma$. As an application, we obtain an optimal Penrose type inequality for the new mass defined in the first part for asymptotically hyperbolic graphs with a horizon type boundary $\Sigma$, provided that a dominant energy condition $\tilde L_k\ge0$ holds. Both inequalities are optimal., Comment: 41 pages

We investigate the greedy version of the $L^p$-optimal vector quantization problem for an $\mathbb{R}^d$-valued random vector $X\!\in L^p$. We show the existence of a sequence $(a_N)_{N\ge 1}$ such that $a_N$ minimizes $a\mapsto\big \|\min_{1\le i\le N-1}|X-a_i|\wedge |X-a|\big\|_{L^p}$ ($L^p$-mean quantization error at level $N$ induced by $(a_1,\ldots,a_{N-1},a)$). We show that this sequence produces $L^p$-rate optimal $N$-tuples $a^{(N)}=(a_1,\ldots,a_{_N})$ ($i.e.$ the $L^p$-mean quantization error at level $N$ induced by $a^{(N)}$ goes to $0$ at rate $N^{-\frac 1d}$). Greedy optimal sequences also satisfy, under natural additional assumptions, the distortion mismatch property: the $N$-tuples $a^{(N)}$ remain rate optimal with respect to the $L^q$-norms, $p\le q, Comment: 31 pages, 4 figures, few typos corrected (now an extended version of an eponym paper to appear in Journal of Approximation)

International audience; We establish an expression of the \EC~of a $r$-regular planar set in function of some variographic quantities. The usual $\mathcal{C} ^{2}$ framework is relaxed to a $\mathcal{C} ^{1,1}$ regularity assumption, generalising existing local formulas for the \EC. We give also general bounds on the number of connected components of a measurable set of $\mathbb{R}^{2}$ in terms of local quantities. These results are then combined to yield a new expression of the mean \EC~of a random regular set, depending solely on the third order marginals for arbitrarily close arguments. We derive results for level sets of some moving average processes and for the boolean model with non-connected polyrectangular grains in $\mathbb{R}^{2}$. Applications to excursions of smooth bivariate random fields are derived in the companion paper \cite{LacEC2}, and applied for instance to $\C^{1,1}$ Gaussian fields, generalising standard results.

Let $p$ be a prime. In this paper we give a proof of the following result: A valued field $(K,v)$ of characteristic $p > 0$ is $p$-henselian if and only if every element of strictly positive valuation is of the form $x^p - x$ for some $x \in K$.

International audience; In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five is in convex position. (If each pair of bodies have at most two common tangents it is enough to assume that every triple is in convex position, and likewise, if each pair of bodies have at most four common tangents it is enough to assume that every quadruple is in convex position.) This confirms a conjecture of Pach and Toth, and generalizes a theorem of Bisztriczky and Fejes Toth. Our results on families of convex bodies are consequences of more general Ramsey-type results about the crossing patterns of systems of graphs of continuous functions $f:[0,1] \to \mathbb{R}$. On our way towards proving the Pach-Toth conjecture we obtain a combinatorial characterization of such systems of graphs in which all subsystems of equal size induce equivalent crossing patterns. These highly organized structures are what we call regular systems of paths and they are natural generalizations of the notions of cups and caps from the famous theorem of Erdos and Szekeres. The characterization of regular systems is combinatorial and introduces some auxiliary structures which may be of independent interest.