Related papers: Matrix Ansatz, lattice paths and rook placements
We present combinatorial and analytical results concerning a Sheffer sequence with a generating function of the form $G(x,z)=Q(z)^{x}Q(-z)^{1-x}$, where $Q$ is a quadratic polynomial with real zeros. By using the properties of Riordan…
We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
We present the path integral representation of the generating function for classical exclusive particle systems. By introducing hard-core bosonic creation and annihilation operators and appropriate commutation relations, we construct the…
This paper's aim is to present recent combinatorial considerations on r-Dyck paths, r-Parking functions, and the r-Tamari lattices. Giving a better understanding of the combinatorics of these objects has become important in view of their…
In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially.…
We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…
For hamiltonian lattice gauge theory, we introduce the matrix product anzats inspired from density matrix renormalization group. In this method, wavefunction of the target state is assumed to be a product of finite matrices. As a result,…
This Chapter outlines the replica approach in Random Matrix Theory. Both fermionic and bosonic versions of the replica limit are introduced and its trickery is discussed. A brief overview of early heuristic treatments of zero-dimensional…
A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We analyse some enumerative and asymptotic properties of lattice paths below a line of rational slope. We illustrate our approach with Dyck paths under a line of slope $2/5$. This answers Knuth's problem #4 from his "Flajolet lecture"…
The generalized knots-quivers correspondence extends the original knots-quivers correspondence, by allowing higher level generators of quiver generating series. In this paper we explore the underlined combinatorics of such generating…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
We introduce weighted succession rules and parametric production matrices - simple extensions of the standard ECO method succession rules and production matrices. The purpose is to enumerate combinatorial objects with respect to several…
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…
The number of Borel orbits in polarizations (the symmetric variety $SL(n)/S(GL(p)\times GL(q))$) is analyzed, various (bivariate) generating functions are found. Relations to lattice path combinatorics are explored.
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
In this article we introduce a new matroid invariant, a combinatorial analog of the topological zeta function of a polynomial. More specifically we associate to any ranked, atomic meet-semilattice L a rational function Z(L,s), in such a way…
The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…