Related papers: Gitterwege reeller Zahlen

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…

A Berge path of length $k$ in an $r$-uniform hypergraph is a collection of $k$ hyperedges $h_1,\dots,h_k$ and $k+1$ vertices $v_1,\dots,v_{k+1}$ such that $v_i, v_{i+1}\in h_i$ for each $1\le i\le k$. Gy\H{o}ri, Katona and Lemons…

In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…

Lattice paths called $\ell$-Schr\"oder paths are introduced. They are paths on the upper half-plane consisting of $\ell+2$ types of steps: $(i,\ell-i)$ for $i=0,\ldots,\ell$, and $(1,-1)$. Those paths generalize Schr\"oder paths and some…

We construct algebraic and algebro-geometric models for the spaces of unparametrized paths. This is done by considering a path as a holonomy functional on indeterminate connections. For a manifold X, we construct a Lie algebroid P which…

We solve two problems regarding the enumeration of lattice paths in $\mathbb{Z}^2$ with steps $(1,1)$ and $(1,-1)$ with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.…

A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…

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…

We consider planar lattice walks that start from (0,0), remain inthe first quadrant i, j >= 0, and are made of three types of steps: North-East, West and South. These walks are known to have remarkable enumerative and probabilistic…

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

Let $(W,S)$ be a Coxeter system. A $W$-graph encodes a representation of the Hecke algebra $\mathcal{H}$ of $W$. We construct universal representations of multi-parameter Hecke algebras on certain quotients of path algebras, and study their…

Given a graph $G(V, E)$ and a positive integer $k$ ($k \geq 1$), a simple path on $k$ vertices is a sequence of $k$ vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an…

Let $P$ be an $x$-monotone orthogonal polygon with $n$ vertices. We call $P$ a simple histogram if its upper boundary is a single edge; and a double histogram if it has a horizontal chord from the left boundary to the right boundary. Two…

Koroljuk gave a summation formula for counting the number of lattice paths from $(0,0)$ to $(m,n)$ with $(1,0), (0,1)$-steps in the plane that stay strictly above the line $y=k(x-d)$, where $k$ and $d$ are positive integers. In this paper…

A gauge invariant Hamiltonian representation for SU(2) in terms of a spin network basis is introduced. The vectors of the spin network basis are independent and the electric part of the Hamiltonian is diagonal in this representation. The…

We use purely combinatorial arguments to give a formula to compute all graded Betti numbers of path ideals of line graphs and cycles. As a consequence we can give new and short proofs for the known formulas of regularity and projective…

A circular Pascal array is a periodization of the familiar Pascal's triangle. Using simple operators defined on periodic sequences, we find a direct relationship between the ranges of the circular Pascal arrays and numbers of certain…

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…

We recast the classical notion of standard tableaux in an alcove-geometric setting and extend these classical ideas to all reduced paths in our geometry. This broader path-perspective is essential for implementing the higher categorical…

We study a type of object, called a pathway (generalizing pathways in the sense of P. E. Cohen [Proc. Amer. Math. Soc. 74, No. 2 (1979), 318--321]), which is useful for several set-theoretic constructions and whose existence, in a sense,…