Related papers: A continuous analogue of lattice path enumeration
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
A systematic analysis of a continuous version of a binomial lattice, containing a real parameter $\gamma$ and covering the Toda field equation as $\gamma\to\infty$, is carried out in the framework of group theory. The symmetry algebra of…
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…
The paper reviews various arithmetic analogues of Hamiltonian systems and presents some new facts suggesting ways to relate/unify these examples.
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…
We propose a regular way to construct lattice versions of $W$-algebras, both for quantum and classical cases. In the classical case we write the algebra explicitly and derive the lattice analogue of Boussinesq equation from the Hamiltonian…
We exhibit a bijection between central Delannoy $n$-paths, that is, lattice paths from the origin to $(n,n)$ with steps $E=(1,0), \,N=(0,1),\,D=(1,1)$ and the lattice paths from the origin to $(n+1,n)$ where the only restriction on the…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
When a problem has more than one solution, it is often important, depending on the underlying context, to enumerate (i.e., to list) them all. Even when the enumeration can be done in polynomial delay, that is, spending no more than…
In this paper, we study symmetric lattice paths. Let $d_{n}$, $m_{n}$, and $s_{n}$ denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schr\"oder paths of length $2n$, respectively. By using Riordan group…
We present an algorithm for enumerating exactly the number of Hamiltonian chains on regular lattices in low dimensions. By definition, these are sets of k disjoint paths whose union visits each lattice vertex exactly once. The well-known…
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…
These notes follow my articles [1, 6], and give some new important details. We propose here a new combinatorial method of encoding of measure spaces with measure preserving transformations, (or groups of transformations) in order to give…
We consider a long but finite (ladder) circuit with alternating connections of resistors in series and parallel and derive an explicit expression for its equivalent resistance as a function of the number of repeating blocks, $R_{\rm…
We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…
Bandlimited approaches to quantum field theory offer the tantalizing possibility of working with fields that are simultaneously both continuous and discrete via the Shannon Sampling Theorem from signal processing. Conflicting assumptions in…
To solve a linear program, the simplex method follows a path in the graph of a polytope, on which a linear function increases. The length of this path is an key measure of the complexity of the simplex method. Numerous previous articles…