Results 51 to 60 of about 20,234 (200)

Peak algebras, paths in the Bruhat graph and Kazhdan-Lusztig polynomials [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
We obtain a nonrecursive combinatorial formula for the Kazhdan-Lusztig polynomials which holds in complete generality and which is simpler and more explicit than any existing one, and which cannot be linearly simplified. Our proof uses a new basis of the
Francesco Brenti, Fabrizio Caselli
doaj   +1 more source

k-Distinct Lattice Paths

, 2023
Lattice paths can be used to model scheduling and routing problems, and, therefore, identifying maximum sets of k-distinct paths is of general interest. We extend the work previously done by Gillman et. al.
Yager, Eric J, Engstrom, Marcus
core  

Enumeration of Generalised Directed Lattice Paths in a Strip [PDF]

, 2019
PhD thesisThis thesis is about the enumeration of two models of directed lattice paths in a strip. The first problem considered is of path diagrams formed by Dyck paths and columns underneath it, counted with respect to the length of the paths and the ...
KHALID, ANUM
core  

Lattice Path Matroids and Quotients

Combinatorica
AbstractWe characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as coefficients.
Carolina Benedetti-Velásquez, Kolja Knauer   +1 more
openaire   +3 more sources

Lattices of paths: Representation theory and valuations [PDF]

Journal of Combinatorics, 2011
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.
FERRARI, LUCA, E. Munarini
openaire   +4 more sources

Constellations and multicontinued fractions: application to Eulerian triangulations [PDF]

Discrete Mathematics & Theoretical Computer Science, 2012
We consider the problem of enumerating planar constellations with two points at a prescribed distance. Our approach relies on a combinatorial correspondence between this family of constellations and the simpler family of rooted constellations, which we ...
Marie Albenque, Jérémie Bouttier
doaj   +1 more source

Numerical Prediction of the Influence of Process Parameters and Process Set-Up on Damage Evolution during Deep Drawing of Rectangular Cups

Engineering Proceedings, 2022
The manufacturing of three-dimensional components by deep drawing is performed using flat sheets. The material properties of the sheets are influenced by the deep drawing process by means of microstructural effects (e.g., anisotropy, residual stresses ...
Martina Müller, Ingo Felix Weiser, Tim Herrig, Thomas Bergs   +3 more
doaj   +1 more source

Lattice Path Bicircular Matroids

Graphs and Combinatorics
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, Winfried Hochstättler   +1 more
openaire   +3 more sources

The genesis of involutions (Polarizations and lattice paths) [PDF]

Discrete Mathematics, 2019
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.
Mahir Bilen Can, Özlem Ugurlu
openaire   +3 more sources

Bergman Complexes of Lattice Path Matroids [PDF]

SIAM Journal on Discrete Mathematics, 2015
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, Martin Dlugosch
openaire   +3 more sources