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 48 for “"bijections"”.

  1. Compositions, Bijections, and Enumerations

    … and analytic proofs. We also show several bijections between various types of compositions to certain types of numeric strings, and provide a generalization of a classic bijection between compositions and binary strings.</p>

    gsu Repository record for Compositions, Bijections, and Enumerations (opens in a new tab)

  2. Greco-Latin squares as bijections

    <p>A Latin square of order n is an n-by-n array of n symbols, which we take to be the integers 0 to n-1, such that no symbol is repeated in any row or column. Two Latin squares of the same order are orthogonal if, when overlapped, no ordered pair of symbols occurs more than once. Equivalently, the …

    iastate Repository record for Greco-Latin squares as bijections (opens in a new tab)

  3. Automated bijections with combinatorial exploration

    Bijections appear in most areas of mathematics. They are of particular importance in the field of combinatorics, where they are a way of enumerating families of objects. The aim of this thesis was to develop a fully automated and domain agnostic bijection search built on top of an existing …

    reykjavik Repository record for Automated bijections with combinatorial exploration (opens in a new tab)

  4. Geometric bijections of graphs and regular matroids​

    … study several topics centered on a new family of bijections, named the geometric bijections, between the Jacobian and the set of spanning trees. An important feature of geometric bijections is that they are closely related to polyhedral geometry and the theory of oriented matroids despite their …

    gatech Repository record for Geometric bijections of graphs and regular matroids​ (opens in a new tab)

  5. On Partial Permutations and Alternating Sign Matrices: Bijections and Polytopes

    … function for partial permutations and show bijections relating certain subsets to decorated permutations and set partitions. We prove bijections among partial alternating sign matrices and several other combinatorial objects as well as results related to their dynamics, analogous to those in …

    ndsu Repository record for On Partial Permutations and Alternating Sign Matrices: Bijections and Polytopes (opens in a new tab)

  6. A Combinatorial Tale of Two Scattering Amplitudes: See Two Bijections

    In this thesis, we take a journey through two different but not dissimilar stories with an underlying theme of combinatorics emerging from scattering amplitudes in quantum field theories. The first part tells the tale of the c2-invariant, an arithmetic invariant related to the Feynman integral in …

    waterloo Repository record for A Combinatorial Tale of Two Scattering Amplitudes: See Two Bijections (opens in a new tab)

  7. Deterministic and Probabilistic Bijective Combinatorics for Macdonald Polynomials

    … permutation 𝜎. We construct deterministic bijections and probabilistic bijections on fillings that prove identities relating 𝐸^𝜎_𝛼, 𝐸^{𝜎𝑠ᵢ}_𝛼, 𝐸^𝜎_{𝑠ᵢ𝛼}, and 𝐸^{𝜎𝑠ᵢ}_{𝑠ᵢ𝛼}. These identities correspond to two combinatorial operations on the shape and basement of the fillings: swapping …

    waterloo Repository record for Deterministic and Probabilistic Bijective Combinatorics for Macdonald Polynomials (opens in a new tab)

  8. Combinatorics of Oscillating Tableaux

    … by the sequence. We list four different bijections constructed by using the RSK insertion. The first one is a bijection between vacillating tableaux and pairs (P, T), where P is a set of ordered pairs and T is a standard tableau. The second one is a bijection between set partitions of [n] …

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

  9. Structure in Stable Matching Problems

    … matching in this context. We also investigate bijections of the problem instance vertex set to itself which preserve the set of stable matchings (up to permutation). Such bijections define “symmetric” problem instances. We study this notion of symmetry, and use it to cut down on the number of …

    waterloo Repository record for Structure in Stable Matching Problems (opens in a new tab)

  10. Schubert Objects

    … of this dissertation is to illumination the bijections between them. In addition to exploring the bijections between Schubert objects, we explore different methods of constructing them. The construction methods are all developed using trees of Schubert objects and taking the collection of …

    washington Repository record for Schubert Objects (opens in a new tab)

  11. Formalizing the translation method in Agda

    … previously given by Wood and Zeilberger, the bijections produced by our implementation are formally verified, making our implementation more robust. We also take advantage of the fact that Agda is a proof assistant, allowing users of our implementation to use the existing facilities provided …

    reykjavik Repository record for Formalizing the translation method in Agda (opens in a new tab)

  12. New Results on Cyclic Compositions and Multicompositions

    … are observed and proved. Also, some interesting bijections involving Pell numbers and the Jacobsthal sequence are given.

    gsu Repository record for New Results on Cyclic Compositions and Multicompositions (opens in a new tab)

  13. A Novel Insertion Algorithm

    … seeks to provide an alternative to the existing bijections between permutations and certain kinds of tableaux. We will define two versions of each algorithm covered, both the existing ones and the novel one. These different constructions will include one using a lot of small intermediate steps …

    vt Repository record for A Novel Insertion Algorithm (opens in a new tab)

  14. Generalized Catalan Numbers and Some Divisibility Properties

    … of generalized Catalan numbers and survey bijections across these representation. Third, I extend several divisibility results proved by Koshy. Finally, I prove conditions under which sufficiently large primes form blocks of divisibility and indivisibility of the generalized Catalan …

    unlv Repository record for Generalized Catalan Numbers and Some Divisibility Properties (opens in a new tab) Download PDF for Generalized Catalan Numbers and Some Divisibility Properties (opens in a new tab)

  15. Boundization, Closure and Convergence For The Ultra Extended Complex Banach and Hilbert Spaces with Applications

    … the Ultra Extended Banach Space. A new family of bijections, motivated by nonlinear projections, take an Ultra Extended Banach Space into bounded subsets of a “larger” Banach space. We compare the family of new metrics induced and show which ones are equivalent and which ones are unexpectedly not …

    wvu Repository record for Boundization, Closure and Convergence For The Ultra Extended Complex Banach and Hilbert Spaces with Applications (opens in a new tab)

  16. Inverse semigroups in coarse geometry

    … where the data comes in the form of partial bijections that preserve the topology, and operator algebras, where the partial bijections encode *-subsemigroups of partial isometries of Hilbert space. In this thesis we explore the connections between these two pictures within the backdrop of …

    soton Download PDF for Inverse semigroups in coarse geometry (opens in a new tab)

  17. M-level rook placements

    … and Schü}tzenberger presented explicit bijections between rook placements on any two rook equivalent Ferrers boards as part of their construction of a unique representative in each equivalence class of Ferrers boards. A key tool in their construction was local transposition. We present …

    msu Repository record for M-level rook placements (opens in a new tab)

  18. Erdvę užpildančios kreivės /

    … address the difference between set-theoretic bijections and continous parametrizations, why there does not exist a continous bijection between an interval and a square. In addition to this, we will consider surjections onto different regions, analyze maps onto infinite dimensional region, and …

    vilnius Repository record for Erdvę užpildančios kreivės / (opens in a new tab)

  19. Exceptional polynomials and monodromy groups in positive characteristic

    … polynomials over a finite field $k$ that induce bijections over infinitely many finite extensions of $k$. In the first chapters we give the theoretical background to characterize this class of polynomials with Galois theoretic means. This leads to the notion of arithmetic resp. geometric …

    wurz-thes Repository record for Exceptional polynomials and monodromy groups in positive characteristic (opens in a new tab)

  20. ON SYMMETRIC STRUCTURES IN MACHINE LEARNING: NEURAL NETWORKS, GAMES, AND GRAPHICAL MODELS

    … games, where invariance under measurable bijections facilitates the derivation of sample complexity for learning Nash equilibria. Finally, we explore structure learning in hidden tree models, showing that invariance to redundant hidden nodes leads to learning over equivalence classes. …

    nus Repository record for ON SYMMETRIC STRUCTURES IN MACHINE LEARNING: NEURAL NETWORKS, GAMES, AND GRAPHICAL MODELS (opens in a new tab) Download file for ON SYMMETRIC STRUCTURES IN MACHINE LEARNING: NEURAL NETWORKS, GAMES, AND GRAPHICAL MODELS (opens in a new tab)

Page 1 of 3