English
Related papers

Related papers: On the f-vectors of Gelfand-Cetlin polytopes

200 papers

This paper is a study of the polyhedral geometry of Gelfand-Tsetlin patterns arising in the representation theory $\mathfrak{gl}_n \C$ and algebraic combinatorics. We present a combinatorial characterization of the vertices and a method to…

Combinatorics · Mathematics 2007-05-23 Jesús A. De Loera , Tyrrell B. McAllister

We discuss the problem of counting vertices in Gelfand-Zetlin polytopes. Namely, we deduce a partial differential equation with constant coefficients on the exponential generating function for these numbers. For some particular classes of…

Combinatorics · Mathematics 2014-06-06 Pavel Gusev , Valentina Kiritchenko , Vladlen Timorin

We obtain a recurrence relation for the f-polynomial of Gelfand-Zetlin polytopes by analyzing geometric properties of a linear projection of the Gelfand-Zetlin polytope onto a cube. We apply this recurrence relation to find explicit…

Combinatorics · Mathematics 2025-07-21 Ekaterina V. Melikhova

A Gelfand-Cetlin system is a completely integrable system defined on a partial flag manifold whose image is a rational convex polytope called a Gelfand-Cetlin polytope. Motivated by the study of Nishinou-Nohara-Ueda on the Floer theory of…

Symplectic Geometry · Mathematics 2019-11-12 Yunhyung Cho , Yoosik Kim , Yong-Geun Oh

Gelfand-Tsetlin polytopes are prominent objects in algebraic combinatorics. The number of integer points of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ is equal to the dimension of the corresponding irreducible representation of…

Combinatorics · Mathematics 2019-03-21 Ricky Ini Liu , Karola Mészáros , Avery St. Dizier

The $f$-vector of a polytope consists of the numbers of its $i$-dimensional faces. An open field of study is the characterization of all possible $f$-vectors. It has been solved in three dimensions by Steinitz in the early 19th century. We…

Metric Geometry · Mathematics 2020-02-21 Maren H. Ring , Robert Schüler

A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…

Combinatorics · Mathematics 2018-08-13 Takuya Kusunoki , Satoshi Murai

A cosmological polytope is a lattice polytope introduced by Arkani-Hamed, Benincasa, and Postnikov in their study of the wavefunction of the universe in a class of cosmological models. More concretely, they construct a cosmological polytope…

Combinatorics · Mathematics 2025-05-21 Lukas Kühne , Leonid Monin

In this paper, we present a new method for computing the f-vector of a marked order polytope. Namely, given an arbitrary (polyhedral) subdivision of an arbitrary convex polytope, we construct a cochain complex (over the two-element field…

Combinatorics · Mathematics 2025-07-21 Ekaterina V. Melikhova

In this paper, we study the Gelfand--Cetlin systems and polytopes of the co-adjoint $\mathrm{SO}(n)$-orbits. We describe the face structure of Gelfand--Cetlin polytopes and iterated bundle structure of Gelfand--Cetlin fibers in terms of…

Symplectic Geometry · Mathematics 2019-09-16 Yunhyung Cho , Yoosik Kim

Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…

Metric Geometry · Mathematics 2020-01-28 Hannah Sjöberg , Günter M. Ziegler

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…

Combinatorics · Mathematics 2009-02-14 Komei Fukuda , Christophe Weibel

I construct a correspondence between the Schubert cycles on the variety of complete flags in C^n and some faces of the Gelfand-Zetlin polytope associated with the irreducible representation of SL_n(C) with a strictly dominant highest…

Algebraic Geometry · Mathematics 2010-01-21 Valentina Kiritchenko

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

Combinatorics · Mathematics 2025-12-23 Phablo F. S. Moura , Hande Yaman , Roel Leus

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

Relation Gelfand-Tsetlin $\mathfrak{gl}_n$-modules were introduced in [FRZ19], and are determined by some special directed graphs and Gelfand-Tsetlin characters. In this work we constructed polyhedra associated with the class of relation…

Representation Theory · Mathematics 2021-07-15 Germán Benitez , Luis Enrique Ramírez

Interior and exterior angle vectors of polytopes capture curvature information at faces of all dimensions and can be seen as metric variants of $f$-vectors. In this context, Gram's relation takes the place of the Euler--Poincar\'e relation…

Combinatorics · Mathematics 2024-09-30 Spencer Backman , Sebastian Manecke , Raman Sanyal

We construct a finite dimensional representation of the face type, i.e dynamical, elliptic quantum group associated with $sl_N$ on the Gelfand-Tsetlin basis of the tensor product of the $n$-vector representations. The result is described in…

Quantum Algebra · Mathematics 2018-06-19 Hitoshi Konno

In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many…

Metric Geometry · Mathematics 2007-05-23 Günter M. Ziegler

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Combinatorics · Mathematics 2009-08-13 Sandeep Koranne , Anand Kulkarni
‹ Prev 1 2 3 10 Next ›