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

  1. Additive Combinatorics

    … Eventown theorem through the lens of additive combinatorics.

    concordia Download PDF for Additive Combinatorics (opens in a new tab)

  2. Absorptions in combinatorics

    … related to the absorption technique in extremal combinatorics: Given a collection of simple graphs <em>G</em><sub>1</sub>, . . . , <em>G<sub>t</sub></em> defined on the same vertex set <em>V</em>, where each graph <em>G<sub>i</sub></em> (1 ≤ <em>i</em> ≤ <em>t</em>) satisfies some property …

    oxford Repository record for Absorptions in combinatorics (opens in a new tab)

  3. Combinatorics of Compositions

    Integer compositions and related enumeration problems have been extensively studied. The cyclic analogues of such questions, however, have significantly fewer results. In this thesis, we follow the cyclic construction of Flajolet and Soria to obtain generating functions for cyclic compositions and …

    gsu Repository record for Combinatorics of Compositions (opens in a new tab)

  4. Combinatorics of Condorcet Domains

    Condorcet domains are sets of linear orders in which the majority relation of any profile with an odd number of voters is always transitive. One of the major research questions in the literature focuses on characterising maximal Condorcet domains. The class of peak-pit maximal Condorcet domains has …

    auckland-ms Repository record for Combinatorics of Condorcet Domains (opens in a new tab)

  5. Topics in arithmetic combinatorics

    … each related to a problem in arithmetic combinatorics. In particular, we study the interaction between addition and multiplication over real numbers, integers, and finite fields, respectively. In Chapter 2, we study Erdos similarity problem in the large. We show that for each sequence of …

    ubc Repository record for Topics in arithmetic combinatorics (opens in a new tab) Download PDF for Topics in arithmetic combinatorics (opens in a new tab)

  6. Hyperpfaffians in Algebraic Combinatorics

    The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The hyperpfaffian, which was introduced by Barvinok, generalizes the pfaffian to higher dimension. This was further developed by Luque, Thibon and Abdesselam. There are several non-equivalent definitions …

    waterloo Repository record for Hyperpfaffians in Algebraic Combinatorics (opens in a new tab)

  7. Combinatorics of Grassmannian Decompositions

    This thesis studies several combinatorially defined families of subsets of the Grassmannian. We introduce and study a family of subsets called “basis shape loci” associated to transversal matroids. Additionally, we study the Deodhar and positroid decompositions of the Grassmannian. A basis shape …

    waterloo Repository record for Combinatorics of Grassmannian Decompositions (opens in a new tab)

  8. Topics in additive combinatorics

    … of results in both pure and applied additive combinatorics.

    oxford Repository record for Topics in additive combinatorics (opens in a new tab)

  9. Topics in additive combinatorics

    … thesis deals with four problems in additive combinatorics. After giving a brief introduction to the field and overview of the results in Chapter 1, in Chapter 2 we consider the problem of finding the clique number of the Cayley graph on &Fopf;<sub>2</sub><sup>n</sup> generated by a random …

    oxford Repository record for Topics in additive combinatorics (opens in a new tab)

  10. Topics In Probabilistic Combinatorics

    This paper is a compilation of results in combinatorics utilizing the probabilistic method. Below is a brief description of the results highlighted in each chapter. Chapter 1 provides basic definitions, lemmas, and theorems from graph theory, asymptotic analysis, and probability which will be used …

    siu-theses Repository record for Topics In Probabilistic Combinatorics (opens in a new tab)

  11. Biclosed sets in Combinatorics

    … in various contexts, including enumer- ative combinatorics, hyperplane arrangements, Schubert calculus, cluster algebras, and many more. A fundamental result on the weak order is that the collection of maximal chains in any interval is connected by certain "local moves"�. Other notable …

    umn Repository record for Biclosed sets in Combinatorics (opens in a new tab)

  12. Combinatorics of Oscillating Tableaux

    In this paper, we first introduce the RSK algorithm, which gives a correspondence between integer sequences and standard tableaux. Then we introduce Schensted’s theorem and Greene’s theorem that describe how the shape of the standard tableau is determined by the sequence. We list four different …

    tamu Repository record for Combinatorics of Oscillating Tableaux (opens in a new tab)

  13. 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)

  14. Combinatorics of poset polytopes

    This thesis studies the interplay between a finite partially ordered set (a poset for short) and polytopes constructed from it: order polytopes and chain polytopes. We study correspondences between parts of the poset and faces of the polytopes. We compare these two polytopes to each other and prove …

    aalto Repository record for Combinatorics of poset polytopes (opens in a new tab)

  15. Combinatorics of Schubert Polynomials

    In this thesis, we study several aspects of the combinatorics of various important families of polynomials, particularly focusing on Schubert polynomials. Schubert polynomials arise as distinguished representatives of cohomology classes in the cohomology ring of the flag variety. As polynomials, …

    cornell Repository record for Combinatorics of Schubert Polynomials (opens in a new tab)

  16. Problems in extremal combinatorics

    In this thesis, we prove results in extremal combinatorics. The thesis is divided into three parts. In the first part, for fixed integers $n \ge k \ge 2$ and $s \ge 2$, we study the chromatic number of the subgraphs of the Kneser graph $\textrm{KG}(n,k)$ induced by the family the $s$-stable sets in …

    iastate Repository record for Problems in extremal combinatorics (opens in a new tab)

  17. Combinatorics using computational methods

    Computational combinatorics involves combining pure mathematics, algorithms, and computational resources to solve problems in pure combinatorics. This thesis provides a theoretical framework for combinatorial search, which is then applied to several problems in combinatorics. Chain Counting: Linek …

    nebraska Repository record for Combinatorics using computational methods (opens in a new tab)

  18. Problems in extremal combinatorics

    We consider a variety of problems in extremal graph and set theory. Given a property $\Gamma$ and a family of sets ${\mathcal F}$, let $f({\mathcal F},\Gamma)$ be the size of the largest subfamily of ${\mathcal F}$ having property $\Gamma$. Let $f(m,\Gamma)$ be the minimum of $f({\mathcal …

    uiuc Repository record for Problems in extremal combinatorics (opens in a new tab)

Page 1 of 58