Related papers: A continuous analogue of lattice path enumeration
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other families of lattice paths. In this article, we fathom such a…
We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.
We relate the combinatorics of periodic generalized Dyck and Motzkin paths to the cluster coefficients of particles obeying generalized exclusion statistics, and obtain explicit expressions for the counting of paths with a fixed number of…
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
We give a summary of recent progress on the signed area enumeration of closed walks on planar lattices. Several connections are made with quantum mechanics and statistical mechanics. Explicit combinatorial formulae are proposed which rely…
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
A variation of Dyck paths allows for down-steps of arbitrary length, not just one. Credits for this invention are given to Emeric Deutsch. Surprisingly, the enumeration of them is somewhat akin to the analysis of Motzkin-paths; the last…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
We develope a difference calculus analogous to the differential geometry by translating the forms and exterior derivatives to similar expressions with difference operators, and apply the results to fields theory on the lattice [Ref. 1]. Our…
In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. This algorithm can be considered as an improvement of [13]. Then based on this sequential algorithm, we present a constant-time parallel…
We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence,…
In this note we observe that a bijection related to Littelmann's root operators (for type $A_1$) transparently explains the well known enumeration by length of walks on $\N$ (left factors of Dyck paths), as well as some other enumerative…