Some Dirichlet-like functions, attached to a pair (periodic function, polynomial) are introduced and studied. These functions generalize the standard Dirichlet L-functions of Dirichlet characters. They have similar properties, being holomorphic on thefull complex plane and having simple values on negative integers.

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of these polytopes and posets, using the tree structure. For linear arbors, we propose a conjecture exchanging the Ehrhart polynomial of the polytope with the Zeta polynomial of the poset for the reverse arbor. The general motivation comes from the action of a transmutation operator acting on M -triangles, which should link the posets considered here with some kinds of generalized noncrossing partitions and generalized associahedra. We give some evidence for this relationship in several cases, including notably some polytopes, namely halohedra and Hochschild polytopes.

This article deals with a relationship between derived categories of modules over some partially ordered sets and triangulated categories arising from quasi-homogeneous isolated singularities. It produces heuristics for the existence of derived equivalences between posets, using the geometric category as an auxiliary intermediate. The notion of Weight plays a central role as a simple footprint of the derived categories under consideration.

We introduce the shuffle of deformed permutahedra (a.k.a. generalized permutahedra), a simple associative operation obtained as the Cartesian product followed by the Minkowski sum with the graphical zonotope of a complete bipartite graph. Besides preserving the class of graphical zonotopes (the shuffle of two graphical zonotopes is the graphical zonotope of the join of the graphs), this operation is particularly relevant when applied to the classical permutahedra and associahedra. First, the shuffle of an m-permutahedron with an n-associahedron gives the (m,n)-multiplihedron, whose face structure is encoded by m-painted n-trees, generalizing the classical multiplihedron. We show in particular that the graph of the (m,n)-multiplihedron is the Hasse diagram of a lattice generalizing the weak order on permutations and the Tamari lattice on binary trees. Second, the shuffle of an m-associahedron with an n-associahedron gives the (m,n)-constrainahedron, whose face structure is encoded by (m,n)-cotrees, and reflects collisions of particles constrained on a grid. Third, the shuffle of an m-anti-associahedron with an n-associahedron gives the (m,n)-biassociahedron, whose face structure is encoded by (m,n)-bitrees, with relevant connections to bialgebras up to homotopy. We provide explicit vertex, facet, and Minkowski sum descriptions of these polytopes, as well as summation formulas for their f-polynomials based on generating functionology of decorated trees.

We consider a greedy version of the $m$-Tamari order defined on $m$-Dyck paths, recently introduced by Dermenjian. Inspired by intriguing connections between intervals in the ordinary 1-Tamari order and planar triangulations, and more generally by the existence of simple formulas counting intervals in the ordinary $m$-Tamari orders, we investigate the number of intervals in the greedy order on $m$-Dyck paths of fixed size. We find again a simple formula, which also counts certain planar maps (of prescribed size) called $(m+1)$-constellations. For instance, when $m=1$ the number of intervals in the greedy order on 1-Dyck paths of length $2n$ is proved to be $\frac{3\cdot 2^{n-1}}{(n+1)(n+2)} \binom{2n}{n}$, which is also the number of bipartite maps with $n$ edges. Our approach is recursive, and uses a ``catalytic'' parameter, namely the length of the final descent of the upper path of the interval. The resulting bivariate generating function is algebraic for all $m$. We show that the same approach can be used to count intervals in the ordinary $m$-Tamari lattices as well. We thus recover the earlier result of the first author, Fusy and Pr\'eville-Ratelle, who were using a different catalytic parameter.

Using an experimental mathematics approach, new relations are obtained between Dirichlet-like series for certain periodic coefficients and the moments of certain families of orthogonal polynomials.In addition to the classical hypergeometric orthogonal polynomials, of Racah type and continuous dual Hahn type, a new similar family of orthogonal polynomials intervenes.

We introduce a q-analogue of the classical Zeta polynomial of finite partially ordered sets, as a polynomial in one variable x with coefficients depending on the indeterminate q. We prove some properties of this polynomial invariant, including its behaviour with respect to duality, product and disjoint union. The leading term is a q-analogue of the number of maximal chains, but not always with non-negative coefficients. The value at q=0 turns out to be essentially the characteristic polynomial.

