scholarly journals Sign matrix polytopes from Young tableaux

2019 ◽  
Vol 574 ◽  
pp. 84-122 ◽  
Author(s):  
Sara Solhjem ◽  
Jessica Striker
Keyword(s):  
2021 ◽  
Vol 2021 (3) ◽  
Author(s):  
Nicolas Boulanger ◽  
Victor Lekeu

Abstract At the free level, a given massless field can be described by an infinite number of different potentials related to each other by dualities. In terms of Young tableaux, dualities replace any number of columns of height hi by columns of height D − 2 − hi, where D is the spacetime dimension: in particular, applying this operation to empty columns gives rise to potentials containing an arbitrary number of groups of D − 2 extra antisymmetric indices. Using the method of parent actions, action principles including these potentials, but also extra fields, can be derived from the usual ones. In this paper, we revisit this off-shell duality and clarify the counting of degrees of freedom and the role of the extra fields. Among others, we consider the examples of the double dual graviton in D = 5 and two cases, one topological and one dynamical, of exotic dualities leading to spin three fields in D = 3.


2021 ◽  
Vol 344 (7) ◽  
pp. 112395
Author(s):  
Rosena R.X. Du ◽  
Jingni Yu

2003 ◽  
Vol 36 (12) ◽  
pp. 3033-3048 ◽  
Author(s):  
Kazuhiro Hikami ◽  
Takashi Imamura

1977 ◽  
Vol 26 (3) ◽  
pp. 275-289 ◽  
Author(s):  
Glânffrwd P Thomas
Keyword(s):  

1983 ◽  
Vol 16 (12) ◽  
pp. 2609-2614 ◽  
Author(s):  
G Girardi ◽  
A Sciarrino ◽  
P Sorba

10.37236/1030 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Sarah Iveson

In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain subvarieties, called Hessenberg varieties, of flag varieties. We give answers and partial answers to some conjectures posed by Tymoczko. In particular, we find the number of components of these varieties, give an upper bound on the dimensions of the varieties, and give an exact expression for the dimension in some special cases. The proofs given are all combinatorial.


1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii

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.


10.37236/9168 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Jennifer Morse ◽  
Jianping Pan ◽  
Wencin Poh ◽  
Anne Schilling

We introduce a type $A$ crystal structure on decreasing factorizations of fully-commu\-tative elements in the 0-Hecke monoid which we call $\star$-crystal. This crystal is a $K$-theoretic generalization of the crystal on decreasing factorizations in the symmetric group of the first and last author. We prove that under the residue map the $\star$-crystal intertwines with the crystal on set-valued tableaux recently introduced by Monical, Pechenik and Scrimshaw. We also define a new insertion from decreasing factorization to pairs of semistandard Young tableaux and prove several properties, such as its relation to the Hecke insertion and the uncrowding algorithm. The new insertion also intertwines with the crystal operators.


10.37236/305 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Patricia Hersh ◽  
Cristian Lenart

This work is part of a project on weight bases for the irreducible representations of semisimple Lie algebras with respect to which the representation matrices of the Chevalley generators are given by explicit formulas. In the case of $\mathfrak{ sl}$$_n$, the celebrated Gelfand-Tsetlin basis is the only such basis known. Using the setup of supporting graphs developed by Donnelly, we present a new interpretation and a simple combinatorial proof of the Gelfand-Tsetlin formulas based on a rational function identity (all the known proofs use more sophisticated algebraic tools). A constructive approach to the Gelfand-Tsetlin formulas is then given, based on a simple algorithm for solving certain equations on the lattice of semistandard Young tableaux. This algorithm also implies certain extremal properties of the Gelfand-Tsetlin basis.


Sign in / Sign up

Export Citation Format

Share Document