English
Related papers

Related papers: High dimensional expanders and coset geometries

200 papers

Recent works have shown that expansion of pseudorandom sets is of great importance. However, all current works on pseudorandom sets are limited only to product (or approximate product) spaces, where Fourier Analysis methods could be…

Computational Complexity · Computer Science 2022-11-18 Tali Kaufman , David Mass

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

Group Theory · Mathematics 2022-03-09 Kevin Kordek , Qiao Li , Caleb Partin

Coset incidence geometries, introduced by Jacques Tits, provide a versatile framework for studying the interplay between group theory and geometry. In this article, we build upon that idea by extending classical group-theoretic…

Group Theory · Mathematics 2025-06-02 Claudio Alexandre Piedade , Philippe Tranchida

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…

Group Theory · Mathematics 2010-04-22 Ben Fairbairn

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

Computational Geometry · Computer Science 2013-06-17 Prosenjit Bose , Vida Dujmovic , Pat Morin , Michiel Smid

Symmetries play an essential role in the construction and phenomenology of quantum field theories (QFTs). We discuss how to construct symmetries of QFTs by extending minimal "seed" symmetry groups to larger groups that contain the seed(s)…

High Energy Physics - Phenomenology · Physics 2025-11-20 Christian Döring , Andreas Trautner

An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study…

Computational Complexity · Computer Science 2014-12-01 Michael A. Forbes , Venkatesan Guruswami

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of…

Combinatorics · Mathematics 2016-03-22 Hans-Jürgen Bandelt , Victor Chepoi , David Eppstein

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

Combinatorics · Mathematics 2017-11-23 Michael Dinitz , Michael Schapira , Gal Shahaf

We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…

Combinatorics · Mathematics 2017-06-07 Stefan David , Hunter Spink , Marius Tiba

Geometric decomposition is a widely used tool for constructing local bases for finite element spaces. For finite element spaces of differential forms on simplicial meshes, Arnold, Falk, and Winther showed that geometric decompositions can…

Numerical Analysis · Mathematics 2025-05-02 Yakov Berchenko-Kogan

In repeated Measure Designs with multiple groups, the primary purpose is to compare different groups in various aspects. For several reasons, the number of measurements and therefore the dimension of the observation vectors can depend on…

Statistics Theory · Mathematics 2022-07-20 Paavo Sattler , Markus Pauly

Existence of quantum low-density parity-check (LDPC) codes whose minimal distance scales linearly with the number of qubits is a major open problem in quantum information. Its practical interest stems from the need to protect information in…

Quantum Physics · Physics 2021-05-14 Lior Eldar , Maris Ozols , Kevin F. Thompson

We construct a family of constant-rate highly-symmetric self-dual qLDPC codes on high dimensional expanders. This is the first self-dual code constructed on high dimensional expanders and also the first such code with a rich (e.g.…

Quantum Physics · Physics 2026-03-13 Kyle Gulshen , Tali Kaufman

Recent researches on complex systems highlighted the so-called super-linear growth phenomenon. As the system size $P$ measured as population in cities or active users in online communities increases, the total activities $X$ measured as GDP…

Physics and Society · Physics 2012-12-21 Jiang Zhang

We study the relationship between the underlying structure of posets and the spectral and combinatorial properties of their higher-order random walks. While fast mixing of random walks on hypergraphs has led to myriad breakthroughs…

Combinatorics · Mathematics 2023-03-14 Jason Gaitonde , Max Hopkins , Tali Kaufman , Shachar Lovett , Ruizhe Zhang

We introduce a framework of layered subsets, and give a sufficient condition for when a set system supports an agreement test. Agreement testing is a certain type of property testing that generalizes PCP tests such as the plane vs. plane…

Computational Complexity · Computer Science 2019-09-04 Yotam Dikstein , Irit Dinur

We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…

Metric Geometry · Mathematics 2024-11-21 David Hume

Small set expansion in high dimensional expanders is of great importance, e.g., towards proving cosystolic expansion, local testability of codes and constructions of good quantum codes. In this work we improve upon the state of the art…

Computational Complexity · Computer Science 2025-12-12 Tali Kaufman , David Mass

Consider a random geometric 2-dimensional simplicial complex $X$ sampled as follows: first, sample $n$ vectors $\boldsymbol{u_1},\ldots,\boldsymbol{u_n}$ uniformly at random on $\mathbb{S}^{d-1}$; then, for each triple $i,j,k \in [n]$, add…

Combinatorics · Mathematics 2022-10-04 Siqi Liu , Sidhanth Mohanty , Tselil Schramm , Elizabeth Yang