English
Related papers

Related papers: High Dimensional Expanders and Property Testing

200 papers

We start from a study of the density-potential relation for classical homeoids in terms of an asymptotic expansion for small deviations from spherical symmetry. We then show that such expansion is a useful device that allows us to construct…

Astrophysics · Physics 2009-11-10 L. Ciotti , G. Bertin

Let X be a 2-dimensional simplicial complex. The degree of an edge e is the number of 2-faces of X containing e. The complex X is an \epsilon-expander if the coboundary d_1(\phi) of every Z_2-valued 1-cochain \phi \in C^1(X;Z_2) satisfies…

Combinatorics · Mathematics 2013-07-16 Alexander Lubotzky , Roy Meshulam

Let $G$ be a graph with $n$ vertices and maximum degree $d$. Fix some minor-closed property $\mathcal{P}$ (such as planarity). We say that $G$ is $\varepsilon$-far from $\mathcal{P}$ if one has to remove $\varepsilon dn$ edges to make it…

Discrete Mathematics · Computer Science 2019-04-03 Akash Kumar , C. Seshadhri , Andrew Stolman

We show that a Buchsbaum simplicial complex of small codimension must have large depth. More generally, we achieve a similar result for ${\rm CM}_t$ simplicial complexes, a notion generalizing Buchsbaum-ness, and we prove more precise…

Commutative Algebra · Mathematics 2018-06-14 Matteo Varbaro , Rahim Zaare-Nahandi

Recently, it has been proved that if we have a field extension, then it has linear matching property if and only if L is purely transcendental or is an extension of prime degree. In this note we provide a counterexample for this result.

Combinatorics · Mathematics 2015-07-28 Saieed Akbari , Mohsen Aliabadi

Using an infinitary version of the Hypergraph Removal Lemma due to Towsner, we prove a model-theoretic higher amalgamation result. In particular, we obtain an independent amalgamation property which holds in structures which are measurable…

Logic · Mathematics 2023-11-08 David M. Evans

The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…

Probability · Mathematics 2025-12-19 Kinga Nagy

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

The statistical analysis of discrete data has been the subject of extensive statistical research dating back to the work of Pearson. In this survey we review some recently developed methods for testing hypotheses about high-dimensional…

Machine Learning · Statistics 2017-12-19 Sivaraman Balakrishnan , Larry Wasserman

We study H-structures associated to SU-rank 1 measurable structures. We prove that the SU-rank of the expansion is continuous and that it is uniformly definable in terms of the parameters of the formulas. We also introduce notions of…

Logic · Mathematics 2022-11-22 Alexander Berentein , Dario Garcia , Tingxiang Zou

We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…

General Topology · Mathematics 2024-07-10 Djamel Eddine Amir , Mathieu Hoyrup

Let $\Sigma$ be a codimension one submanifold of an $n$-dimensional Riemannian manifold $M$, $n\geqslant 2$. We give a necessary condition for an isometric immersion of $\Sigma$ into $\mathbb R^q$ equipped with the standard Euclidean…

Differential Geometry · Mathematics 2016-08-23 Norbert Hungerbühler , Micha Wasem

In this note, we give a self-contained and elementary proof of the elementary construction of spectral high-dimensional expanders using elementary matrices due to Kaufman and Oppenheim [Proc. 50th ACM Symp. on Theory of Computing (STOC),…

Discrete Mathematics · Computer Science 2022-06-02 Prahladh Harsha , Ramprasad Saptharishi

The Huge Object model of property testing [Goldreich and Ron, TheoretiCS 23] concerns properties of distributions supported on $\{0,1\}^n$, where $n$ is so large that even reading a single sampled string is unrealistic. Instead, query…

Data Structures and Algorithms · Computer Science 2024-12-04 Sourav Chakraborty , Eldar Fischer , Arijit Ghosh , Amit Levi , Gopinath Mishra , Sayantan Sen

We establish expansion properties for suitably generic polynomials of degree $d$ in $d+1$ variables over finite fields. In particular, we show that if $P\in\mathbb{F}_q[x_1,\ldots,x_{d+1}]$ is a polynomial of degree $d$ coming from an…

Combinatorics · Mathematics 2024-03-07 Nuno Arala , Sam Chow

In this paper, we consider several property testing problems and ask how the query complexity depends on the distance parameter $\eps$. We achieve new lower bounds in this setting for the problems of testing whether a function is monotone…

Computational Complexity · Computer Science 2013-08-28 Joshua Brody , Pooya Hatami

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Algebraic Topology · Mathematics 2024-08-07 Sergey Avvakumov , Roman Karasev

In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $t\geq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we prove that it can be obtained from a Buchsbaum…

Commutative Algebra · Mathematics 2017-01-19 Rahim Rahmati-Asghar

In previous work we proved that, for categories of free finite-dimensional modules over a commutative semiring, linear compact-closed symmetric monoidal structure is a property, rather than a structure. That is, if there is such a…

Quantum Physics · Physics 2019-01-30 Stefano Gogioso , Dan Marsden , Bob Coecke

We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously…

Information Theory · Computer Science 2023-08-11 Gleb Kalachev , Pavel Panteleev