English
Related papers

Related papers: Lattice and Schroder paths with periodic boundarie…

200 papers

We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.…

Combinatorics · Mathematics 2021-01-26 Sylvie Corteel , Matthieu Josuat-Verges , Thomas Prellberg , Martin Rubey

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

Combinatorics · Mathematics 2025-10-22 Sofia Brenner , Jean Cardinal , Thomas McConville , Arturo Merino , Torsten Mütze

To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function \Phi_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described…

Group Theory · Mathematics 2014-04-01 Richard Pink

A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path is a point on the path with coordinate y=k…

Combinatorics · Mathematics 2007-05-23 T. Mansour

There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the search to understand how to extend these natural correspondences,…

Information Theory · Computer Science 2008-02-21 Marni Mishna , Mike Zabrocki

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

Representation Theory · Mathematics 2025-07-14 Viktor Chust , Flávio U. Coelho

For an arbitrary group, the subgroups form a lattice with order determined by set inclusion. Not every lattice is isomorphic to the subgroup lattice for a group. However, Birkhoff and Frink proved that any compactly generated lattice is…

Rings and Algebras · Mathematics 2018-12-04 Martha L. H. Kilpack , Ryan Kurth-Oliveira , Madeline E. May

We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…

Combinatorics · Mathematics 2025-04-11 Olivier Bernardi , Mireille Bousquet-Mélou

Linear upper bounds may be derived by imposing specific structural conditions on a generating set, such as additional constraints on ranks, eigenvalues, or the degree of the minimal polynomial of the generating matrices. This paper…

Rings and Algebras · Mathematics 2025-05-06 Chengjie Wang

We study planar walks that start from a given point (i\_0, j\_0), take their steps in a finite set S, and are confined in the first quadrant of the plane. Their enumeration can be attacked in a systematic way: the generating function Q(x,…

Combinatorics · Mathematics 2017-08-22 Mireille Bousquet-Melou

A bargraph is a self-avoiding lattice path with steps $U=(0,1)$, $H=(1,0)$ and $D=(0,-1)$ that starts at the origin and ends on the $x$-axis, and stays strictly above the $x$-axis everywhere except at the endpoints. Bargraphs have been…

Combinatorics · Mathematics 2016-09-02 Emeric Deutsch , Sergi Elizalde

We introduce the generic Lah polynomials $L_{n,k}(\phi)$, which enumerate unordered forests of increasing ordered trees with a weight $\phi_i$ for each vertex with $i$ children. We show that, if the weight sequence $\phi$ is…

Combinatorics · Mathematics 2020-09-17 Mathias Pétréolle , Alan D. Sokal

In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

There is a strikingly simple classical formula for the number of lattice paths avoiding the line x = ky when k is a positive integer. We show that the natural generalization of this simple formula continues to hold when the line x = ky is…

Combinatorics · Mathematics 2008-05-07 Robin J. Chapman , Timothy Y. Chow , Amit Khetan , David Petrie Moulton , Robert J. Waters

The interest of quadratic algebras for position-dependent mass Schr\"odinger equations is highlighted by constructing spectrum generating algebras for a class of d-dimensional radial harmonic oscillators with $d \ge 2$ and a specific mass…

Mathematical Physics · Physics 2009-11-13 C. Quesne

Equations of the Loewner class subject to non-constant boundary conditions along the real axis, are formulated and solved giving the geodesic paths of slits growing in the upper half complex plane. The problem is motivated by Laplacian…

Pattern Formation and Solitons · Physics 2020-10-09 Robb McDonald

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe

We consider regular tessellations of the plane as infinite graphs in which $q$ edges and $q$ faces meet at each vertex, and in which $p$ edges and $p$ vertices surround each face. For $1/p + 1/q = 1/2$, these are tilings of the Euclidean…

Combinatorics · Mathematics 2010-06-23 Alice Paul , Nicholas Pippenger

In this paper, we construct a generating function quadratic at infinity for any exact Lagrangian in $\mathbb R^{2n}$ that equals $\mathbb R^n$ outside a compact set. Such a Lagrangian may be viewed as a Lagrangian filling of the standard…

Symplectic Geometry · Mathematics 2026-04-29 Thomas Kragh

We give a formula that expresses the Hilbert series of one-sided ladder determinantal rings, up to a trivial factor, in form of a determinant. This allows the convenient computation of these Hilbert series. The formula follows from a…

Commutative Algebra · Mathematics 2007-05-23 Christian Krattenthaler , Martin Rubey
‹ Prev 1 4 5 6 7 8 10 Next ›