Results 41 to 50 of about 132,418 (291)
On the analogy between real reductive groups and Cartan motion groups: the Mackey–Higson bijection [PDF]
Cambridge Journal of Mathematics, 2015 George Mackey suggested in 1975 that there should be analogies between the irreducible unitary representations of a noncompact reductive Lie group $G$ and those of its Cartan motion group $G_0$ $-$ the semidirect product of a maximal compact subgroup of $
Alexandre Afgoustidis
semanticscholar +1 more source
International Electronic Journal of Algebra, 2016 Given a finite acyclic quiver Q with path algebra kQ, Ingalls and Thomas have exhibited a bijection between the set of Morita equivalence classes of support-tilting modules and the set of thick subcategories of mod kQ and they have collected a large number of further bijections with these sets.
Obaid, M. A. A. +3 more
openaire +5 more sources
Another bijection between $2$-triangulations and pairs of non-crossing Dyck paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 A $k$-triangulation of the $n$-gon is a maximal set of diagonals of the $n$-gon containing no subset of $k+1$ mutually crossing diagonals. The number of $k$-triangulations of the $n$-gon, determined by Jakob Jonsson, is equal to a $k \times k$ Hankel ...
Carlos M. Nicolás
doaj +1 more source
Crystal Interpretation of Kerov-Kirillov-Reshetikhin Bijection II. Proof for sl_n Case [PDF]
, 2007 In proving the Fermionic formulae, combinatorial bijection called the Kerov--Kirillov--Reshetikhin (KKR) bijection plays the central role. It is a bijection between the set of highest paths and the set of rigged configurations.
A. Kuniba +25 more
core +3 more sources
Operator-valued monotone convolution semigroups and an extension of the Bercovici-Pata bijection. [PDF]
Documenta Mathematica, 2014 In a 1999 paper, Bercovici and Pata showed that a natural bijection between the classically, free and Boolean infinitely divisible measures held at the level of limit theorems of triangular arrays. This result was extended to include monotone convolution
M. Anshelevich, John D. Williams
semanticscholar +1 more source
A Natural Bijection between Permutations and a Family of Descending Plane Partitions [PDF]
, 2010 We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of the bijection
Andrews +8 more
core +2 more sources
Journal of Combinatorial Theory, Series A, 1985 AbstractThe notion of an asymptotic bijection is introduced and used to give bijective proofs of infinite summation formulas for set partitions (Dobinski's formula) and involutions.
Doron Zeilberger, Edward A. Bender
openaire +2 more sources
Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We revisit a classic partition theorem due to MacMahon that relates partitions with all parts repeated at least once and partitions with parts congruent to $2,3,4,6 \pmod{6}$, together with a generalization by Andrews and two others by Subbarao.
Shishuo Fu, James Sellers
doaj +1 more source
Bi-Lipschitz bijection between the Boolean cube and the Hamming ball [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2013 We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even n ∈ N there exists an explicit bijection ψ: {0, 1}n → {x ∈ {0, 1}n+1 : |x| > n/2} such that for every x ≠ y ∈ {0, 1}
I. Benjamini, Gil Cohen, Igor Shinkar
semanticscholar +1 more source
Permutations with restricted patterns and Dyck paths [PDF]
, 2000 We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern ...
Krattenthaler, Christian
core +2 more sources