Related papers: A diagrammatic approach to string polytopes
Let $W$ be a vector space over an algebraically closed field $k$. Let $H$ be a quasisimple group of Lie type of characteristic $p\ne {\rm char}(k)$ acting irreducibly on $W$. Suppose also that $G$ is a classical group with natural module…
Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…
We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…
Let $\mathfrak{g}$ be a semisimple Lie algebra over $\mathbb{C}$ having rank $l$ and let $V=L(\lambda)$ be an irreducible finite-dimensional $\mathfrak{g}$-module having highest weight $\lambda.$ Computations of weight multiplicities in…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
Following the work of Venkatesh (arXiv:2203.03158), we study further the categories of representations of the general linear groups $GL(X)$ in the Verlinde category $Ver_p$ in characteristic $p$. The main question we answer is how to…
The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…
The essential feature of a root-graded Lie algebra L is the existence of a split semisimple subalgebra g with respect to which L is an integrable module with weights in a possibly non-reduced root system S of the same rank as the root…
Let $G$ be a simple algebraic group of adjoint type over the field $\mathbb{C}$ of complex numbers. Let $B$ be a Borel subgroup of $G$ containing a maximal torus $T$ of $G$. Let $w$ be an element of the Weyl group $W$ and let $X(w)$ be the…
We introduce the concept of a prime band in a string algebra $\Lambda$ and use it to associate to $\Lambda$ its finite bridge quiver. Then we introduce a new technique of `recursive systems' for showing that a graph map between finite…
We determine explicitly the maximal dominant weights for the integrable highest weight $\hat{sl}(n)$-modules $V((k-1)\Lambda_0 + \Lambda_s)$, $0 \leq s \leq n-1$, $ k \geq 2$. We give a conjecture for the number of maximal dominant weights…
Let $\Gamma$ be a lattice in a connected semisimple Lie group $G$ with trivial center and no compact factors. We introduce a volume invariant for representations of $\Gamma$ into $G$, which generalizes the volume invariant for…
We show that the number of conjugacy classes of maximal finite subgroups of a lattice in a semisimple Lie group is linearly bounded by the covolume of the lattice. Moreover, for higher rank groups, we show that this number grows sublinearly…
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be…
We give a generalisation of the Lenstra-Lenstra-Lov\'asz (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group $G$. This can be regarded as `lattice reduction with symmetries'. We make this…
Let $G$ be a reductive algebraic group over a $p$-adic field or number field $K$, and let $V$ be a $K$-linear faithful representation of $G$. A lattice $\Lambda$ in the vector space $V$ defines a model $\hat{G}_{\Lambda}$ of $G$ over…
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…
The cut polytope of a graph is an important object in several fields, such as functional analysis, combinatorial optimization, and probability. For example, Sturmfels and Sullivant showed that the toric ideals of cut polytopes are useful in…
To any non-negatively graded dg Lie algebra $g$ over a field $k$ of characteristic zero we assign a functor $\Sigma_g: art/k \to Kan$ from the category of commutative local artinian $k$-algebras with the residue field $k$ to the category of…
If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…