English
Related papers

Related papers: Cluster parking functions

200 papers

In a parking function, a car is considered lucky if it is able to park in its preferred spot. Extending work of Harris and Martinez, we enumerate outcomes of parking functions with a fixed set of lucky cars. We then consider a…

Combinatorics · Mathematics 2025-09-11 Melanie Ferreri , Pamela E. Harris , Lucy Martinez , Eric Swartz

Suppose that $n$ drivers each choose a preferred parking space in a linear car park with $m$ spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with larger number (if…

Combinatorics · Mathematics 2008-07-08 Peter J. Cameron , Daniel Johannsen , Thomas Prellberg , Pascal Schweitzer

Given a symmetrizable generalized Cartan matrix $A$, for any index $k$, one can define an automorphism associated with $A,$ of the field $\mathbf{Q}(u_1, >..., u_n)$ of rational functions of $n$ independent indeterminates $u_1,..., u_n.$ It…

Representation Theory · Mathematics 2015-06-26 Bin Zhu

We enumerate factorizations of a Coxeter element in a well generated complex reflection group into arbitrary factors, keeping track of the fixed space dimension of each factor. In the infinite families of generalized permutations, our…

Combinatorics · Mathematics 2024-02-07 Joel Brewster Lewis , Alejandro H. Morales

Centers of categories capture the natural operations on their objects. Homotopy coherent centers are introduced here as an extension of this notion to categories with an associated homotopy theory. These centers can also be interpreted as…

Algebraic Topology · Mathematics 2019-04-12 Markus Szymik

We give a uniform geometric realization for the cluster algebra of an arbitrary finite type with principal coefficients at an arbitrary acyclic seed. This algebra is realized as the coordinate ring of a certain reduced double Bruhat cell in…

Rings and Algebras · Mathematics 2008-05-19 Shih-Wei Yang , Andrei Zelevinsky

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…

Combinatorics · Mathematics 2023-01-27 Spencer J. Franks , Pamela E. Harris , Kimberly Harry , Jan Kretschmann , Megan Vance

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$.…

Combinatorics · Mathematics 2019-09-24 Sam Spiro

Let $W$ be an irreducible real reflection group. Armstrong, Reiner, and the author presented a model for parking functions attached to W and made three increasingly strong conjectures about these objects. The author generalized these…

Combinatorics · Mathematics 2015-05-18 Brendon Rhoades

We show that a minimal triangulation of the associahedron (Stasheff polytope) of dimension n is made of (n+1)^{n-1} simplices. We construct a natural bijection with the set of parking functions from a new interpretation of parking functions…

Algebraic Topology · Mathematics 2007-05-23 Jean-Louis Loday

The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize…

Combinatorics · Mathematics 2014-03-10 Drew Armstrong , Nicholas A. Loehr , Gregory S. Warrington

If the moments of a probability measure on $\R$ are interpreted as a specialization of complete homogeneous symmetric functions, its free cumulants are, up to sign, the corresponding specializations of a sequence of Schur positive symmetric…

Combinatorics · Mathematics 2007-05-23 Jean-Christophe Novelli , Jean-Yves Thibon

A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…

Combinatorics · Mathematics 2023-06-13 Jennifer Elder , Pamela E. Harris , Zoe Markman , Izah Tahir , Amanda Verga

For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are…

Combinatorics · Mathematics 2008-12-04 Drew Armstrong , Sen-Peng Eu

Consider $n$ cars $C_1, C_2, \ldots, C_n$ that want to park in a parking lot with parking spaces $1,2,\ldots,n$ that appear in order. Each car $C_i$ has a parking preference $\alpha_i \in \{1,2,\ldots,n\}$. The cars appear in order, if…

Combinatorics · Mathematics 2021-11-29 Melanie Tian , Enrique Treviño

It is proved that the generalized cluster complex defined by Fomin and Reading has a dihedral symmetry. Together with diagram symmetries, they generate its automorphism group. A consequence is a simple explicit formula for the order of this…

Combinatorics · Mathematics 2025-04-09 Matthieu Josuat-Vergès

We construct Morse homology groups associated with any regular function on a smooth complex algebraic variety, allowing singular and non-compact critical loci. These groups are generated by critical points of a certain large pertubation of…

Geometric Topology · Mathematics 2025-09-26 Aleksander Doan , Juan Muñoz-Echániz

Parking functions, classically defined in terms of cars with preferred parking spots on a directed path attempting to park there, arise in many combinatorial situations and have seen various generalizations. In particular, parking functions…

Combinatorics · Mathematics 2020-02-13 Roger Tian

This introduction to Green's functions is based on their role as kernels of differential equations. The procedures to construct solutions to a differential equation with an external source or with an inhomogeneity term are put together to…

Mesoscale and Nanoscale Physics · Physics 2008-02-22 Ursula Schröter

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

Combinatorics · Mathematics 2025-05-20 Joel Brewster Lewis , Jiayuan Wang