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 110 for “"bijective"”.

  1. Bijective Parameterization with Free Boundaries

    … fully automatic method for generating guaranteed bijective surface parameterizations from triangulated 3D surfaces. In particular, a new isometric distortion energy metric is introduced preventing local folds of triangles in the parameterization as well as a barrier function that prevents …

    tamu Repository record for Bijective Parameterization with Free Boundaries (opens in a new tab)

  2. Deterministic and Probabilistic Bijective Combinatorics for Macdonald Polynomials

    Permuted-basement Macdonald polynomials 𝐸^𝜎_𝛼(𝐱; 𝑞, 𝑡) are nonsymmetric generalizations of symmetric Macdonald polynomials indexed by a composition 𝛼 and a permutation 𝜎. They form a basis for the polynomial ring ℚ(𝑞, 𝑡)[𝐱] for each fixed permutation 𝜎. They can be described combinatorially as …

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

  3. Bijective proofs of partition identities and covering systems

    … on colored partitions, and they asked for a bijective proof of it. In Chapter 2, we give a bijective proof of a more general partition identity, with the Farkas and Kra partition theorem being a special case. We then derive three further general partition identities and give bijective proofs …

    uiuc Repository record for Bijective proofs of partition identities and covering systems (opens in a new tab)

  4. Splitting factor maps into s- and u-bijective maps

    … has a factor map that can be split into a s-bijective and u-bijective map; thereby better modelling a Smale space on its characterizing expanding and contracting spaces separately. In this thesis, we define two new constructions of Markov partitions for hyperbolic toral automorphisms inspired …

    uvic Repository record for Splitting factor maps into s- and u-bijective maps (opens in a new tab)

  5. Bijective proofs for the shuffle compatibility of descent statistics

    … The purpose of the present work is to use bijective techniques to give demonstrations of shuffle compatibility. In particular, we show how a large number of permutation statistics can be shown to be shuffle compatible using a few simple bijections. Our approach also leads to a method for …

    msu Repository record for Bijective proofs for the shuffle compatibility of descent statistics (opens in a new tab)

  6. BIJECTIVE ILLUMINATION COLLECTION IMAGING: HIGHRE-SOLUTION TOMOGRAPHY IN THREE DIMENSIONS

    … imposed by diffraction. This technique, termed bijective illumination collection imaging (BICI), decouples lateral resolution from depth of focus by establishing a one-to-one correspondence (bijection) along a focal line between the illumination and collection light paths. Unlike the traditional …

    queens Repository record for BIJECTIVE ILLUMINATION COLLECTION IMAGING: HIGHRE-SOLUTION TOMOGRAPHY IN THREE DIMENSIONS (opens in a new tab)

  7. Necklaces and Slimes

    It was asked if one can find a bijective map between the following two objects: binary necklaces with n black beads and k white beads and certain (n, k)-codes whose weighted sum is 0 modulo n (Brauner et al.,2019 [9]; Chan, 2019). The former object is one that has been studied for ages, whereas the …

    texas-state Repository record for Necklaces and Slimes (opens in a new tab)

  8. Síntese de circuitos para computação reversível usando Portas Toffoli Generalizadas

    … for synthesis of reversible circuits from bijective functions. This algorithm uses generalized Toffoli gates, which include positive and negative controls. Our algorithm is divided into two parts. First, we use partially controlled generalized Toffoli gates, progressively increasing the …

    brazil-uerj Repository record for Síntese de circuitos para computação reversível usando Portas Toffoli Generalizadas (opens in a new tab)

  9. Spectral Theory of Z^d Substitutions

    … of the spectrum for Queffelec's noncommutative bijective substitution, as well as the Table tiling, answering an open question of Solomyak. Moreover, we also prove that the spectrum of any aperiodic bijective commutative Z^d substitution on a finite alphabet is purely singular. Finally, we show …

    washington Repository record for Spectral Theory of Z^d Substitutions (opens in a new tab)

  10. Abacus-Tournament Models of Hall-Littlewood Polynomials

    … With the abacus-tournament model, we give a bijective proof of a Pieri rule for Hall-Littlewood polynomials that gives the Pλ-expansion of the product of a Hall-Littlewood polynomial Pµ with an elementary symmetric polynomial ek. We also give a bijective proof of certain cases of a second …

    vt Repository record for Abacus-Tournament Models of Hall-Littlewood Polynomials (opens in a new tab)

  11. Characterising Homeomorphisms on Continua

    … the following question: given a set X and a bijective self-map f on X, when does there exist a metric on X that makes f continuous and X a compact connected metric space? This thesis is solely devoted to answering this question and provides a characterisation.

    auckland-ms Repository record for Characterising Homeomorphisms on Continua (opens in a new tab)

  12. Parity Theorems for Combinatorial Statistics

    … <p>As a consequence of our results, we obtain bijective proofs of congruences involving Stirling, Catalan, and Bell numbers. In addition, we modify the ideas used to construct the aforementioned sign-reversing involutions to furnish bijective proofs of combinatorial identities involving sums …

    utk-theses Repository record for Parity Theorems for Combinatorial Statistics (opens in a new tab)

  13. Twisted Spectral Data and Singular Monopoles

    … We conjecture that this correspondence is bijective under certain stability condition, and thus gives an algebraic construction of singular monopoles.

    penn Repository record for Twisted Spectral Data and Singular Monopoles (opens in a new tab)

  14. Braid Groups on Graphs

    … B4T and trees T (up to homeomorphism) are in bijective correspondence. We use this bijection to solve a version of the isomorphism problem for tree braid groups with n = 4 strands.

    uiuc Repository record for Braid Groups on Graphs (opens in a new tab)

  15. Fixed-Point-Free Involution Word Diagrams

    … These algorithms serve as the basis for bijective proofs of corresponding transition equations for fixed-point-free involution Stanley symmetric functions. We also use the diagrams to show deletion and exchange properties of FPF involution words.

    oregon Repository record for Fixed-Point-Free Involution Word Diagrams (opens in a new tab)

  16. Some New Combinatorial Formulas For Cluster Monomials Of Type A Quivers

    … compatible collections and broken lines. We give bijective proofs of these formulas by comparing with the well-known combinatorial models of the T-paths and of the perfect matchings in a snake diagram.

    wayne-thes Repository record for Some New Combinatorial Formulas For Cluster Monomials Of Type A Quivers (opens in a new tab)

  17. Symplectic toric stratified spaces with isolated singularities

    … by showing that their isomorphism classes are in bijective correspondence with the first Chern classes of principal G-bundles over W. This generalizes Lerman’s classification of compact connected contact toric manifolds. Symplectic toric stratified spaces with isolated singularities are spaces …

    uiuc Repository record for Symplectic toric stratified spaces with isolated singularities (opens in a new tab)

  18. Superposition Mapping & Related Coding Techniques

    … are mostly derived for coded transmission with bijective uniform mapping, do not really fit with superposition mapping, which is often non-bijective and nonuniform. As the main contribution, a novel coding strategy called low-density hybrid-check (LDHC) coding is proposed. LDHC codes are optimal …

    cau-kiel Repository record for Superposition Mapping & Related Coding Techniques (opens in a new tab)

Page 1 of 6