English
Related papers

Related papers: Cyclopermutohedron

200 papers

Every commutator preserving bijection of the unipotent radical $Up(2n, R)$ of the Borel subgroup of the classical symplectic group of rank at least 4 over a field $F$ such that $6F=F$ is shown to be the composition of a standard…

Group Theory · Mathematics 2018-01-17 Alexander Shchegolev

The symmetric group $\mathsf{S}_n$ and the partition algebra $\mathsf{P}_k(n)$ centralize one another in their actions on the $k$-fold tensor power $\mathsf{M}_n^{\otimes k}$ of the $n$-dimensional permutation module $\mathsf{M}_n$ of…

Representation Theory · Mathematics 2017-09-25 Georgia Benkart , Tom Halverson

We describe the cone of deformations of a Coxeter permutahedron, or equivalently, the nef cone of the toric variety associated to a Coxeter complex. This family of polytopes contains polyhedral models for the Coxeter-theoretic analogs of…

Combinatorics · Mathematics 2020-03-03 Federico Ardila , Federico Castillo , Christopher Eur , Alexander Postnikov

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

Symbolic Computation · Computer Science 2022-06-13 Thi Xuan Vu

This article describes a natural piecewise Euclidean bi-simplicial cell structure for the space of $n$-element multisets in a fixed Euclidean rectangle. In particular, we highlight some connections with spaces of complex polynomials and…

Combinatorics · Mathematics 2026-04-17 Michael Dougherty , Jon McCammond

The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Rahul Shah , Xuancheng Shao , Ezra Winston

The amplituhedron is a semialgebraic set in the Grassmannian. We study convexity and duality of amplituhedra. We introduce a notion of convexity, called \textit{extendable convexity}, for real semialgebraic sets in any embedded projective…

Combinatorics · Mathematics 2025-07-25 Elia Mazzucchelli , Elizabeth Pratt

We construct combinatorial analogs of 2d higher topological quantum field theories. We consider triangulations as vertices of a certain CW complex $\Xi$. In the "flip theory," cells of $\Xi_\mathrm{flip}$ correspond to polygonal…

Mathematical Physics · Physics 2024-03-27 Justin Beck , Andrey Losev , Pavel Mnev

An n-dimensional polytope P^n is called simple if exactly n codimension-one faces meet at each vertex. The lattice of faces of a simple polytope P^n with m codimension-one faces defines an arrangement of even-dimensional planes in R^{2m}.…

Algebraic Topology · Mathematics 2007-05-23 Victor M. Buchstaber , Taras E. Panov

We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…

Combinatorics · Mathematics 2008-06-14 Yuri Faenza , Volker Kaibel

For every quiver (valued) of finite representation type we define a finitely presented group called a picture group. This group is very closely related to the cluster theory of the quiver. For example, positive expressions for the Coxeter…

Representation Theory · Mathematics 2016-09-12 Kiyoshi Igusa , Gordana Todorov , Jerzy Weyman

Heffter arrays are combinatorial structures used to construct orthogonal cyclic cycle decompositions and biembeddings of complete graphs onto surfaces. A Heffter array $H(m,n;h,k)$ is an $m \times n$ partially filled array with distinct…

Combinatorics · Mathematics 2026-04-23 Erik Pelttari , Selda Kücükçifçi , E. Şule Yazıcı

A family of homothets of an o-symmetric convex body K in d-dimensional Euclidean space is called a Minkowski arrangement if no homothet contains the center of any other homothet in its interior. We show that any pairwise intersecting…

Metric Geometry · Mathematics 2020-02-25 Márton Naszódi , Konrad J. Swanepoel

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

For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested…

We use the differential algebra of polytopes to explain the known remarkable relation of the combinatorics of the associahedra and permutohedra with the universal compositional and multiplicative inversion formulas for the formal power…

Combinatorics · Mathematics 2025-02-11 V. M. Buchstaber , A. P. Veselov

An assosiahedron $\mathcal{K}^n$, known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points in $\mathbf{R}^{n}$, forming $(n-1)$-dimensional polytope. A…

Combinatorics · Mathematics 2011-03-31 Kira Adaricheva

Given an oriented surface of positive genus with finitely many punctures, we classify the finite orbits of the mapping class group action on the moduli space of semisimple complex special linear two dimensional representations of the…

Geometric Topology · Mathematics 2022-06-29 Indranil Biswas , Subhojoy Gupta , Mahan Mj , Junho Peter Whang

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…

Combinatorics · Mathematics 2021-11-08 Hiroyuki Miyata

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

Logic in Computer Science · Computer Science 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub