Results 1 to 10 of about 45,117 (164)
Design and optimization of graded lattice structures with load path-oriented reinforcement
Lattice structures have been increasingly used in load-carrying applications due to their exceptional mechanical performance. This study presents a novel load path methodology for designing and optimizing functionally graded lattice structures composed ...
Shengjie Zhao +4 more
doaj +3 more sources
Lattice Path Bicircular Matroids
AbstractLattice 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.
Santiago Guzmán-Pro +2 more
exaly +4 more sources
Congruence for Lattice Path Models with Filter Restrictions and Long Steps
We derive a path counting formula for a two-dimensional lattice path model with filter restrictions in the presence of long steps, source and target points of which are situated near the filters. This solves the problem of finding an explicit formula for
Dmitry Solovyev
doaj +3 more sources
Bergman Complexes of Lattice Path Matroids [PDF]
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.
Emanuele Delucchi
exaly +4 more sources
Lattice path matroids: The excluded minors
13 pages, 2 ...
Joseph E Bonin
exaly +4 more sources
The Carlitz lattice path polynomials
The author interprets some polynomials of Carlitz as generating functions for some natural statistics on lattice paths in \(\mathbb{R}^n\) \((n= 2,3)\) which admit diagonal moves.
exaly +3 more sources
Tableau stabilization and lattice paths [PDF]
If one attaches shifted copies of a skew tableau to the right of itself and rectifies, at a certain point the copies no longer experience vertical slides, a phenomenon called tableau stabilization. While tableau stabilization was originally developed to construct the sufficiently large rectangular tableaux fixed by given powers of promotion, the ...
Ahlbach, Connor +3 more
openaire +3 more sources
Combinatorial Generation Algorithms for Some Lattice Paths Using the Method Based on AND/OR Trees
Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties.
Yuriy Shablya
doaj +1 more source
Combinatorics on lattice paths in strips [PDF]
For lattice paths in strips which begin at $(0,0)$ and have only up steps $U: (i,j) \rightarrow (i+1,j+1)$ and down steps $D: (i,j)\rightarrow (i+1,j-1)$, let $A_{n,k}$ denote the set of paths of length $n$ which start at $(0,0)$, end on heights $0$ or $-1$, and are contained in the strip $-\lfloor\frac{k+1}{2}\rfloor \leq y \leq \lfloor\frac{k}{2 ...
Nancy S. S. Gu, Helmut Prodinger
openaire +2 more sources
Counting Lattice Paths by Using Difference Equations with Non-constant Coefficients
The lattice paths can be counted by the virtue of their step vectors that are aligned to the positive octant. A path can go from one point to an infinite others if there is no restriction applied such that each point only has finitely many predecessors ...
S. Chandragiri
doaj +1 more source

