Related papers: Enumeration of \L{}ukasiewicz paths modulo some pa…
We study minimum degree conditions under which a graph $G$ contains $k$th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of $G$ is large. This extends a result of Allen,…
In this paper, we obtain upper estimates for the distortion of the modulus of families of paths under mappings of the Sobolev class, whose dilatation is locally integrable. As a consequence, theorems on the local and boundary behavior of…
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.
We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.
We investigate the asymptotic number of equivalence classes of linear codes with prescribed length and dimension. While the total number of inequivalent codes of a given length has been studied previously, the case where the dimension…
Lattice paths effectively model phenomena in chemistry, physics and probability theory. Asymptotic enumeration of lattice paths is linked with entropy in the physical systems being modeled. Lattice paths restricted to different regions of…
We investigate, theoretically and experimentally,the properties of diffraction spectra of Fibonacci lattices with arbitrary spacings. We show that, by means of a suitable composition rule, a Fibonacci sequence can be mapped into another one…
This paper enumerates all juxtaposition classes of the form "Av($abc$) next to Av($xy$)", where $abc$ is a permutation of length three and $xy$ is a permutation of length two. We use Dyck paths decorated by sequences of points to represent…
Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…
We study the center of several types of path algebras. We start with the path algebra $KE$ and prove that if the number of vertices is infinite then the center is zero. Otherwise, it coincides with the field $K$ except when the graph $E$ is…
Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose…
We prove Koszulity of certain linear path categories obtained from connected graphs with some infinite directed walk. These categories can be viewed as locally quadratic dual to preprojective algebras.
We enumerate certain geometric equivalence classes of subgraphs induced by Hamiltonian paths and cycles in complete graphs. Said classes are orbits under the action of certain direct products of dihedral and cyclic groups on sets of strings…
We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for the generating functions for the number of permutations of…
Classical isomorphism theorems due to Dynkin, Eisenbaum, Le Jan, and Sznitman establish equalities between the correlation functions or distributions of occupation times of random paths or ensembles of paths and Markovian fields, such as…
Kronecker sequences $(k \alpha \mod 1)_{k=1}^{\infty}$ for some irrational $\alpha > 0$ have played an important role in many areas of mathematics. It is possible to associate to each finite segment $(k \alpha \mod 1)_{k=1}^{n}$ a…
We present a substantial generalization of the equinumeracy of grand Dyck paths and Dyck-path prefixes, constrained within a band. The number of constrained paths starting at level $i$ and ending in a window of size $2j+2$ is equal to the…
Two $a{-}b$ paths in a graph $G$ are order-compatible if their common vertices occur in the same order when travelling from $a$ to $b$. Suppose a graph contains an infinite number $\delta$ of edge-disjoint $a{-}b$ paths. G.A. Dirac asked…
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. L. Shapiro [9] found the Chung-Feller properties for the Motzkin paths.…
We call progressive paths and rushed paths two families of Dyck paths studied by Asinowski and Jelinek, which have the same enumerating sequence (OEIS entry A287709). We present a bijection proving this fact. Rushed paths turn out to be in…