Related papers: Face-subgroups of permutation polytopes

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

Let $G$ be a complex reductive group and $H=G^{\theta}$ be its fixed point subgroup under a Galois involution $\theta$. We show that any $H$-distinguished representation $\pi$ (i.e $\mathrm{dim}_{\mathbb{C}}\left(\pi^{*}\right)^{H}\neq0$)…

Neighborly cubical polytopes are known as the cubical analogues of the cyclic polytopes. Using the short cubical $h$-vectors of cubical polytopes (introduced by Adin), we derive an explicit formula for the face numbers of the neighborly…

Let $H$ be a subgroup of a group $G$. The permutizer $P_G(H)$ is the subgroup generated by all cyclic subgroups of $G$ which permute with $H$. A subgroup $H$ of a group $G$ is strongly permutable in $G$ if $P_U(H)=U$ for every subgroup $U$…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

We consider the problem of constructing an abstract $(n+1)$-polytope $Q$ with $k$ facets isomorphic to a given $n$-polytope $P$, where $k \geq 3$. In particular, we consider the case where we want $Q$ to be $(n-2,n)$-flat, meaning that…

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.

Let P be a random $d$-dimensional 0/1-polytope with $n(d)$ vertices, and denote by $\phi_k(P)$ the \emph{$k$-face density} of $P$, i.e., the quotient of the number of $k$-dimensional faces of $P$ and $\binom{n(d)}{k+1}$. For each $k\ge 2$,…

In this paper we study a new combinatorial invariant of simple polytopes, which comes from toric topology. With each simple n-polytope P with m facets we can associate a moment-angle complex Z_P with a canonical action of the torus T^m.…

We introduce topological notions of polytopes and simplexes, the latter being expected to play in p-adically closed fields the role played by real simplexes in the classical results of triangulation of semi-algebraic sets over real closed…

For $G = \mathrm{GL}_2, \mathrm{SL}_2, \mathrm{PGL}_2$ we compute the intersection E-polynomials and the intersection Poincar\'e polynomials of the $G$-character variety of a compact Riemann surface $C$ and of the moduli space of $G$-Higgs…

Let $P$ be a cubic $3$-connected bipartite plane graph which has a $2$-factor which consists only of facial $4$-cycles, and suppose that $P^{*}$ is the dual graph. We show that $P$ has at least $3^{\frac{2|P^{*}|}{\Delta^{2}{(P^{*})}}}$…

We introduce the set of framed convex polyhedra with N faces as the symplectic quotient C^2N//SU(2). A framed polyhedron is then parametrized by N spinors living in C^2 satisfying suitable closure constraints and defines a usual convex…

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

The paper is motivated by the study of graded representations of Takiff algebras, cominuscule parabolics, and their generalizations. We study certain special subsets of the set of weights (and of their convex hull) of the generalized Verma…

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

Several recent papers have examined a rational polyhedron $P_m$ whose integer points are in bijection with the numerical semigroups (cofinite, additively closed subsets of the non-negative integers) containing $m$. A combinatorial…

Let $p$ be a prime number, $G$ be a $p$-solvable finite group and $P$ be a Sylow $p$-subgroup of $G$. We prove that $G$ is $p$-supersolvable if $N_G(P)$ is $p$-supersolvable and if there is a subgroup $H$ of $P$ with $P' \le H \le \Phi(P)$…