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 17 of 17 for “"lattice path"”.

  1. Rayleigh Property of Lattice Path Matroids

    In this work, we studied the class of lattice path matroids $\mathcal{L}$, which was first introduced by J.E. Bonin. A.D. Mier, and M. Noy in [\ref{Bonin 2002}]. Lattice path matroids are transversal, and $\mathcal{L}$ is closed under duals and minors, which in general the class of transversal …

    waterloo Repository record for Rayleigh Property of Lattice Path Matroids (opens in a new tab)

  2. Lattice Path Matroids: Base Polytopes & Ehrhart Theory

    We study matroid base polytopes of lattice path matroids, $\mathscr{P}(M(\nu))\subset \Rr^n$ with skew shape $\nu$. Our goal is to compute their corresponding Ehrhart polynomials. This story comes in three parts.\textit{Part 1:} We produce a minimal linear inequality description for the base …

    ku Repository record for Lattice Path Matroids: Base Polytopes & Ehrhart Theory (opens in a new tab)

  3. Lattice path proof of some Jacobi-Trudi type formulae

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1993

    msu Repository record for Lattice path proof of some Jacobi-Trudi type formulae (opens in a new tab)

  4. Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration

    … new applications of ACSV to the enumeration of lattice walks restricted to certain regions. In addition to proving several open conjectures on the asymptotics of such walks, a detailed study of lattice walk models with weighted steps is undertaken.

    waterloo Repository record for Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration (opens in a new tab)

  5. Non-Generic Analytic Combinatorics in Several Variables and Lattice Path Asymptotics

    … Determining asymptotics for the number of lattice walks restricted to certain regions is one of the particular successes of analytic combinatorics in several variables. In particular, Melczer and Mishna determined asymptotics for the number of walks in an orthant whose set of steps is a …

    waterloo Repository record for Non-Generic Analytic Combinatorics in Several Variables and Lattice Path Asymptotics (opens in a new tab)

  6. COMPARISON BETWEEN A* BASED SPLINES AND STATE LATTICE PATH PLANNING FOR AUTONOMOUS VEHICLES

    Planning a path from source to destination avoiding collisions with obstacles is a basic requirement for navigation for any autonomous vehicle. Path generated using the algorithms should satisfy the constraints posed by the vehicle for which the path is being generated. Along with this, the path …

    mtu Repository record for COMPARISON BETWEEN A* BASED SPLINES AND STATE LATTICE PATH PLANNING FOR AUTONOMOUS VEHICLES (opens in a new tab)

  7. 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 …

    cornell Repository record for Poset Convex-Ear Decompositions and Applications to the Flag h-Vector (opens in a new tab)

  8. 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 …

    waterloo Repository record for Lattice Paths (opens in a new tab)

  9. Expansion posets for polygon cluster algebras

    … of arcs, triangulations, and distributive lattices. We use these involutions to formulate a dual version of skein relations for arcs, and dual versions of three existing expansion posets. In particular, this leads to two new cluster expansion formulas, and recovers the lattice path …

    msu Repository record for Expansion posets for polygon cluster algebras (opens in a new tab)

  10. 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 …

    gsu Repository record for Enumeration of Lattice Paths with Restrictions (opens in a new tab)

  11. 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 …

    ut-knoxville Repository record for Lattice paths in R² and R³ (opens in a new tab)

  12. Matroidal Combinatorics Intersecting with Algebra and Geometry

    … following questions: 1. Canonical resolution of lattice ideals: we write down a canonical minimal free resolu- tion of any lattice ideal. We a give combinatorial description to the resolution using sylvan morphisms constructed in the monomial ideal case. 2. Shellability of posets of lattice path …

    duke Repository record for Matroidal Combinatorics Intersecting with Algebra and Geometry (opens in a new tab)

  13. Classification of Ideal Secret Sharing Schemes

    … hierarchical access structure corresponds to a lattice path matroid. We also give a matroidal characterization for different classes of ideal access structures, including conjunctive hierarchical access structures, disjunctive access structures, ideal weighted access structures, and ideal …

    auckland-ms Repository record for Classification of Ideal Secret Sharing Schemes (opens in a new tab)

  14. On Flow Polytopes, nu-Associahedra, and the Subdivision Algebra

    … to a flow polytope Fcar(ν) constructed from a lattice path ν, whose volume is given by the ν-Catalan numbers. It begins with a study of the ν-associahedron introduced by Ceballos, Padrol, and Sarmiento in 2019, but from the perspective of Schröder combinatorics. Some classical results for …

    uky-thes Repository record for On Flow Polytopes, nu-Associahedra, and the Subdivision Algebra (opens in a new tab)

  15. Application of extreme order statistics to the average-case analysis of parallel algorithms

    … analysis of one of these is then done using a lattice path model of list arrangement. A new parallel sorting algorithm is presented and analyzed. The algorithm consists of a local sorting phase followed by merging of sorted lists. The merging phase uses an estimate of the order statistics for …

    ucf Repository record for Application of extreme order statistics to the average-case analysis of parallel algorithms (opens in a new tab)

  16. 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 …

    bristol Repository record for Blocking measures for interacting particle systems (opens in a new tab) Download PDF for Blocking measures for interacting particle systems (opens in a new tab)

  17. 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 …

    uvic Repository record for Lace tessellations: a mathematical model for bobbin lace and an exhaustive combinatorial search for patterns (opens in a new tab)