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 167 for “"bijection"”.

  1. OPTIMAL SUBSEQUENCE BIJECTION AND CLASSIFICATION OF IMBALANCED DATA SETS

    … to have a one-to-one and onto correspondence (a bijection) between the remaining elements. To address the problem of noisy time series data we propose using an algorithm that determines the optimal subsequence bijection (OSB) of a query and target time series. The OSB is efficiently computed …

    temple Repository record for OPTIMAL SUBSEQUENCE BIJECTION AND CLASSIFICATION OF IMBALANCED DATA SETS (opens in a new tab)

  2. Breadslice and Doughnut matrix reordering bijection algorithm for Green’s function calculation

    … find its inverse. This algorithm is a bijection and therefore allows for parallel mapping of elements in the Hamiltonian matrix and also allows for mapping the matrix back to its original vertically sliced form. Finding the inverse of the Hamiltonian matrix then allows for the …

    reykjavik Repository record for Breadslice and Doughnut matrix reordering bijection algorithm for Green’s function calculation (opens in a new tab)

  3. Control over the KKR bijection with respect to the nesting structure on rigged configurations and a CSP instance involving Motzkin numbers

    … the Kerov-Kirillov-Reshetikhin (KKR) bijection between semistandard tableaux and rigged configurations with a particular emphasis on the standard case. In partic- ular, we understand inducing perturbations on the corresponding rigged configuration via direct operations on the tableau. …

    waterloo Repository record for Control over the KKR bijection with respect to the nesting structure on rigged configurations and a CSP instance involving Motzkin numbers (opens in a new tab)

  4. Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance

    … 3 and 4. We then begin discussion of Han's bijection, a bijection on permutations which sends the major index to Denert's statistic and the descent number to the (strong) excedance number. We show the existence of several infinite families of fixed points for Han's bijection. Finally, we …

    mtu Repository record for Distribution of permutation statistics across pattern avoidance classes, and the search for a Denert-associated condition equivalent to pattern avoidance (opens in a new tab)

  5. La fonction de Cantor

    Ce mémoire est une introduction à l'étude de la bijection de Cantor, bijection entre l'intervalle unité et le carré unité.

    liege Repository record for La fonction de Cantor (opens in a new tab) Restricted access

  6. A Combinatorial Interpretation of Minimal Transitive Factorizations into Transpositions for Permutations with two Disjoint Cycles

    … cases. We then present an algorithm that is a bijection between the set of elements in {1, ..., k} dropped into n cyclically ordered boxes and some combinatorial structures involving trees attached to boxes, where these structures depend on whether k > n, k = n or k < n. The inverse of this …

    waterloo Repository record for A Combinatorial Interpretation of Minimal Transitive Factorizations into Transpositions for Permutations with two Disjoint Cycles (opens in a new tab)

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

  8. Differential Equations and Depth First Search for Enumeration of Maps in Surfaces

    … on this decomposition, and developing the medial bijection between two equinumerous infinite families of maps. Beginning in the 1980's Jackson, Goulden and Visentin applied algebraic methods in enumeration of non-planar and non-orientable maps, to obtain results of interest for mathematical …

    waterloo Repository record for Differential Equations and Depth First Search for Enumeration of Maps in Surfaces (opens in a new tab)

  9. Order ideals in a C*-algebra.

    … following duality theorems: (i) There exists a bijection between the norm-closed 2-sided ideals of A and the norm-closed invariant order ideals of A. (ii) There exists a bijection between the norm-closed left ideals of A and the norm-closed order ideals of A. (iii) There exists an order …

    ottawa-retro Repository record for Order ideals in a C*-algebra. (opens in a new tab)

  10. NON-LINEAR BISEPARATING OPERATORS ON VECTOR-VALUED FUNCTION SPACES

    … between a class of function spaces induces a bijection between a class of open sets. Such bijection will further induce a homeomorphism between the underlying spaces X and Y when they are both realcompact, or metric spaces. Next, I obtained the functional representation of non-linear …

    nus Repository record for NON-LINEAR BISEPARATING OPERATORS ON VECTOR-VALUED FUNCTION SPACES (opens in a new tab) Download file for NON-LINEAR BISEPARATING OPERATORS ON VECTOR-VALUED FUNCTION SPACES (opens in a new tab)

  11. Pro-Covering Fibrations of the Hawaiian Earring

    … whose inverse limit is H. We give an explicit bijection between finite normal covering spaces of H and finite normal covering spaces of Bi. This bijection induces a correspondence between a certain family of inverse sequences of these covering spaces. The correspondence preserves the inverse …

    byu Repository record for Pro-Covering Fibrations of the Hawaiian Earring (opens in a new tab) Download PDF for Pro-Covering Fibrations of the Hawaiian Earring (opens in a new tab)

  12. Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux

    … Schensted's algorithm also constructs a bijection between permutations of the first N natural numbers and standard bitableaux of size N. We also describe the Hillman-Grassl algorithm which constructs a bijection between reverse plane partitions and the solutions in natural numbers of a …

    unt Repository record for Algorithms of Schensted and Hillman-Grassl and Operations on Standard Bitableaux (opens in a new tab)

  13. Enumeration Results On Leaf Labeled Trees

    … Appl. Math.series 10,1989, 488--496] gave a bijection between rooted semilabeled trees and set partitions. L.H. Harper's results [Ann. Math.Stat.series 38, 1967, 410--414] on the asymptotic normality of the Stirling numbers of the second kind translates into asymptotic normality of rooted …

    south-carolina Repository record for Enumeration Results On Leaf Labeled Trees (opens in a new tab)

  14. Greco-Latin squares as bijections

    … Equivalently, the Latin squares together form a bijection on the set of n-squared coordinates. In this thesis the question of what this bijection is in terms of projective planes is investigated. The major result here is a new necessary and sufficient condition such that two ternary rings …

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

  15. GRAPH MATCHING AND CORRELATION FOR GRAPHS

    … problem is, given two graphs, to find the bijection between the vertex sets that best preserves the adjacency structure. It has been applied in many areas such as pattern recognition, object detection, and neuroscience, to name a few. Our first group of contributions: We modify the …

    jhu Repository record for GRAPH MATCHING AND CORRELATION FOR GRAPHS (opens in a new tab)

  16. Decentralized Stochastic Control with Many Decision Makers and their Mean-Field Limit

    … For the first type, we show that there is a bijection between person-by-person optimal (globally optimal) policies of dynamic teams and their policy-independent static reductions. For the second type, although there is a bijection between globally optimal policies of dynamic teams with …

    queens Repository record for Decentralized Stochastic Control with Many Decision Makers and their Mean-Field Limit (opens in a new tab)

  17. Sign Matrix Polytopes

    … which are certain {0,1,-1}--matrices in bijection with semistandard Young tableaux. This bijection is refined to include standard Young tableau of certain shapes. One such shape is counted by the Catalan numbers, and the convex hull of these standard Young tableaux form a Catalan …

    ndsu Repository record for Sign Matrix Polytopes (opens in a new tab)

  18. ORDERED MATRICES OF PRESCRIBED ROW AND COLUMN SUM

    … the same recurrence. Second, we give an explicit bijection between the two sets. We also show that the bijection maintains the cycle structure of our matrices. Let M_s(n,2) be the set of symmetric matrices in M(n,2). We will show M_s(n,2) satisfies the Fibonacci sequence.

    clemson Repository record for ORDERED MATRICES OF PRESCRIBED ROW AND COLUMN SUM (opens in a new tab)

Page 1 of 9