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 25 for “"enumerative combinatorics"”.

  1. Enumerative combinatorics of posets

    … thesis contains several results concerning the combinatorics of partially ordered sets (posets) which are either of enumerative or extremal nature. <br><br> The first concerns conjectures of Friedland and Kahn, which state that the (extremal) d-regular graph on N vertices containing both the …

    gatech Repository record for Enumerative combinatorics of posets (opens in a new tab)

  2. Extremal Graph Theory and Enumerative Combinatorics

    This thesis consists of research on two topics.The first topic is about different middle parts of trees, such as center, centroid, subtree core. In this work, we considered how far apart (with given order of the tree) two different `middle points' can be and when such maximum distances are …

    gsu Repository record for Extremal Graph Theory and Enumerative Combinatorics (opens in a new tab)

  3. Enumerative combinatorics, representations and quasisymmetric functions

    The present thesis consists of two parts whose main protagonists are colored quasisymmetric functions. In 1984, Gessel introduced quasisymmetric functions, a generalization of symmetric functions. In 1993, together with Reutenauer they studied specializations of families of quasisymmetric functions …

    greece Repository record for Enumerative combinatorics, representations and quasisymmetric functions (opens in a new tab)

  4. On some problems in extremal, probabilistic and enumerative combinatorics

    … selection of problems from various areas of Combinatorics and Graph Theory, a fast developing field that provides a diverse spectrum of powerful tools with numerous applications to computer science, optimization theory and economics. In this thesis, we focus on extremal, probabilistic and …

    uiuc Repository record for On some problems in extremal, probabilistic and enumerative combinatorics (opens in a new tab)

  5. Proof-number search in automated enumeration of combinatorial classes

    Enumerative combinatorics has traditionally been the domain of human mathematicians, and has been applied, for instance, with the probabilistic method in computer science. One of the main problems in enumerative combinatorics is the counting of combinatorial classes, and in recent years, efforts …

    reykjavik Repository record for Proof-number search in automated enumeration of combinatorial classes (opens in a new tab)

  6. Identifying Combinatorial Structures for Binary Strings and Set Partitions

    The goal of enumerative combinatorics is to count the number of some well described objects. We extend the algorithm of Bean et al. that automates this process to work with binary strings and set partitions. This involves teaching the computer about binary strings, set partitions, and the ideas …

    reykjavik Repository record for Identifying Combinatorial Structures for Binary Strings and Set Partitions (opens in a new tab)

  7. Combinatorics and the KP Hierarchy

    … been a renewed interest in its application to enumerative combinatorics inspired by Witten's conjecture (now Kontsevich's theorem). In this thesis we provide a detailed development of the KP hierarchy and some of its applications with an emphasis on the combinatorics involved. Up until now, …

    waterloo Repository record for Combinatorics and the KP Hierarchy (opens in a new tab)

  8. Local Cohomology, Multigradings and Polyhedral Combinatorics

    … commutative algebra and various subfields of combinatorics such as enumerative combinatorics and discrete geometry. Among the central objects in combinatorial commutative algebra are square-free monomial ideals and semigroup rings. This dissertation examines monomial ideals in affine semigroup …

    tamu Repository record for Local Cohomology, Multigradings and Polyhedral Combinatorics (opens in a new tab)

  9. Combinatorial Species and Labelled Structures

    … 1980s as part of the mathematical subfield of enumerative combinatorics, unifying and putting on a firmer theoretical basis a collection of techniques centered around generating functions. The theory of algebraic data types was developed, around the same time, in functional programming …

    penn Repository record for Combinatorial Species and Labelled Structures (opens in a new tab)

  10. Topological Recursion, Deformations, and Interlacing

    … to be a powerful unifying force in the areas of enumerative geometry, integrability, matrix models, enumerative combinatorics, and mathematical physics more generally. As a “classical” example, using the Weingarten calculus for unitary groups, the large N asymptotics of the …

    auckland-ms Repository record for Topological Recursion, Deformations, and Interlacing (opens in a new tab)

  11. New combinatorial techniques for nonlinear orders

    … conjecture, a well-studied open problem in enumerative combinatorics. We then generalize the technique to give results on d-dimensional matrices. In the third chapter, we examine a problem of Pinchasi and Radoicic on cyclically order sets. To do so, we prove an upper bound on the sizes of …

    gatech Repository record for New combinatorial techniques for nonlinear orders (opens in a new tab)

  12. Returning walks on groups with tree-like Schreier graphs

    … the group. We then apply the methods of analytic combinatorics by translating the problem of enumerating walks into functional equations for generating functions. Using complex analytic techniques like singularity analysis, asymptotic formulas for the number of closed walks of length n and winding …

    ubc Repository record for Returning walks on groups with tree-like Schreier graphs (opens in a new tab) Download PDF for Returning walks on groups with tree-like Schreier graphs (opens in a new tab)

  13. Generalizations of Total Positivity

    … asymptotic representation theory, algebraic and enumerative combinatorics, and linear algebra. However, motivated by surprising positivity properties of Lusztig's canonical bases for quantum groups, the field of total positivity has more recently grown to include other totally nonnegative …

    umn Repository record for Generalizations of Total Positivity (opens in a new tab)

  14. Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group

    … up in several areas of mathematics including enumerative combinatorics and representation theory. Tewodros Amdeberhan conjectures equalities of symmetric group characters sums over a new set called Ev(\lambda). In Chapter 4, I share my results from investigating an alternating sum of …

    mtu Repository record for Schaper numbers, palindrome partitions, and symmetric functions, with applications to characters of the symmetric group (opens in a new tab)

  15. Combinatorial Problems on the Integers: Colorings, Games, and Permutations

    … These problems fit inside the areas of extremal combinatorics and enumerative combinatorics. We first study monochromatic solutions to equations when integers are colored with finitely many colors in Chapter 2. By looking at subsets of {1, 2, . . . , n} whose least common multiple is small, we …

    denver Repository record for Combinatorial Problems on the Integers: Colorings, Games, and Permutations (opens in a new tab)

  16. Enumerative Applications of Integrable Hierarchies

    … equations to a variety of problems in enumerative combinatorics. For example, the generating series for monotone Hurwitz numbers, studied by Goulden, Guay-Paquet and Novak, is known to be a solution to the KP hierarchy. Using this fact along with some additional constraints we may find …

    waterloo Repository record for Enumerative Applications of Integrable Hierarchies (opens in a new tab)

  17. Integer Programming Approaches for Network Optimization and Chance-Constrained Combinatorial Problems

    … some combinatorial methods. Our methods combine enumerative combinatorics, discrete probability distributions and combinatorial optimization, representing a novel and intriguing direction for future research in combinatorial chance-constrained problems. Additionally, we explore strategies to …

    arizona-thes Repository record for Integer Programming Approaches for Network Optimization and Chance-Constrained Combinatorial Problems (opens in a new tab)

  18. Efficiency and fairness of resource utilisation under uncertainty

    … space. In comparison, this work shows how enumerative combinatorics can be used to provide the closed formulae of the probabilities of detecting the adversary. Hence, it facilitates characterising optimal random defence strategies in comparison to formerly used iterative black-box models. …

    soton Download PDF for Efficiency and fairness of resource utilisation under uncertainty (opens in a new tab)

  19. On permutation patterns, pinnacle sets, and backbones of bipartite projections

    … permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of permutation avoidance in cyclic permutations and characterized the avoidance classes for all single permutations of …

    msu Repository record for On permutation patterns, pinnacle sets, and backbones of bipartite projections (opens in a new tab)

  20. Computing the Residue Class of Partition Numbers

    In 1919, Ramanujan initiated the study of congruence properties of the integer partition function $p(n)$ by showing that $$p(5n+4) \equiv 0 \mod{5}$$ and $$p(7n+5) \equiv 0 \mod{7}$$ hold for all integers $n$. These results attracted a lot of interest in the mathematical community and inspired …

    waterloo Repository record for Computing the Residue Class of Partition Numbers (opens in a new tab)

Page 1 of 2