Related papers: Rectangular Schroder Parking Functions Combinatori…

We derive some combinatorial formulas related to the diagonal Ramsey numbers $R(k)$. Each formula is a statement of the form "$F(n,k) = 0$ if and only if $n \ge R(k)$," where $F(n,k)$ is a combinatorial expression which depends on $n$ and…

We prove a combinatorial reciprocity theorem for the enumeration of non-intersecting paths in a linearly growing sequence of acyclic planar networks. We explain two applications of this theorem: reciprocity for fans of bounded Dyck paths,…

We introduce meromorphic nearby cycle functors and study their functorial properties. Moreover we apply them to monodromies of meromorphic functions in various situations. Combinatorial descriptions of their reduced Hodge spectra and Jordan…

Let R be a commutative ring and let n,m be two positive integers. The symmetric group on n letters acts diagonally on the ring of polynomials in nxm variables with coefficients in R. The subrings of invariants for this action is called the…

We provide formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…

This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…

We extend the notion of parking function polytopes and study their geometric and combinatorial structure, including normal fans, face posets, and $h$-polynomials, as well as their connections to other classes of polytopes. To capture their…

This paper provides an exploration of parking functions, a classical combinatorial object. We present two viewpoints on their structure and properties: through poset of noncrossing partitions and polytopes.

This note deals with two topics of linear algebra. We give a simple and short proof of the multiplicative property of the determinant and provide a constructive formula for rotations. The derivation of the rotation matrix relies on simple…

This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…

We prove three variations of recent results due to Andrews on congruences for $NT(m,k,n)$, the total number of parts in the partitions of $n$ with rank congruent to $m$ modulo $k$. We also conjecture new congruences and relations for…

We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operad obtained from the additive monoid. These involve various familiar…

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration…

We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…

We study the statistics of semi-meanders, i.e. configurations of a set of roads crossing a river through n bridges, and possibly winding around its source, as a toy model for compact folding of polymers. By analyzing the results of a direct…

Parking sequences (a generalization of parking functions) are defined by specifying car lengths and requiring that a car attempts to park in the first available spot after its preference. If it does not fit there, then a collision occurs…

We study the relationship between rational slope Dyck paths and invariant subsets of $\mathbb Z,$ extending the work of the first two authors in the relatively prime case. We also find a bijection between $(dn,dm)$--Dyck paths and…

In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…

We propose a characterization of $k$-Naples parking functions in terms of subsequences with the structure of a complete $k$-Naples parking function. We define complete parking preferences by requiring that for all $j=2,\dots,n$, the number…

We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at…