Related papers: Vertices of FFLV polytopes
We characterise the symplectic Weyl group elements such that the FFLV basis is compatible with the PBW filtration on symplectic Demazure modules, extending type A results by the second author. Surprisingly, the number of such elements…
Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric. We determine dimensions of these polytopes and classify their…
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
The monotone path polytope of a polytope $P$ encapsulates the combinatorial behavior of the shadow vertex rule (a pivot rule used in linear programming) on $P$. Computing monotone path polytopes is the entry door to the larger subject of…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…
We define a GL-variety to be a (typically infinite dimensional) algebraic variety equipped with an action of the infinite general linear group under which the coordinate ring forms a polynomial representation. Such varieties have been used…
Let $V$ be a braided vector space of diagonal type. Let $\mathfrak B(V)$, $\mathfrak L^-(V)$ and $\mathfrak L(V)$ be the Nichols algebra, Nichols Lie algebra and Nichols braided Lie algebra over $V$, respectively. We show that a monomial…
For classical groups SL(n), SO(n) and Sp(2n), we define uniformly geometric valuations on the corresponding complete flag varieties. The valuation in every type comes from a natural coordinate system on the open Schubert cell and is…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
We present exact computations of partition functions of singlet vector models (infinite level Chern-Simons-matter theories) on lens spaces L(p, 1). We identify light topological configurations and their spectra, and we comment on the…
The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…
Mirkovic and Vilonen discovered a canonical basis of algebraic cycles for the intersection homology of (the closures of the strata of) the loop Grassmannian. The moment map images of these varieties are a collection of polytopes, and they…
A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…
This article aims to study the class of strongly self-dual polytopes (ssd-polytopes for short), defined in a paper by Lov\'asz \cite{lovasz}. He described a series of such polytopes (called $L$-type polytopes), which he used to solve a…
We review and motivate recently-observed relationships between exactly solvable lattice models and modular representations of Hecke algebras. Firstly, we describe how the set of $n$-regular partitions label both of the following classes of…
The degree partition of a simple graph is its degree sequence rearranged in weakly decreasing order. The polytope of degree partitions (respectively, degree sequences) is the convex hull of all degree partitions (respectively, degree…
Let Sp_V(F) be the group of isometries of a symplectic vector space V over a finite field F of odd cardinality. The group Sp_V(F) possesses distinguished representations--- the Weil representations. We know that they are compatible with…