Related papers: Lattice Path Enumeration
Skew Dyck paths without up-down-left are enumerated. In a second step, the number of contiguous subwords 'up-down-left' are counted. This explains and extends results that were posted in the Encyclopedia of Integer Sequences.
We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…
This is a survey on coarse geometry with an emphasis on coarse homology theories.
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
We show that the set of all measures on any measurable space is a complete lattice, i.e. every collection of measures has both a greatest lower bound and a least upper bound.
We consider the coincidence problem for the square lattice that is translated by an arbitrary vector. General results are obtained about the set of coincidence isometries and the coincidence site lattices of a shifted square lattice by…
This paper surveys hyperinterpolation, a quadrature-based approximation scheme. We cover classical results, provide examples on several domains, review recent progress on relaxed quadrature exactness, introduce methodological variants, and…
We call a real multi-dimensional array a {\em tensor} for short. In enumerating vertices of the polytopes of stochastic tensors, different approaches have been used: {(1)} Combinatorial method via Latin squares; {(2)} Analytic (topological)…
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…
A method of embedding partially ordered sets into linear spaces is presented. The problem of finding all orthocomplementations in a finite lattice is reduced to a linear programming problem.
We discuss a class of problems which we call lattice exit models. At one level, these problems provide undergraduate level exercises in labeling the vertices of graphs (e.g., depth first search). At another level (theorems about large scale…
A reinterpretation of noncommutativity as a mapping of paths is proposed at the level of quantum mechanics.
The survey presents the well-known Warshall's algorithm, a generalization and some interesting applications of this.
A review of investigations of running couplings using lattice techniques is given. This includes i) studies of the running of particular non-perturbatively defined renormalized couplings in pure gauge theories over a range of energies, and…
\L{}ukasiewicz paths are lattice paths in $\Bbb{N}^2$ starting at the origin, ending on the $x$-axis, and consisting of steps in the set $\{(1,k), k\geq -1\}$. We give generating function and exact value for the number of $n$-length…
A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first…
In this paper, we give a class of reconstructible graphs.
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
This is a survey work on Lie algebras with ad-invariant metrics. We summarize main features, notions and constructions, in the aim of bringing into consideration the main research on the topic. We also give some list of examples in low…