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 42 for “"Bijection"”.
-
Computing the Lusztig-Vogan bijection
… group with Lie algebra g. The Lusztig-Vogan bijection relates two bases for the bounded derived category of G-equivariant coherent sheaves on the nilpotent cone 11 of g. One basis is indexed by ..., the set of dominant weights of G, and the other by [Omega], the set of pairs ... consisting of …
-
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 …
-
Equivariant coherent sheaves on the nilpotent cone for complex reductive Lie groups
… reductive Lie group. We propose a certain bijection between the set of dominant integral weights of G, and the set of pairs consisting of a nilpotent coadjoint orbit and a finite-dimensional irreducible representation of the isotropy group of the orbit. A constructive proof of this …
-
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 …
-
Interval order enumeration
… of Fishburn structures (structures in bijection with unlabeled interval orders) from appropriate Mahonian structures. This technique is introduced on a bivincular pattern of Bousquet-Mélou et al. (2010) and then used to introduce a previously unconsidered class of matchings; …
-
New Methods for Magic Total Labelings of Graphs
… total (VMT) labeling} of a graph $G=(V,E)$ is a bijection from the set of vertices and edges to the set of numbers defined by $\lambda:V\cup E\rightarrow\{1,2,\dots,|V|+|E|\}$ so that for every $x \in V$ and some integer $k$, $w(x)=\lambda(x)+\sum_{y:xy\in E}\lambda(xy)=k$. An \textit{edge magic …
-
Braid Groups on Graphs
… are in bijective correspondence. We use this bijection to solve a version of the isomorphism problem for tree braid groups with n = 4 strands.
-
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>
-
Moduli spaces of rational graphically stable curves
… of a balanced fan by proving a combinatorial bijection between graphically stable tropical curves and chains of flats of a graphic matroid. Algebraically, we characterize when the tropical compactification of the compact moduli space agrees with the theory of geometric tropicalization. Both …
-
Pattern avoidance for alternating permutations and reading words of tableaux
… any of the patterns 132, 213, 312, or 231. Our bijections include a simple bijection involving binary trees, variations on the Robinson-Schensted-Knuth correspondence, and recursive bijections established via isomorphisms of generating trees.
-
A q-analogue of spanning trees : nilpotent transformations over finite fields
… We also discuss more details about this bijection in the cases of complete graphs, complete bipartite graphs, and cycles. It gives some refinements of the q-analogue relationship. As a corollary, we find the total number of nilpotent transformations with some restrictions on Jordan block …
-
Internal monoid actions in a cartesian closed category and higher-dimensional group automorphisms
… Mₙ , is to as- sert that, there is a canonical bijection between B-actions of catⁿ-group B on X and the internal group homomorphism B --> Aut (X). Thus, we confirm the construction of Aut (X) by establishing that bijection. Finally, as one of the results of this work, we give the comparison …
-
Root-theoretic Young diagrams and Schubert Calculus
… we characterize the RYDs and give a bijection between RYDs and the k-strict partitions of A. Buch, A. Kresch and H. Tamvakis. We apply this bijection to show that the (co)adjoint Schubert calculus rules agree with the Pieri rules of A. Buch, A. Kresch and H. Tamvakis, which is needed …
-
I-magic labelings of cubic trees and n-caterpillars
… an edge labeling L: E → {1, 2,.., q} is a bijection from the set of edges E to the set of natural numbers less than or equal to q. A graph is said to be I-magic if there exists an edge labeling such that the sum of all edge labels incident to each internal vertex has the same value, and …
-
Painted Trees and Pterahedra
… the resulting polytope and prove, using a bijection to tubings, that for <i>n</i> ≤ 4 the poset of the painted face trees with <i>n</i>+1 leaves is isomorphic to the face poset of an <i>n</i>-dimensional polytope, specifically KF<sub>1,<i>n</i></sub>, the graph-associahedron for a fan …
-
A Cornucopia Of Labeled Diagrams And Their Generating Polynomials
… coefficient bases. As a result, we conjecture a bijection between tableaux and rook boards, which spurs some further exploration of quasi-Yamanouchi tableaux as combinatorial objects of their own merit. We then move to the general polynomial ring and two of its bases, key and lock polynomials. …
-
Combinatorics of colored factorizations, flow polytopes and of matrices over finite fields
… each factor. For the case k = 2, Bernardi gave a bijection between these factorizations and tree-rooted maps; certain graphs embedded on surfaces with a distinguished spanning tree. This type of bijection also applies to all k and we use it to show a symmetry property of a refinement of Jackson's …
-
Connections between Floer-type invariants and Morse-type invariants of Legendrian knots.
… $\sDMCSeq$ and $\sAugNgresch$ are in bijection.
-
Mixed volumes of hypersimplices, root systems and shifted young tableaux
… For the staircase shape, Postnikov found a bijection between vectors formed by the diagonal entries of these tableaux and lattice points of the (standard) associahedron. Using similar techniques, we generalize this result to arbitrary shifted shapes.
-
Generalised Loewner Evolutions and their driving measures
… We prove three versions of a Loewner-Kufarev bijection between Loewner chains, i.e. normalised conformal maps f_t for t >= 0, defined on a fixed domain and whose images are continuously shrinking, and their driving measures, i.e. a time-dependent family of locally finite measures defined on …
Page 1 of 3