We explore some connections between moments of rescaled little q-Jacobi polynomials, q-analogues of values at negative integers for some Dirichlet series, and the q-Eulerian polynomials of wreath products of symmetric groups.

This article introduces an algebra of functions in one variable $c$ defined by iterated integrals of two specific differential forms depending on $c$, where the product is the shuffle product. This algebra can be seen as a common deformation of multiple zeta values and of Kaneko-Tsumura's recent multiple $T$-values. The first few graded dimensions, assuming that a grading by the weight does hold, are computed.

We build, using the notion of zinbiel algebra, some commutative subalgebras $C_{u,v}$ inside an algebra of formal iterated integrals. There is a quotient map from this algebra of formal iterated integrals to the algebra of motivic multiple zeta values. Restricting this quotient map to the subalgebras $C_{u,v}$ of A$_{1,0}$ gives a morphism of graded commutative algebras with the same graded dimension. This is conjectured to be generically an isomorphism. When u+v = 0, the image is instead a sub-algebra of the algebra of motivic multiple zeta values.

The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all its roots on the unit circle. We also obtain the same property for another sequence of polynomials introduced by Kreweras and related to Genocchi numbers. This is obtained through a general statement about some linear operators acting on palindromic polynomials.

This article introduces Gamma-triangles, which are closely related to and more fundamental than F-triangles and H-triangles that have been used in the combinatorics of cluster complexes. It is proved that Gamma-triangles can be expressed as sums of the local gamma-vectors introduced by Athanasiadis, which themselves refine the local h-vectors attached by Stanley to simplicial subdivisions. Gamma triangles of all cluster complexes are then explicitly computed.

There is a rich algebraic setting involving free pre-Lie algebras and the combinatorics of rooted trees. In this context, one can consider the analog of formal power series, called tree-indexed series. Several interesting such series are known, including one called and its more recent one-parameter and two-parameters generalizations. This survey article explains how one can compute their coefficients using Ehrhart polynomials of lattice polytopes.

This is volume 1 of a 2-volume work comprising a total of 14 refereed research articles which stem from the CARMA Conference (Algebraic Combinatorics, Resurgence, Moulds and Applications), held at the Centre International de Rencontres Mathématiques in Luminy, France, from June 26 to 30, 2017.

We introduce and study a new partial order on Dyck paths. We prove that these posets are meet-semilattices. We show that their numbers of intervals are the same as the number of bicubic planar maps. We describe an unexpected connection with the Hochschild polytopes of Saneblidze.

The classical sequence of Bernoulli numbers is known to the the sequence of moments of a family of orthogonal polynomials. Some similar statements are obtained for another sequence of rational numbers, which is similar in many ways to the Bernoulli numbers.

In this note, we investigate the representation type of the cambrian lattices and some other related lattices. The result is expressed as a very simple trichotomy. When the rank of the underlined Coxeter group is at most 2, the lattices are of finite representation type. When the Coxeter group is a reducible group of type A 3 1 , the lattices are of tame representation type. In all the other cases they are of wild representation type.

This article introduces Gamma-triangles, which are closely related to and more fundamental than F-triangles and H-triangles that have been used in the combinatorics of cluster complexes. It is proved that Gamma-triangles can be expressed as sums of the local gamma-vectors introduced by Athanasiadis, which themselves refine the local h-vectors attached by Stanley to simplicial subdivisions. Gamma triangles of all cluster complexes are then explicitly computed.

To every partial order P, one associates a polynomial $\mathbb{D}_P$ in 4 variables that enumerates the intervals of P according to 4 parameters. Some symmetry properties of this polynomial are obtained for a specific family of posets, the Tamari lattices. A ternary symmetry is proved for the polynomial in 3 variables obtained by setting one variable to 1. Another global symmetry is conjectured. The set of synchronized intervals is described using a facet of the Newton polytope. A relation to the statistics of the canopy of binary planar trees is described.