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 12 of 12 for “"parking functions"”.

  1. Multidimensional Parking Functions

    … generalizations of Konheim and Weiss’ classical parking functions are the U -parking functions and the (p, q)-parking functions. Originating in Khare, Lorentz, and Yan’s study of bivariate Gonˇcarov polynomials, 2-dimensional U -parking functions are pairs of integer sequences enumerated by these …

    tamu Repository record for Multidimensional Parking Functions (opens in a new tab)

  2. Parking Functions and Related Combinatorial Structures.

    The central topic of this thesis is parking functions. We give a survey of some of the current literature concerning parking functions and focus on their interaction with other combinatorial objects; namely noncrossing partitions, hyperplane arrangements and tree inversions. In the final chapter, …

    waterloo Repository record for Parking Functions and Related Combinatorial Structures. (opens in a new tab)

  3. Parking Functions And Generalized Catalan Numbers

    Since their introduction by Konheim and Weiss, parking functions have evolved into objects of surprising combinatorial complexity for their simple definitions. First, we introduce these structures, give a brief history of their development and give a few basic theorems about their structure. Then …

    tamu Repository record for Parking Functions And Generalized Catalan Numbers (opens in a new tab)

  4. Parking Functions on Trees and Directed Graphs

    A parking function can be thought of as a sequence of n drivers, each with a preferred parking space, wanting to park along a one-way street with n parking spaces. Each driver checks her preferred parking space and, if it is occupied, parks in the first available space afterwards. One may consider …

    tamu Repository record for Parking Functions on Trees and Directed Graphs (opens in a new tab)

  5. Exponential Random Graphs and a Generalization of Parking Functions

    … direction by studying a generalization of parking functions that we call interval parking functions. Parking functions are a classical combinatorial object dating back to the work of Konheim and Weiss in the 1960s. Among other things, we explore the connections that bioutcomes of interval …

    denver Repository record for Exponential Random Graphs and a Generalization of Parking Functions (opens in a new tab)

  6. Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices.

    … author's work on several conjectures relating to parking functions and to Tesler matrices. Parking functions are combinatorial objects which generalize both permutations and Catalan paths. Haglund and Loehr conjectured that the generating functions of two statistics, $area$ and $dinv$, over the …

    penn Repository record for Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices. (opens in a new tab)

  7. Goncarov Polynomials, Partition Lattices and Parking Sequences

    … algebraic tool in the enumerative theory of parking functions. By replacing the differentiation operator with a delta operator and using the theory of finite operator calculus, Lorentz, Tringali and Yan introduced the sequence of generalized Goncarov polynomials associated to a pair $(\Delta, …

    tamu Repository record for Goncarov Polynomials, Partition Lattices and Parking Sequences (opens in a new tab)

  8. Aspects of combinatorial probability

    … Process, and Glauber dynamics on the set of Parking Functions, as well as study a generalization of the more classical interacting particle system IDLA, or Internal Diffusion-Limited Aggregation. For each of these processes, we are interested in studying their evolution in time, and their …

    texas Repository record for Aspects of combinatorial probability (opens in a new tab)

  9. A Combinatorial Interpretation of Minimal Transitive Factorizations into Transpositions for Permutations with two Disjoint Cycles

    … In particular this gives a bijection between parking functions of length n and rooted forests on n elements. Also, it turns out that this bijection allows us to give a direct combinatorial derivation of the number of minimal transitive factorizations into transpositions of the permutations …

    waterloo Repository record for A Combinatorial Interpretation of Minimal Transitive Factorizations into Transpositions for Permutations with two Disjoint Cycles (opens in a new tab)

  10. Graph searching and a generalized parking function

    Parking functions have been a focus of mathematical research since the mid-1970s. Various generalizations have been introduced since the mid-1990s and deep relationships between these and other areas of mathematics have been discovered. Here, we introduced a new generalization, the G-multiparking …

    tamu Repository record for Graph searching and a generalized parking function (opens in a new tab)

  11. Galt Agora: Vision for a Pedestrian Fabric in the City of Cambridge

    … the existing network of underutilized city owned parking lots and other unexploited public sites. It proposes a critical evaluation of current parking functions as legacy urban infrastructure, and the addition of socially, culturally, and economically productive public space, or public …

    waterloo Repository record for Galt Agora: Vision for a Pedestrian Fabric in the City of Cambridge (opens in a new tab)

  12. Designing Networks, Routing Fleets, and Trying to Find Parking

    … Networks, Routing Fleets, and Trying to Find Parking" reflects the kinds of problems I cover: network design, vehicle routing, and the combinatorics of parking.

    cornell Repository record for Designing Networks, Routing Fleets, and Trying to Find Parking (opens in a new tab)