English
Related papers

Related papers: Sparse groups need not be semisparse

200 papers

Herzog and Sch\"onheim conjectured that any nontrivial partition of a group into cosets must contain two cosets with the same index.

Combinatorics · Mathematics 2019-03-04 Michael C. Burkhart

For any graded poset $P$, we define a new graded poset, $\mathcal E(P)$, whose elements are the edges in the Hasse diagram of P. For any group, $G$, acting on the boolean algebra, $B_n$, we conjecture that $\mathcal E(B_n/G)$ is Peck. We…

Combinatorics · Mathematics 2017-12-12 David Hemminger , Aaron Landesman , Zijian Yao

We define strict C(n) small-cancellation complexes, intermediate to C(n) and C(n+1), and we prove groups acting properly cocompactly on a simply-connected strict C(6) complex are hyperbolic relative to a collection of maximal virtually free…

Group Theory · Mathematics 2025-05-28 Zachary Munro , Daniel T. Wise

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in…

Combinatorics · Mathematics 2021-09-08 Matthew Kwan , Benny Sudakov

There are many deep results on the structure of REGULAR probability measures $P(G)$ on compact/locally compact, Hausdorff topological groups G. See, for instance, the classic monographs by KR Parthasarathy, Ulf Grenander, A.Mukherjea and…

Functional Analysis · Mathematics 2022-05-24 M. N. N. Namboodiri

Let $X$ be a smooth irreducible quasi-projective algebraic variety over a number field $K$. Suppose $X$ is equipped with a $p$-adic \'{e}tale local system compatible with an admissible graded-polarized variation of mixed Hodge structures on…

Number Theory · Mathematics 2025-08-15 Kenneth Chung Tak Chiu

An $N$-free poset is a poset whose comparability graph does not embed an induced path with four vertices. We use the well-quasi-order property of the class of countable $N$-free posets and some labelled ordered trees to show that a…

Combinatorics · Mathematics 2023-01-09 Davoud Abdi

Let $G$ be a simple algebraic group over $\mathbb C$, $B$ a fixed Borel subgroup, $P$ a parabolic subgroup, $P'$ its derived group acting on the Lie algebra $\mathfrak m$ of its nilradical. The nilfibre $\mathscr N$ is the zero locus of the…

Representation Theory · Mathematics 2026-04-21 Yasmine Fittouhi , Anthony Joseph

Maniplexes are coloured graphs that generalise maps on surfaces and abstract polytopes. Each maniplex uniquely defines a partially ordered set that encodes information about its structure. When this poset is an abstract polytope, we say…

Combinatorics · Mathematics 2023-05-11 Dimitri Leemans , Micael Toledo

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…

Group Theory · Mathematics 2025-06-24 Guy Salomon , Yotam Svoray , Ariel Yadin

We discuss one construction of nonstandard subgroups in the category of Coxeter groups. Two formulae for the growth series of such a subgroups are given. As an application we construct a flag simple convex polytope, whose f-polynomial has…

Group Theory · Mathematics 2010-05-13 Swiatoslaw R. Gal

Let G be a finite abelian group. This paper is concerned with nonnegative functions on G that are sparse with respect to the Fourier basis. We establish combinatorial conditions on subsets S and T of Fourier basis elements under which…

Optimization and Control · Mathematics 2016-11-30 Hamza Fawzi , James Saunderson , Pablo A. Parrilo

A group is SimpHAtic if it acts geometrically on a simply connected simplicially hereditarily aspherical (SimpHAtic) complex. We show that finitely presented normal subgroups of the SimpHAtic groups are either: finite, or of finite index,…

Group Theory · Mathematics 2021-09-29 Damian Osajda

We prove that if S is a commutative semigroup with well founded universal semilattice or a solvable inverse semigroup with well founded semilattice of idempotents, then every strongly productive ultrafilter on S is idempotent. Moreover we…

Logic · Mathematics 2016-05-06 David Fernández Bretón , Martino Lupini

String C-groups are precisely the automorphism groups of abstract regular polytopes. A certain regular d-polytope C_d with an automorphism group of order 2^{2d-1}, discovered by Conder and shown to have the smallest number of flags among…

Group Theory · Mathematics 2026-05-21 Dong-Dong Hou , Egon Schulte

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

Combinatorics · Mathematics 2023-03-02 Daniel R. Hawtin , Jin-Xin Zhou , Cheryl E. Praeger

We prove the $K(\pi,1)$ conjecture for affine Artin groups: the complexified complement of an affine reflection arrangement is a classifying space. This is a long-standing problem, due to Arnol'd, Pham, and Thom. Our proof is based on…

Group Theory · Mathematics 2020-12-08 Giovanni Paolini , Mario Salvetti

Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…

Combinatorics · Mathematics 2013-10-07 Oriol Serra , Gilles Zémor

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

Optimization and Control · Mathematics 2023-10-10 Ali Taherinassaj , Yiling Chen

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal