Related papers: A polytope combinatorics for semisimple groups
This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
A real form $G_0$ of a complex semisimple Lie group $G$ has only finitely many orbits in any given compact $G$-homogeneous projective algebraic manifold $Z=G/Q$. A maximal compact subgroup $K_0$ of $G_0$ has special orbits $C$ which are…
In this work we discuss some appearances of semi-infinite combinatorics in representation theory. We propose a semi-infinite moment graph theory and we motivate it by considering the (not yet rigorously defined) geometric side of the story.…
A level graph is the data of a pair $(G,\pi)$ consisting of a finite graph $G$ and an ordered partition $\pi$ on the set of vertices of $G$. To each level graph on $n$ vertices we associate a polytope in $\mathbb R^n$ called its residue…
Two representations of a reductive group G are spectrally equivalent if the same irreducible representations appear in both of them. The semigroup of finite dimensional representations of G with tensor product and up to spectral equivalence…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…
We classify all momentum polytopes of rank one for multiplicity free quasi-Hamiltonian $K$-manifolds for simple and simply connected Lie groups $K$ by using the methods developed in a recent paper by F. Knop. This leads to lots of new…
We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…
A natural way of generalising Hamiltonian toric manifolds is to permit the presence of generic isolated singularities for the moment map. For a class of such ``almost-toric 4-manifolds'' which admits a Hamiltonian $S^1$-action we show that…
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…
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…
We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by…
We classify all harmonic maps with finite uniton number from a Riemann surface into an arbitrary compact simple Lie group $G$, whether $G$ has trivial centre or not, in terms of certain pieces of the Bruhat decomposition of the group…
We introduce so-called cone topologies of paratopological groups, which are a wide way to construct counterexamples, especially of examples of compact-like paratopological groups with discontinuous inversion. We found a simple interplay…
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the…
We introduce a new multiplication for the polytope algebra, defined via the intersection of polytopes. After establishing the foundational properties of this intersection product, we investigate finite-dimensional subalgebras that arise…