Related papers: On $q$-Counting of Noncrossing Chains and Parking …

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 establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…

We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…

In 1980, Edelman defined a poset on objects called the noncrossing 2-partitions. They are closely related with noncrossing partitions and parking functions. To some extent, his definition is a precursor of the parking space theory, in the…

We revisit $R$-polynomials with introducing the new idea ``shifted $R$-polynomials" (or Bruhat weight) for all Bruhat intervals in finite Coxeter groups. Then, we apply these polynomials to weighted counting of Bruhat paths. Further, we…

For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, there exists a vertex j in U for which there are more than b_j…

We give a sufficient combinatorial condition for the non-negativity of the coefficients of polynomial quotients of products of $q$-integers, also known as cyclotomic generating functions (CGFs). This slightly extends work by Iano-Fletcher,…

We study inhomogeneous $q$-Whittaker polynomials which extend both $q$-Whittaker and stable Grothendieck polynomials. We prove that inhomogeneous $q$-Whittaker polynomials (in countably many variables) form a basis of certain commutative…

A parking function is a function $\pi:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking…

In the combinatorics of finite finite Coxeter groups, there is a simple formula giving the number of maximal chains of noncrossing partitions. It is a reinterpretation of a result by Deligne which is due to Chapoton, and the goal of this…

A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

Parking functions are a widely studied class of combinatorial objects, with connections to several branches of mathematics. On the algebraic side, parking functions can be identified with the standard monomials of $M_n$, a certain monomial…

In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we…

This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…

We enumerate traceless square matrices over finite quotients of compact discrete valuation rings by their image sizes. We express the associated rational generating functions in terms of statistics on symmetric and hyperoctahedral groups,…

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…

We introduce a natural weighted enumeration of lattice points in a polytope, and give a Brion-type formula for the corresponding generating function. The weighting has combinatorial significance, and its generating function may be viewed as…

The aim of this paper is to develop a $(q,m)$-polymatroidal approach to higher supports and higher rank-weight enumerators of rank-metric codes. In this framework, we establish analogs of several fundamental results known for matroids and…