Related papers: Parking functions and triangulation of the associa…
We present two constructions in this paper: (a) A 10-vertex triangulation $\CC P^{2}_{10}$ of the complex projective plane $\CC P^{2}$ as a subcomplex of the join of the standard sphere ($S^{2}_4$) and the standard real projective plane…
We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper…
We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is…
We give a new simple description of the canonical bijection between the set of triangulations of n-gon and some set of Young diagrams. Using this description, we find flip transformations on this set of Young diagrams which correspond to…
It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its…
In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…
We introduce analogues of the Hopf algebra of Free quasi-symmetric functions with bases labelled by colored permutations. As applications, we recover in a simple way the descent algebras associated with wreath products $\Gamma\wr\SG_n$ and…
Consider a collection of particles interacting through an attractive-repulsive potential given as a difference of power laws and normalized so that its unique minimum occurs at unit separation. For a range of exponents corresponding to mild…
Let $1\leq r\leq n$ and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labelled tree on $n+1$ vertices, exactly $r$ vertices are visited before backtracking. Let $R$ be the set of trees with this property.…
We introduce type C parking functions, encoded as vertically labelled lattice paths and endowed with a statistic dinv'. We define a bijection from type C parking functions to regions of the Shi arrangement of type C, encoded as diagonally…
We study the simplicial volume of manifolds obtained from Davis' reflection group trick, the goal being characterizing those having positive simplicial volume. In particular, we focus on checking whether manifolds in this class with nonzero…
We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.
There are several combinatorial objects that are known to be in bijection to the spanning trees of a graph G. These objects include G-parking functions, critical configurations of G, and descending traversals of G. In this paper, we extend…
Principal circle bundle over a PL polyhedron can be triangulated and thus obtains combinatorics. The triangulation is assembled from triangulated circle bundles over simplices. To every triangulated circle bundle over a simplex we associate…
We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.
In a parking function, a lucky car is a car that parks in its preferred parking spot and the parking outcome is the permutation encoding the order in which the cars park on the street. We give a characterization for the set of parking…
We study three natural types of restrictions on Fubini rankings and unit interval parking functions, which are motivated by their correspondence with ordered set partitions. For each restriction type, we define the corresponding subset of…
Classical parking functions are defined as the parking preferences for $n$ cars driving (from west to east) down a one-way street containing parking spaces labeled from $1$ to $n$ (from west to east). Cars drive down the street toward their…
We study two different objects attached to an arbitrary quadrangulation of a regular polygon. The first one is a poset, closely related to the Stokes polytopes introduced by Baryshnikov. The second one is a set of some paths configurations…
We connect k-triangulations of a convex n-gon to the theory of Schubert polynomials. We use this connection to prove that the simplicial complex with k-triangulations as facets is a vertex-decomposable triangulated sphere, and we give a new…