Nothing Special   »   [go: up one dir, main page]

Jacon, 2008 - Google Patents

Crystal graphs of irreducible-modules of level two and Uglov bipartitions

Jacon, 2008

View PDF
Document ID
7693232309012352034
Author
Jacon N
Publication year
Publication venue
Journal of Algebraic Combinatorics

External Links

Snippet

We give a simple description of the natural bijection between the set of FLOTW bipartitions and the set of Uglov bipartitions (which generalizes the set of Kleshchev bipartitions). These bipartitions, which label the crystal graphs of irreducible U_v(sl_e)-modules of level two …
Continue reading at link.springer.com (PDF) (other versions)

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/141Discrete Fourier transforms
    • G06F17/142Fast Fourier transforms, e.g. using a Cooley-Tukey type algorithm
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724Finite field arithmetic
    • G06F7/726Inversion; Reciprocal calculation; Division of elements of a finite field

Similar Documents

Publication Publication Date Title
Nakashima et al. Polyhedral realizations of crystal bases for quantized Kac-Moody algebras
DeVille Consensus on simplicial complexes: Results on stability and synchronization
Budaghyan et al. New commutative semifields defined by new PN multinomials
Etingof Representation theory in complex rank, I
Giaquinto et al. Quantum Weyl algebras
Mukhin et al. Extended T-systems
Harman Stability and periodicity in the modular representation theory of symmetric groups
Mariot et al. Computing the periods of preimages in surjective cellular automata
Jacon Crystal graphs of irreducible-modules of level two and Uglov bipartitions
Roettger et al. Some primality tests that eluded Lucas
Gesmundo et al. Matrix product states and the quantum max-flow/min-cut conjectures
Mathew Categories parametrized by schemes and representation theory in complex rank
Jacon et al. Crystal isomorphisms for irreducible highest weight-modules of higher level
Liu et al. Optimal p-ary cyclic codes with two zeros
Di Francesco et al. Discrete non-commutative integrability: proof of a conjecture by M. Kontsevich
Geck et al. Canonical basic sets in type Bn
Birget Monoid generalizations of the Richard Thompson groups
Greenfeld Gaps and approximations in the space of growth functions
Turner Affine Springer Fibers and Generalized Haiman Ideals (with an Appendix by Eugene Gorsky and Joshua P. Turner)
Mahdavi-Hezavehi et al. Division algebras with radicable multiplicative groups
Benkart et al. Yetter–Drinfeld modules under cocycle twists
Zeraatpisheh et al. Quasi-cyclic codes: algebraic properties and applications
Bisbo et al. Bases for infinite dimensional simple osp (1| 2n)-modules respecting the branching osp (1| 2n)⊃ gl (n)
D’Anna Ring and semigroup constructions
Shin Crystal bases and monomials for U q (G 2)-modules