Related papers: Parking functions and tree inversions revisited
The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length $n$ with displacement one is in…
A parking function $(c_1,\ldots,c_n)$ can be viewed as having $n$ cars trying to park on a one-way street with $n$ parking spots, where car $i$ tries to park in spot $c_i$, and otherwise he parks in the leftmost available spot after $c_i$.…
Trees fill many extremal roles in graph theory, being minimally connected and serving a critical role in the definition of $n$-good graphs. In this article, we consider the generalization of trees to the setting of $r$-uniform hypergraphs…
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
Euler's Gamma function $\Gamma$ either increases or decreases on intervals between two consequtive critical points. The inverse of $\Gamma$ on intervals of increase is shown to have an extension to a Pick-function and similar results are…
We propose a tree-based algorithm for classification and regression problems in the context of functional data analysis, which allows to leverage representation learning and multiple splitting rules at the node level, reducing…
A result of Foata and Schutzenberger states that two statistics on permutations, the number of inversions and the inverse major index, have the same distribution on a descent class. We give a multivariate generalization of this property:…
We answer an open problem of arXiv:1204.1760 and arXiv:1205.4293, extending their work to irreducible well--generated complex reflection groups $W$. We define a combinatorial $W$-noncrossing parking space and an algebraic $W$-parking space…
For a finite Coxeter group $W$, Josuat-Verg\`es derived a $q$-polynomial counting the maximal chains in the lattice of noncrossing partitions of $W$ by weighting some of the covering relations, which we call bad edges, in these chains with…
We introduce Lehmer parking functions and study their set of parking outcomes. Our main results establish that the number of outcomes of Lehmer parking functions of length $n$ is given by a Bell number, which is exactly the number of set…
The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let $S$ be a nonempty set of vertices of $G$, a collection $\{T_1,T_2,...,T_r\}$ of trees…
Using the celebrated Witten-Kontsevich theorem, we prove a recursive formula of the $n$-point functions for intersection numbers on moduli spaces of curves. It has been used to prove the Faber intersection number conjecture and motivated us…
We introduce two generalizations of bracket vectors from binary trees to permutrees. These new vectors help describe algebraic and geometric properties of the rotation lattice of permutrees defined by Pilaud and Pons. The first…
We show a Dvoretsky-Rogers type Theorem for the adapted version of the $q$-summing operators to the topology of the convergence of the vector valued integrals on Banach function spaces. In the pursuit of this objective we prove that the…
We develop a general embedding method based on the Friedman-Pippenger tree embedding technique (1987) and its algorithmic version, essentially due to Aggarwal et al. (1996), enhanced with a roll-back idea allowing to sequentially retrace…
We introduce a new operation between nonnegative integrable functions on $\mathbb{R} ^n$, that we call geometric combination; it is obtained via a mass transportation approach, playing with inverse distribution functions. The main feature…
Recently, there emerges different versions of beta function and hypergeometric functions containing extra parameters. Gaining enlightenment from these ideas, we will first introduce a new extension of generalized hypergeometric function and…
George Andrews and Ae Ja Yee recently established beautiful results involving bivariate generalizations of the third order mock theta functions $\omega(q)$ and $\nu(q)$, thereby extending their earlier results with the second author.…
We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…