Luca Ferrari, Emanuele Munarini
We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schroder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural parameters of lattice paths.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
The Ehrhart polynomial and the reciprocity theorems by Ehrhart \& Macdonald are extended to tensor valuations on lattice polytopes. A complete classification is established of tensor valuations of rank up to eight that are equivariant with respect to the special linear group over the integers and translation covariant. Every such valuation is a linear combination of the Ehrhart tensors which is shown to no longer hold true for rank nine.
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to valuation. The relation shows that the weights count chains in the complementary poset. Conversely, we prove that a valuation defined on a poset of dimension at most two, through the weight function whi…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its join-irreducible elements, and $a$ an element of $M$ which is not join-irreducible, then $\displaystyle \sum_{b \in M \cap [\mathsf{0},a]} μ_M(b,a)b$ belongs to the submodule $\langle a \wedge b + a \vee b - a - b\ |\ a,b \in L \rangle$ of $\mathbb{Z}L$. That property was originally established by Zaslavsky for finite distributive lattice. It is essential to pr…
Unimodular Valuations beyond Ehrhart
本文提出了一种基于扩展无界多面体和基本不变量理论的方法，对整数点多边形的单模估值进行了完整分类。
We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that these produce isomorphic envelopes.
On the Triangle Inequality for the Jaccard Distance in Arbitrary Lattices
本文研究任意格上Jaccard距离的三角不等式，证明了满足特定条件时Jaccard距离满足三角不等式，给出必要条件，并探讨其在多计算领域的应用价值。
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 the plane are well suited to a functional equation approach for exact and asymptotic enumeration. This thesis surveys results on lattice paths under various restrictions, with an emphasis on lattice paths in the quarter plane. For these paths, we develop an original systematic combinatorial approach providing direct access to the exponential growth factors of…
Lattice path matroids and bicircular matroids are two well-known classes of transversal matroids. In the seminal work of Bonin and de Mier about structural properties of lattice path matroids, the authors claimed that lattice path matroids significantly differ from bicircular matroids. Recently, it was proved that all cosimple lattice path matroids have positive double circuits, while it was shown that there is a large class of cosimple bicircular matroids with no positive double circuits. These observations support Bonin and de Miers' claim. Finally, Sivaraman and Slilaty suggested studying t…
Lattice path matroids form a subclass of transversal matroids and were introduced by Bonin, de Mier and Noy. Transversal matroids are not well-quasi-ordered, even when the branch-width is restricted. Though lattice path matroids are not well-quasi-ordered, we prove that lattice path matroids of bounded branch-width are well-quasi-ordered.
A lattice path matroid is a transversal matroid corresponding to a pair of lattice paths on the plane. A matroid base polytope is the polytope whose vertices are the incidence vectors of the bases of the given matroid. In this paper, we study facial structures of matroid base polytopes corresponding to lattice path matroids.
We introduce a new type of lattice path, called brick-wall lattice path, and we derive a formula which counts the number of paths on these lattices imposing certain restrictions on the Cartesian plane. Connections to the Fibonacci sequence, as well as to other sequences of numbers, are given. Finally, we use these brick-wall lattice paths to determine the first two non-zero coefficients of the reliability polynomials associated with particular two-terminal networks known as hammocks.
It is known that a lattice path matroid polytope can be associated with two given noncrossing lattice paths on $\mathbb{Z}\times\mathbb{Z}$ with the same end points. In this short note we give explicit formulae for the $f$-vector, toric $f$- and $g$-polynomials of a lattice path matroid polytope when two boundary paths enclose a hook shape.
We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e., lattices of Dyck paths) and give a recursive construction for them. The last section is devoted to the presentation of a couple of open problems.
Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be identified with the bases of a particular type of transversal matroid, which we call it a lattice path matroid. In this paper, we consider properties of lattice path matroid polytopes. These are the polytopes associated to the lattice path matroids. We investigate their face structure, decomposition, triangulation, Ehrhart polynomial and volume.
A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schröder path. In this paper, we generalize the correspondence to the case of generalized lattice paths, $k$-Dyck, $k$-Motzkin and $k$-Schröder paths, by modifying the recurrence relation of the dimer model. We introduce five types of generalizations of the dimer model by keeping its combinatorial structures. This allows us to express the generating functions in terms of generalized lattice paths. The w…
We show that every lattice path matroid of rank at least two has a quite simple coline, also known as a positive coline. Therefore every orientation of a lattice path matroid is 3-colorable with respect to the chromatic number of oriented matroids introduced by J. Nešetřil, R. Nickel, and W. Hochstättler.
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical reflection argument. A refinement allows for the counting of paths with a specified number of corners. We also apply the result to examine paths dominated by periodic boundaries.
Generating functions of lattice paths
本文回顾格路径的主要类型，并利用 Riordan 数组方法统一、澄清和简化各类格路径的生成函数及相关整数序列。
Notes on Riordan arrays and lattice paths
本文探讨Riordan数组与格路径的联系，分析其推广形式及与不同步集格路径的关联，指出A-矩阵刻画在对应Riordan数组分析中的关键作用。
We find the excluded minors for the minor-closed class of lattice path polymatroids as a subclass of the minor-closed class of Boolean polymatroids. Like lattice path matroids and Boolean polymatroids, there are infinitely many excluded minors, but they fall into a small number of easily-described types.
Lattice path matroids: the excluded minors
本文通过确定被排除的未成年，完整刻画了格路径拟阵的未成年封闭类。
We present three bijections, the first between little Schröder paths and a class of growth-constrained integer sequences, the second between lattice paths consisting of steps with nonnegative slope and another class of growth-constrained sequences, the third between a class of lattice paths with steps $(1,1)$ and $(1,-j\,),\ j\ge 1$, and a class with steps $(k,1),\ k\ge 1$, and $(1,-1)$.
This is a survey of results in the enumeration of lattice paths.
Efficient Representation of Lattice Path Matroids
本文基于分层秘密共享方案、分层拟阵端口刻画及多项式规模隔离权函数，提出了在有限域上高效构造格路径拟阵表示的确定性算法。
A bijection is constructed between two sets of height restricted lattice paths by means of translating them in two tree classe, namely plane trees and Elena trees. An old bijection between them can be used now for that actual problem.
We give an explicit description of the poset of cells of Bergman complexes of Lattice Path Matroids and establish a criterion for its simpliciality, in terms of the shape of the bounding paths.
In this paper we investigate the number of integer points lying in dilations of lattice path matroid polytopes. We give a characterization of such points as polygonal paths in the diagram of the lattice path matroid. Furthermore, we prove that lattice path matroid polytopes are affinely equivalent to a family of distributive polytopes. As applications we obtain two new infinite families of matroids verifying a conjecture of De Loera et.~al. and present an explicit formula of the Ehrhart polynomial for one of them.
The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that are join-irreducible in the imbalance lattice are characterized.
Using lattice path counting arguments, we reproduce a well known formula for the number of standard Young tableaux. We also produce an interesting new formula for tableaux of height $\leq 3$ using the Fourier methods of Ault and Kicey.
Lattice paths and Rogers--Ramanujan--Gordon type overpartitions
本文建立了 Rogers-Ramanujan-Gordon 型超划分与四类酉步长格点路径的双射关系，将 Chen、Sang 和 Shi 的定理转化为格点路径形式，并基于奇偶性约束推导出超划分的新结果。
The diamond product is the poset operation that when applied to the face lattices of two polytopes results in the face lattice of the Cartesian product of the polytopes. Application of the diamond product to two Eulerian posets is a bilinear operation on the cd-indices of the two posets, yielding a product on cd-polynomials. A lattice path interpretation is provided for this product of two cd-monomials.
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. It is shown that for any family of primary paths there are equinumerous families of proper weighted lattice paths that consist of only non-vertical steps. The relation between primary and free paths is established and some combinatorial and statistical properties are obtained. It is shown that the expected number of vertical steps in a primary path running f…
Heaps of pieces for lattice paths
本文引入格路径的I型与II型片段堆，建立对偶、双射及高维对应，并给出生成函数的行列式与显式公式。
Lattice Path Matroids: Structural Properties
本文系统研究格路径拟阵的结构性质，用基本平坦集刻画该类拟阵，确定其连通性，并提出缺口拟阵子类及其排除子式。
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andrá's method (Andra). We give four tables and matrices, and their relations, and give their matrix decompositions. By their relations, we give the explicit formulas of the special combinatorial numbers.
Lattice path matroids: enumerative aspects and Tutte polynomials
本文定义格路拟阵，研究其枚举性质及 Tutte 多项式、特征多项式与 beta 不变量，并证明 Tutte 多项式可多项式时间计算。
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. The first problem considers crossings of a single path with a fixed horizontal line. The second one counts pairs of paths with respect to the number of times they cross each other. Our proofs introduce lattice path bijections with convenient visual descriptions, and the answers are given by remarkably simple formulas involving $q$-binomial coefficients.
We give combinatorial interpretations of several related identities associated with the names Barrucand, Strehl and Franel, including one for the Apery numbers. The combinatorial constructs employed are derangement-type card deals as introduced in a previous paper on Barrucand's identity, labeled lattice paths and, following a comment of Jeffrey Shallit, abelian words over a 3-letter alphabet.
Lattice paths and the Rogers--Ramanujan--Gordon type theorems with parity considerations
本文通过三类单位步格路径与 Rogers–Ramanujan–Gordon 型分拆之间的双射，将 Andrews 的奇偶性分拆定理对应到格路径，并获得新结论。
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öder paths of length $2n$, respectively. By using Riordan group methods we obtain six identities relating $d_{n}$, $m_{n}$, and $s_{n}$ and also give two of them combinatorial proofs. Finally, we investigate some relations satisfied by the generic element of some special Riordan arrays and get the average mid-height and the average number of points on the x-axis of symmetric Dyck paths of length $2n.$
Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at $(n-1,n-1)$, and certain subsemigroups of ${\cal PO}_n$. Several consequences of these bijections were discussed.
The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of multivariate formal Laurent series.
In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is modified and applied to generalize the classical Chung-Feller theorem. We use Lagrange inversion to derive the generalized formulas. For the generating function proof we study various ways of decomposing lattice paths. We also show some results related to equidistribution properties in terms of Narayana and Catalan generating functions. We then develop genera…
Order and Gorenstein properties for lattice path matroid polytopes
该文刻画了snakes这类格路拟阵，证明其是两个猜想的交集对象，还刻画了Gorenstein格路拟阵多面体，并指出格路拟阵是满足特定剖分条件的正拟阵。
The lattice path model suggested by E. Deutsch is derived from ordinary Dyck paths, but with additional down-steps of size -3,-5,-7,... . For such paths, we find the generating functions of them, according to length, ending at level $i$, both, when considering them from left to right and from right to left. The generating functions are intrinsically cubic, and thus (for $i=0$) in bijection to various objects, like even trees, ternary trees, etc.
We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schröder and Grand Schröder lattices. Finally, we give a general formula for the number of edges in an arbitrary Young lattice (which can be interpreted in a natural way as a lattice of paths).
We show that the toric ideal of a lattice path polymatroid is generated by quadrics corresponding to symmetric exchanges, and give a monomial order under which these quadrics form a Gröbner basis. We then obtain an analogous result for lattice path matroids.
A remark on s-torsion pairs and on the lattice of Dyck paths
本文受s-挠类概念启发，将Catalan数上的Dyck路径格解释为等定向A型箭图路径代数的子范畴格，从而统一了三个经典格的范畴化理解。
We present tight upper and lower bounds for the traveling salesman path through the points of two-dimensional modular lattices. We use these results to bound the traveling salesman path of two-dimensional Kronecker point sets. Our results rely on earlier work on shortest vectors in lattices as well as on the strong convergence of Jacobi-Perron type algorithms.
The number of Borel orbits in polarizations (the symmetric variety $SL(n)/S(GL(p)\times GL(q))$) is analyzed, various (bivariate) generating functions are found. Relations to lattice path combinatorics are explored.
Following the work of Cano and Diaz, we consider a continuous analog of lattice path enumeration. This allows us to define a continuous version of any discrete object that counts certain types of lattice paths. We define continuous versions of binomials and multinomials, and describe some identities and partial differential equations they satisfy. Finally, we illustrate a general process to recover discrete combinatorial quantities from their continuous analogs.
We count a large class of lattice paths by using factorizations of free monoids. Besides the classical lattice paths counting problems related to Catalan numbers, we give a new approach to the problem of counting walks on the slit plane (walks avoid a half line) that was first solved by Bousquet-Mélou and Schaeffer. We also solve a problem about walks in the half plane avoiding a half line by subsequently applying the factorizations of two different Gessel pairs, giving a generalization of a result of Bousquet-Mélou.
We discuss the structure of positive definite kernels in terms of operator models. In particular, we introduce two models, one of Hessenberg type and another one that we call near triangular. These models produce parametrizations of the kernels and we describe the combinatorial nature of these parametrizations in terms of lattice paths of Dyck and Lukasiewicz type.
A lattice on Dyck paths close to the Tamari lattice
本文在 Dyck 路径上定义了一种接近 Tamari 格的新格结构，并通过生成函数刻画边、不可约元及区间数量，还给出保持边数双统计量逆序的新对合。
Bliem and Kousidis (arXiv:1109.4624) recently considered a family of random variables whose distributions are given by the generalized Galois numbers (after normalization). We give probabilistic interpretations of these random variables, using inversions in random words, random lattice paths and random Ferrers diagrams, and use these to give new proofs of limit theorems as well as some further limit results.
We first briefly review the role of lattice paths in the derivation of fermionic expressions for the M(p,p') minimal model characters of the Virasoro Lie algebra. We then focus on the recently introduced half-lattice paths for the M(p,2p+/-1) characters, reformulating them in such a way that the two cases may be treated uniformly. That the generating functions of these half-lattice paths are indeed M(p,2p+/-1) characters is proved by describing weight preserving bijections between them and the corresponding RSOS lattice paths. Here, the M(p,2p-1) case is derived for the first time. We then app…
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 by solving a set of simultaneous difference equations.
We study the combinatorics of the change of basis of three representations of the stationary state algebra of the two parameter simple asymmetric exclusion process. Each of the representations considered correspond to a different set of weighted lattice paths which, when summed over, give the stationary state probability distribution. We show that all three sets of paths are combinatorially related via sequences of bijections and sign reversing involutions.
North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
研究确定东北格路中避免k共线点的最大点数，通过求解器枚举所有避免k共线点的路径，并改进了k=7时的路径长度。
A lattice-path description of $K$-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even $x$ coordinate and the maximal value of the height cannot be larger than $K-1$. Its weight is twice that of the corresponding jagged partitions. The equivalence is demonstrated at the level of generating functions. A bijection is given between $K$-restricted jagged partitions and partitions restricted by the following frequencies conditions: $f_{2j-1}$ is even and $f_j+f_{j+1}\leq K-1$, where $f_j$ is the number of occurrences of the part $j$ in the partition…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。