Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"lattice paths"”.
-
Lattice Paths
… is a survey of some of the well known results in lattice path theory. Chapter 1 looks into the history of lattice paths. That is, when it began and how it was popularized. Chapter 3 focuses on general lattices and lattice paths. It later looks into different types of properties of some lattice …
-
Lattice paths in R² and R³
<p>The focus in this thesis is on lattice paths in R<sup>2</sup> and R<sup>3</sup>. Three ways of counting the number of lattice paths from the origin to a point inR<sup>2</sup> and R<sup>3</sup> are examined; the recurrence relation, the closed form expression, and the generating function. In the …
-
Enumeration of Lattice Paths with Restrictions
Lattice path enumeration, through the lens of Catalan numbers, plays a crucial role in combinatorics. This thesis delves into enumerations of some of the most common lattice paths – north-east paths, up-down paths, and Dyck paths – with restrictions applied. The first restriction is counting …
-
Counting Plane Tropical Curves via Lattice Paths in Polygons
… purely combinatorial process of counting certain lattice paths.
-
Solutions to the reflection equation: A bijection between lattice configurations and marked shifted tableaux
… marked shifted tableaux with non-intersecting lattice paths. These lattice paths are generated by certain exactly solvable statistical mechanics models, including the vicious and osculating walkers. These models arise from solutions to the Yang-Baxter and Reflection equations. The Yang-Baxter …
-
Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns
… numbers of vertices in G by gluing together lattice paths in an osculating manner. Using a backtracking algorithm to process the lattice paths, we identify over 5 million distinct prime patterns. This is well in excess of the roughly 1,000 found in lace ground catalogues. The lattice paths …
-
Pattern posets: enumerative, algebraic and algorithmic issues
… than permutations, such as integer sequences, lattice paths, graphs, matchings and set partitions. In the first part of this talk I will introduce the general framework of pattern posets and some classical problems about patterns. In the second part of this talk I will present some enumerative …
-
Minimal Resolutions of Monomial Ideals
… ideal. The differential is a weighted sum over lattice paths in $\mathbb{Z}^n$ that come from analogues of spanning trees in simplicial complexes that are indexed by the lattice. Over a field of any characteristic, noncanonical sylvan resolutions are defined. The noncanonical resolutions are …
-
Combinatorial interpretations and q-analogues of the catalan numbers
… are then discussed, including sub-diagonal lattice paths and trivalent trees. Finally, two q-analogues of the Catalan numbers are presented.</p>
-
A Parallel Study of the Fock Space Approach to Classical and Free Brownian Motion
… obscured. In particular, we employ the notion of lattice paths to bring about the moment calculation of normally distributed random variables in the non-commutative probability environment; and we exploit the structure of the lattice of partition of n-elements, which underlies the relationships …
-
Multidimensional Parking Functions
… in terms of pairs of weakly disjoint lattice paths in the p × q grid. Next we extend certain properties of univariate difference Gonˇcarov polynomials to the multivariate case, which we then utilize to derive various enumerative results for increasing U -parking functions via …
-
Blocking measures for interacting particle systems
… another correspondence with certain evolving lattice paths; these are (mostly) down-right paths but where we can take a single up step at certain sites. We look to find the stationary measure for this stochastic lattice path model, and find it as a limiting solution of some second order …
-
Lattice path proof of some Jacobi-Trudi type formulae
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1993
-
Distributions and von Neumann Algebras over Fock Spaces with Depth-Two Action
… can be interpreted using the combinatorics of lattice paths and non-crossing partitions. Our first objective is to generalize (via a common framework) the results of Anshelevich (from 2007), Lenczewski & Sałapata (from 2008), and Bo˙zejko & Lytvynov (from 2009), whose constructions exhibited …
-
Poset Convex-Ear Decompositions and Applications to the Flag h-Vector
… of rank-selected subposets of supersolvable lattices with nowhere-zero M\"obius functions, rank-selected subposets of geometric lattices, and rank-selected face posets of shellable complexes (when the rank-selection does not include the maximal rank). Using these decompositions, we are able …
-
Formal group laws and hypergraph colorings
… the generating function for trees, permutations, lattice paths or graphs. We develop a unifying framework by defining \emph{contractible species}, classes of combinatorial objects having generating functions with this property. This will also allow us to give combinatorial interpretations to …
-
Goncarov Polynomials, Partition Lattices and Parking Sequences
… be realized as weight enumerators in partition lattices. Then, we give a more concrete realization in exponential families and show that these polynomials enumerate various enriched structures of vector parking functions. In the second part, we study increasing parking sequences and their …
-
On permutation patterns, pinnacle sets, and backbones of bipartite projections
… Their proof involved a bijection with lattice paths and was somewhat involved. We give a simpler demonstration of this result which does not need lattice paths. Moreover, we show that our map and theirs are different descriptions of the same function. Davis et al. also studied the …
-
Γενικευμένες κατανομές τάξεως k και εφαρμογές στην ιατρική
… approach and by counting multi-dimensional lattice paths, we introduced and studied the generalized negative binomial distribution of order k, type I. This distribution includes five new distributions of the same order and type (Haight, Takacs, binomial-delta, negative binomial-delta, …
-
Methods in Discrete Mathematics to Study DNA Rearrangement Processes
… and correspondences between legal strings and lattice paths are used to define the curvature of a legal string as a novel measure of DNA scrambling. We also generalize the notion of separation, another measure of DNA scrambling, to the context of legal strings and prove that it is invariant …
Page 1 of 2