A bijective proof of the Jacobi identity and reconstruction of Young diagrams

1988 ◽  
Vol 41 (2) ◽  
pp. 889-891 ◽  
Author(s):  
A. M. Vershik
Keyword(s):  
Jacobi Identity ◽  
Young Diagrams ◽  
Bijective Proof

scholarly journals LAURENT POLYNOMIAL LANDAU–GINZBURG MODELS FOR COMINUSCULE HOMOGENEOUS SPACES

2021 ◽  
Author(s):  
PETER SPACEK
Keyword(s):  
Homogeneous Space ◽  
Homogeneous Spaces ◽  
Laurent Polynomial ◽  
Complete Intersections ◽  
Laurent Polynomials ◽  
Young Diagrams ◽  
Similar Shape ◽  
Algebraic Torus ◽  
The One ◽  
Polynomial Potentials

AbstractIn this article we construct Laurent polynomial Landau–Ginzburg models for cominuscule homogeneous spaces. These Laurent polynomial potentials are defined on a particular algebraic torus inside the Lie-theoretic mirror model constructed for arbitrary homogeneous spaces in [Rie08]. The Laurent polynomial takes a similar shape to the one given in [Giv96] for projective complete intersections, i.e., it is the sum of the toric coordinates plus a quantum term. We also give a general enumeration method for the summands in the quantum term of the potential in terms of the quiver introduced in [CMP08], associated to the Langlands dual homogeneous space. This enumeration method generalizes the use of Young diagrams for Grassmannians and Lagrangian Grassmannians and can be defined type-independently. The obtained Laurent polynomials coincide with the results obtained so far in [PRW16] and [PR13] for quadrics and Lagrangian Grassmannians. We also obtain new Laurent polynomial Landau–Ginzburg models for orthogonal Grassmannians, the Cayley plane and the Freudenthal variety.

scholarly journals Seven-modular lattices and a septic base Jacobi identity

2003 ◽  
Vol 99 (2) ◽  
pp. 361-372 ◽  
Author(s):  
Heng Huat Chan ◽  
Kok Seng Chua ◽  
Patrick Solé
Keyword(s):  
Jacobi Identity ◽  
Modular Lattices

A bijective proof of a q-analogue of the sum of cubes using overpartitions

2017 ◽  
Vol 10 (3) ◽  
pp. 523-530
Author(s):  
Jacob Forster ◽  
Kristina Garrett ◽  
Luke Jacobsen ◽  
Adam Wood
Keyword(s):  
Bijective Proof

scholarly journals Nambu–Poisson bracket on superspace

2018 ◽  
Vol 15 (11) ◽  
pp. 1850190 ◽  
Author(s):  
Viktor Abramov
Keyword(s):  
Poisson Bracket ◽  
Jacobi Identity ◽  
Leibniz Rule ◽  
Smooth Functions ◽  
Poisson Algebras ◽  
Fundamental Identity ◽  
Odd Degree ◽  
New Formula ◽  
Usual Formula

We propose an extension of [Formula: see text]-ary Nambu–Poisson bracket to superspace [Formula: see text] and construct by means of superdeterminant a family of Nambu–Poisson algebras of even degree functions, where the parameter of this family is an invertible transformation of Grassmann coordinates in superspace [Formula: see text]. We prove in the case of the superspaces [Formula: see text] and [Formula: see text] that our [Formula: see text]-ary bracket, defined with the help of superdeterminant, satisfies the conditions for [Formula: see text]-ary Nambu–Poisson bracket, i.e. it is totally skew-symmetric and it satisfies the Leibniz rule and the Filippov–Jacobi identity (fundamental identity). We study the structure of [Formula: see text]-ary bracket defined with the help of superdeterminant in the case of superspace [Formula: see text] and show that it is the sum of usual [Formula: see text]-ary Nambu–Poisson bracket and a new [Formula: see text]-ary bracket, which we call [Formula: see text]-bracket, where [Formula: see text] is the product of two odd degree smooth functions.

scholarly journals A direct bijective proof of the hook-length formula

1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii
Keyword(s):  
Young Tableaux ◽  
Hook Length ◽  
Bijective Proof ◽  
International Audience ◽  
Standard Young Tableaux

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.

scholarly journals Search for Young diagrams with large dimensions

2019 ◽  
pp. 33-43
Author(s):  
Vasilii S. Duzhin ◽  
◽  
Anastasia A. Chudnovskaya ◽  
Keyword(s):  
Symmetric Group ◽  
Young Diagram ◽  
Numerical Experiments ◽  
Irreducible Representations ◽  
Young Diagrams ◽  
Maximum Dimension ◽  
Asymptotic Combinatorics

Search for Young diagrams with maximum dimensions or, equivalently, search for irreducible representations of the symmetric group $S(n)$ with maximum dimensions is an important problem of asymptotic combinatorics. In this paper, we propose algorithms that transform a Young diagram into another one of the same size but with a larger dimension. As a result of massive numerical experiments, the sequence of $10^6$ Young diagrams with large dimensions was constructed. Furthermore, the proposed algorithms do not change the first 1000 elements of this sequence. This may indicate that most of them have the maximum dimension. It has been found that the dimensions of all Young diagrams of the resulting sequence starting from the 75778th exceed the dimensions of corresponding diagrams of the greedy Plancherel sequence.

Sign in / Sign up

Export Citation Format

Share Document