English
Related papers

Related papers: Ideal Polytopes for Representations of $GL_n(\math…

200 papers

An ideal filling is a combinatorial object introduced by Judd that amounts to expressing a dominant weight $\lambda$ of $SL_n$ as a rational sum of the positive roots in a canonical way, such that the coefficients satisfy a $\max$ relation.…

Representation Theory · Mathematics 2024-11-08 Teresa Lüdenbach

In this paper we investigate the idea of a tropical critical point of the superpotential for the full flag variety of type A. Recall that associated to an irreducible representation of G=SLn(C) are various polytopes whose integral points…

Algebraic Geometry · Mathematics 2017-08-10 Jamie Judd

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Discrete Mathematics · Computer Science 2018-04-26 David Avis , David Bremner , Hans Raj Tiwary , Osamu Watanabe

Let $G$ be a semisimple algebraic group over $\mathbb{C}$. For a reduced word $\bf i$ of the longest element in the Weyl group of $G$ and a dominant integral weight $\lambda$, one can construct the string polytope $\Delta_{\bf i}(\lambda)$,…

Algebraic Geometry · Mathematics 2020-08-06 Yunhyung Cho , Yoosik Kim , Eunjeong Lee , Kyeong-Dong Park

Let $K$ be a connected compact semisimple group and $V_\lambda$ be an irreducible unitary representation with highest weight $\lambda$. We study the momentum map $\mu:\mathbb P(V_\lambda)\to\mathfrak k^*$. The intersection $\mu(\mathbb…

Representation Theory · Mathematics 2015-04-29 Elitza Hristova , Tomasz Maciazek , Valdemar V. Tsanov

We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…

Numerical Analysis · Mathematics 2021-07-07 Thomas Mejstrik , Vladimir Yu. Protasov

Let $S = \mathbb{C}[x_{i,j}]$ be the ring of polynomial functions on the space of $m \times n$ matrices, and consider the action of the group $\mathbf{GL} = \mathbf{GL}_m \times \mathbf{GL}_n$ via row and column operations on the matrix…

Commutative Algebra · Mathematics 2020-08-07 Hang Huang

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G) \subset S$ the edge ideal of a finite graph $G$ on $n$ vertices. Given a vector $\mathfrak{c}\in\mathbb{N}^n$ and an integer $q\geq 1$, we…

Commutative Algebra · Mathematics 2025-10-14 Takayuki Hibi , Seyed Amin Seyed Fakhari

Call a Laurent polynomial $W$ `complete' if its Newton polytope is full-dimensional with zero in its interior. We show that if $W$ is any complete Laurent polynomial with coefficients in the positive part of the field $K$ of generalised…

Algebraic Geometry · Mathematics 2025-10-03 Jamie Judd , Konstanze Rietsch

We prove that for every complex classical group $G$ the string polytope associated to a special reduced decomposition and any dominant integral weight $\lambda$ will be a lattice polytope if and only if the highest weight representation of…

Representation Theory · Mathematics 2020-11-25 Christian Steinert

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers $V_{\lambda}^{\otimes N}$ of an irreducible representation $V_{\lambda}$ of a compact connected Lie group $G$. The weights are…

Representation Theory · Mathematics 2011-11-10 Tatsuya Tate , Steve Zelditch

For any root system of rank $r$, we study the "dominant weight polytope" $P^\lambda$ associated with a strongly dominant weight $\lambda$. We prove that $P^\lambda$ is combinatorially equivalent to the $r$-dimensional cube. As an…

Representation Theory · Mathematics 2024-05-07 Gaston Burrull , Tao Gui , Hongsheng Hu

Formulas for the product of an irreducible character $\chi_\lambda$ of a complex Lie group and a deformation of the Weyl denominator as a sum over the crystal $\mathcal{B}(\lambda+\rho)$ go back to Tokuyama. We study the geometry underlying…

Representation Theory · Mathematics 2019-05-31 Spencer Leslie

The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…

Representation Theory · Mathematics 2015-06-17 Mark A. Walton

Let $\mathscr{K}(G)$ be the rational cone generated by pairs $(\lambda, \mu)$ where $\lambda$ and $\mu$ are dominant integral weights and $\mu$ is a nontrivial weight space in the representation $V_{\lambda}$ of $G$. We produce all extremal…

Representation Theory · Mathematics 2021-01-22 Marc Besson , Sam Jeralds , Joshua Kiers

In this paper we study general highest weight modules $\mathbb{V}^\lambda$ over a complex finite-dimensional semisimple Lie algebra $\mathfrak{g}$. We present three formulas for the set of weights of a large family of modules…

Representation Theory · Mathematics 2016-03-02 Apoorva Khare

When $G$ is a complex reductive algebraic group, MV polytopes are in bijection with the non-negative tropical points of the unipotent group of $G$. By fixing $w$ from the Weyl group, we can define MV polytopes whose highest vertex is…

Combinatorics · Mathematics 2023-01-26 Kathlyn Dykes

Spherically symmetric equilibrium configurations of perfect fluid obeying a polytropic equation of state are studied in spacetimes with a repulsive cosmological constant. The configurations are specified in terms of three parameters---the…

General Relativity and Quantum Cosmology · Physics 2016-11-17 Zdeněk Stuchlík , Stanislav Hledík , Jan Novotný

Let $\lambda$ be a dominant weight of a finite dimensional simple Lie algebra and $W$ the Weyl group. The convex hull of $W\lambda$ is defined as the weight polytope of $\lambda$. We provide a new proof that there is a natural bijection…

Representation Theory · Mathematics 2015-04-13 Zhuo Li , You'an Cao , Zhenheng Li

The Maximum Weight Independent Set of Polygons problem is a fundamental problem in computational geometry. Given a set of weighted polygons in the 2-dimensional plane, the goal is to find a set of pairwise non-overlapping polygons with…

Data Structures and Algorithms · Computer Science 2013-07-17 Anna Adamaszek , Andreas Wiese
‹ Prev 1 2 3 10 Next ›