English
Related papers

Related papers: High Dimensional Expanders and Property Testing

200 papers

We describe several infinite series of rational conformal field theories whose conformal characters are modular units, i.e. which are modular functions having no zeros or poles in the upper complex half plane, and which thus possess simple…

High Energy Physics - Theory · Physics 2009-10-30 Wolfgang Eholzer , Nils-Peter Skoruppa

Coboundary and cosystolic expansion are notions of expansion that generalize the Cheeger constant or edge expansion of a graph to higher dimensions. The classical Cheeger inequality implies that for graphs edge expansion is equivalent to…

Combinatorics · Mathematics 2021-02-11 Tali Kaufman , Izhar Oppenheim

We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically, the new model refers to testing properties of distributions, but these are…

Data Structures and Algorithms · Computer Science 2024-02-14 Oded Goldreich , Dana Ron

Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…

Group Theory · Mathematics 2019-02-26 Trevor Davila

We show that the Golod property of a Stanley-Reisner ring can depend on the characteristic of the base field. More precisely, for every finite set $T$ of prime numbers we construct simplicial complexes $\Delta$ and $\Gamma$, such that…

Commutative Algebra · Mathematics 2016-06-07 Lukas Katthän

The Expansion property considered by researchers in Social Choice is shown to correspond to a logical property of nonmonotonic consequence relations that is the {\em pure}, i.e., not involving connectives, version of a previously known weak…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

The simplicial extension of any functor from Sets to Sets which commutes with directed colimits takes weak equivalences to weak equivalences. The goal of the present paper is construct a framework which can be used to proof results of this…

Algebraic Geometry · Mathematics 2009-09-28 Vladimir Voevodsky

Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…

Geometric Topology · Mathematics 2023-04-03 Ivan Babenko , Florent Balacheff , Guillaume Bulteau

We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…

Combinatorics · Mathematics 2022-11-28 Yotam Dikstein

We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix…

Logic in Computer Science · Computer Science 2023-04-11 Isolde Adler , Noleen Köhler , Pan Peng

In this paper, we further explore the local-to-global approach for expansion of simplicial complexes that we call local spectral expansion. Specifically, we prove that local expansion in the links imply the global expansion phenomena of…

Combinatorics · Mathematics 2018-03-06 Izhar Oppenheim

We investigate simplicial complexes deterministically growing from a single vertex. In the first step, a vertex and an edge connecting it to the primordial vertex are added. The resulting simplicial complex has a 1-dimensional simplex and…

Combinatorics · Mathematics 2026-01-23 S. N. Dorogovtsev , P. L. Krapivsky

A graph property P is strongly testable if for every fixed \epsilon>0 there is a one-sided \epsilon-tester for P whose query complexity is bounded by a function of \epsilon. In classifying the strongly testable graph properties, the first…

Combinatorics · Mathematics 2011-10-14 Noga Alon , Jacob Fox

The field of property testing of probability distributions, or distribution testing, aims to provide fast and (most likely) correct answers to questions pertaining to specific aspects of very large datasets. In this work, we consider a…

Data Structures and Algorithms · Computer Science 2015-04-27 Clément L. Canonne

We prove that for any large enough constant $k$, the union of $k$ independent $d$-dimensional determinantal hypertrees is a coboundary expander with high probability.

Combinatorics · Mathematics 2024-10-03 András Mészáros

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

Combinatorics · Mathematics 2022-07-19 T. Mitchell Roddenberry , Santiago Segarra

The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…

Combinatorics · Mathematics 2022-04-27 Tom Bohman , Andrew Newman

We study extensions of sets and functions in general metric measure spaces. We show that an open set has the strong BV extension property if and only if it has the strong extension property for sets of finite perimeter. We also prove…

Metric Geometry · Mathematics 2023-02-21 Emanuele Caputo , Jesse Koivu , Tapio Rajala

\emph{Scalable spaces} are simply connected compact manifolds or finite complexes whose real cohomology algebra embeds in their algebra of (flat) differential forms. This is a rational homotopy invariant property and all scalable spaces are…

Geometric Topology · Mathematics 2022-09-16 Aleksandr Berdnikov , Fedor Manin

We construct an explicit family of 3XOR instances which is hard for $O(\sqrt{\log n})$ levels of the Sum-of-Squares hierarchy. In contrast to earlier constructions, which involve a random component, our systems can be constructed explicitly…

Computational Complexity · Computer Science 2021-11-23 Irit Dinur , Yuval Filmus , Prahladh Harsha , Madhur Tulsiani