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 89 for “"combinatorial structures"”.

  1. Profiles of Large Combinatorial Structures

    We derive limit laws for random combinatorial structures using singularity analysis of generating functions. We begin with a study of the Boltzmann samplers of Flajolet and collaborators, a useful method for generating large discrete structures at random which is useful both for providing intuition …

    penn Repository record for Profiles of Large Combinatorial Structures (opens in a new tab)

  2. Monotone Sequences in Combinatorial Structures

    Symmetry of monotone sequences arise in many combinatorial structures, the classical examples being inversions and coinversions in permutations. Another example is crossings and nestings in matchings, partitions and permutations. These examples can be generalized to fillings of Ferrers diagrams and …

    tamu Repository record for Monotone Sequences in Combinatorial Structures (opens in a new tab)

  3. Parking Functions and Related Combinatorial Structures.

    … and focus on their interaction with other combinatorial objects; namely noncrossing partitions, hyperplane arrangements and tree inversions. In the final chapter, we discuss generalizations of both parking functions and the above structures.

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

  4. Fingerprinting Codes and Related Combinatorial Structures

    … code has been found to have deep connections to combinatorial structures such as error-correcting codes and cover-free families. The particular property that motivated our research is called "frameproof". This has been studied extensively when the alphabet size q is at least as large as the …

    waterloo Repository record for Fingerprinting Codes and Related Combinatorial Structures (opens in a new tab)

  5. Trees, Partitions, and Other Combinatorial Structures

    … extremal values and characterize extremal tree structures for the ratios Ecc(T)/ eccT (u), Ecc(T)/ eccT (v), eccT (u)/ eccT (v), and eccT (u)/ eccT (w) where u,w are leaves of T and v is in the center of T. Analogous problems have been resolved for other tree invariants including distance …

    south-carolina Repository record for Trees, Partitions, and Other Combinatorial Structures (opens in a new tab)

  6. Combinatorial structures of hyperelliptic Hodge integrals

    This dissertation explores the combinatorial structures that underlie hyperelliptic Hodge integrals. In order to compute hyperelliptic Hodge integrals, we use Atiyah-Bott (torus) localization on a stack of stable maps to [P1/Z2] = P1 × BZ2. The dissertation culminates in two results: a closed-form …

    colostate Repository record for Combinatorial structures of hyperelliptic Hodge integrals (opens in a new tab)

  7. Optimization on products of combinatorial structures

    We consider optimization problems on combinatorial structures with a product form. The independence number of a graph G, denoted $\alpha (G)$, is the size of the largest independent set in G, where a subset S of the vertex set V(G) is independent if no two vertices in S are adjacent in G. The …

    uiuc Repository record for Optimization on products of combinatorial structures (opens in a new tab)

  8. Extremal problems on counting combinatorial structures

    The fast developing field of extremal combinatorics provides a diverse spectrum of powerful tools with many applications to economics, computer science, and optimization theory. In this thesis, we focus on counting and coloring problems in this field. The complete balanced bipartite graph on $n$ …

    uiuc Repository record for Extremal problems on counting combinatorial structures (opens in a new tab)

  9. Constructing certain combinatorial structures by computational methods

    … is the problem of existence: Does a combinatorial structure that satisfies the given requirements exist? In general, it is straightforward to verify that a proposed structure satisfies the required criteria, but finding a structure of the required type is difficult. If a structure of …

    aalto Repository record for Constructing certain combinatorial structures by computational methods (opens in a new tab)

  10. Some Combinatorial Structures Constructed from Modular Leonard Triples

    … and swaps the other two elements. We study combinatorial structures associated with Leonard triples and modular Leonard triples. In the first part we construct a simplicial complex of Leonard triples. The simplicial complex of a Leonard triple is the smallest set of linear operators which …

    usf Repository record for Some Combinatorial Structures Constructed from Modular Leonard Triples (opens in a new tab)

  11. AdS/CFT Integrability and Machine Learning Combinatorial Structures

    … The second part applies Machine Learning to two combinatorial problems in Clifford algebras and error-correcting codes. After a brief introduction of Machine Learning methods, we explore the potential of network classification and principal component analysis in the study of Clifford geometric …

    city-london Download PDF for AdS/CFT Integrability and Machine Learning Combinatorial Structures (opens in a new tab)

  12. Almost perfect nonlinear functions and related combinatorial structures

    … They can also be used to construct several combinatorial structures of interest.;In this dissertation, we characterize and classify all known power maps f(x) = xd over F2n , which are APN or of low uniformity. We discuss some basic properties of APN maps, collect all known APN power maps, …

    iastate Repository record for Almost perfect nonlinear functions and related combinatorial structures (opens in a new tab)

  13. Combinatorial structures and filter design in information spaces

    Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2013-03-18T15:56:28Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 1 Jingjin.Yu.Thesis.pdf: 5836747 bytes, checksum: 3eb6d3859f8759ae7f5b8aea14208ae1 (MD5)

    uiuc Repository record for Combinatorial structures and filter design in information spaces (opens in a new tab)

  14. Efficient Machine Learning with High Order and Combinatorial Structures

    … that exhibit complex and non-local dependency structures. There are three parts to this thesis. In the first part, we develop a toolbox of high order potentials (HOPs) that are useful for defining interactions and constraints that would be inefficient or otherwise difficult to use within the …

    toronto-retro Repository record for Efficient Machine Learning with High Order and Combinatorial Structures (opens in a new tab)

  15. Erasure-Correcting Codes Derived From Sudoku & Related Combinatorial Structures

    … of an investigation into the use of puzzle-based combinatorial structures for erasure correction purposes. The research encompasses two main combinatorial structures: the well-known number placement puzzle Sudoku and a novel three component construction designed specifically with puzzle-based …

    southwales Repository record for Erasure-Correcting Codes Derived From Sudoku & Related Combinatorial Structures (opens in a new tab) Download PDF for Erasure-Correcting Codes Derived From Sudoku & Related Combinatorial Structures (opens in a new tab)

  16. Extensions of Ehrhart theory and applications to combinatorial structures

    … 1 and background on polyhedral geometry and combinatorial structures used in this work in Chapter 2. In Chapter 3 we use Ehrhart polynomials to count combinatorial and geometric data in generalized permutahedra and hypergraphs. Generalized permutahedra are a class of polytopes with many …

    fu-berlin Repository record for Extensions of Ehrhart theory and applications to combinatorial structures (opens in a new tab)

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

  18. Asymptotic enumeration, cluster statistics, and limit laws for combinatorial structures

    For a given combinatorial class C we study two types of combinatorial structures: the class G = Mset(C) satisfying the multiset construction, that is, every object in G is uniquely specified by a set of distinct C-objects each paired with a multiplicity from N indicating the number of occurrences …

    lmu-germany Repository record for Asymptotic enumeration, cluster statistics, and limit laws for combinatorial structures (opens in a new tab)

Page 1 of 5