Related papers: Enumeration of \L{}ukasiewicz paths modulo some pa…
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…
Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…
Osculating paths are sets of directed lattice paths which are not allowed to cross each other or have common edges, but are allowed to have common vertices. In this work we derive a constant term formula for the number of such lattice paths…
Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…
We consider a sorting machine consisting of two stacks in series where the first stack has the added restriction that entries in the stack must be in decreasing order from top to bottom. The class of permutations sortable by this machine…
$Q$ is a quiver of type $\tilde A(n-1,1)$ if its graph is of affine type $\tilde A_{n-1}$ and if its arrows have a certain orientation. We develop a bijection between the set of indecomposable $kQ$-modules whose dimension vectors are…
The symmetries of paths in a manifold $M$ are classified with respect to a given pointwise proper action of a Lie group $G$ on $M$. Here, paths are embeddings of a compact interval into $M$. There are at least two types of symmetries:…
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…
The paper is devoted to the study of lattice paths that consist of vertical steps $(0,-1)$ and non-vertical steps $(1,k)$ for some $k\in \mathbb Z$. Two special families of primary and free lattice paths with vertical steps are considered.…
In this paper we completely describe graphically Leavitt path algebras with bounded index of nilpotence and show that each graded simple module $S$ over a Leavitt path algebra with bounded index of nilpotence is graded $\Sigma$-injective,…
We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…
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…
We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence $(1, 4, 4^2, 4^3, ...)$ which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial…
We establish a large class of homotopy coherent Morita-equivalences of Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical Dold-Kan…
Let $(f_n)_{n=1}^{\infty}$ be a sequence of polynomials and $\alpha>1$. In this paper we study the distribution of the sequence $(f_n(\alpha))_{n=1}^{\infty}$ modulo one. We give sufficient conditions for a sequence $(f_n)_{n=1}^{\infty}$…
We establish the hierarchy among twelve equivalence relations (similarities) on the class of relational structures: the equality, the isomorphism, the equimorphism, the full relation, four similarities of structures induced by similarities…
The Hochschild and (cotriple) cyclic homologies of crossed modules of (not-necessarily-unital) associative algebras are investigated. Wodzicki's excision theorem is extended for inclusion crossed modules in the category of crossed modules…
It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…
We present refined enumeration formulas for lattice paths in $\mathbb{Z}^2$ with two kinds of steps, by keeping track of the number of descents (i.e., turns in a given direction), the major index (i.e., the sum of the positions of the…
We provide a classification of generalized tilting modules and full exceptional sequences for the dual extension algebra of the path algebra of a uniformly oriented linear quiver modulo the ideal generated by paths of length two with its…