English
Related papers

Related papers: Constant Degree Direct Product Testers with Small …

200 papers

Finite Cartesian products of operators play a central role in monotone operator theory and its applications. Extending such products to arbitrary families of operators acting on different Hilbert spaces is an open problem, which we address…

Functional Analysis · Mathematics 2025-06-25 Minh N. Bùi , Patrick L. Combettes

The problem of existence of nontrivial Massey products in cohomology of a space is well-known in algebraic topology and homological algebra. A number of problems in complex geometry, symplectic geometry, and algebraic topology can be stated…

Algebraic Topology · Mathematics 2018-11-07 Victor Buchstaber , Ivan Limonchenko

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

Logic · Mathematics 2023-11-03 Uri Andrews , Gabriel Conant , Isaac Goldbring

In this note, we consider meromorphic univalent functions $f(z)$ in the unit disc with a simple pole at $z=p\in(0,1)$ which have a $k$-quasiconformal extension to the extended complex plane $\hat{\mathbb C},$ where $0\leq k < 1$. We denote…

Complex Variables · Mathematics 2015-02-19 Bappaditya Bhowmik , Goutam Satpati , Toshiyuki Sugawa

Consider the expected query complexity of computing the $k$-fold direct product $f^{\otimes k}$ of a function $f$ to error $\varepsilon$ with respect to a distribution $\mu^k$. One strategy is to sequentially compute each of the $k$ copies…

Computational Complexity · Computer Science 2024-05-28 Guy Blanc , Caleb Koch , Carmen Strassle , Li-Yang Tan

In this paper we develop a duality theory for all finite-dimensional near-vector spaces and introduce a notion of inner product tailored to the broad and natural class of strongly regular near-vector spaces. This generalized construction…

General Mathematics · Mathematics 2025-11-18 Leeandro Boonzaaier , Sophie Marques , Daniella Moore

We prove that the module categories of Noether algebras (i.e., algebras module finite over a noetherian center) and affine noetherian PI algebras over a field enjoy the following product property: Whenever a direct product $\prod_{n \in…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann , Manuel Saorín

Subgroups of direct products of finitely many finitely generated free groups form a natural class that plays an important role in geometric group theory. Its members include fundamental examples, such as the Stallings-Bieri groups. This…

All the $F:$N$\rightarrow $C having Ramanujan expansion $F(a)=\sum_{q=1}^{\infty}G(q)c_q(a)$ (here $c_q(a)$ is the Ramanujan sum) pointwise converging in $a\in $N, with $G:$N$\rightarrow $C a multiplicative function, may be factored into…

Number Theory · Mathematics 2019-11-12 Giovanni Coppola

We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…

Data Structures and Algorithms · Computer Science 2020-09-15 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , John Peebles , Eric Price

Many two-sample problems call for a comparison of two distributions from an exponential family. Density ratio estimation methods provide ways to solve such problems through direct estimation of the differences in natural parameters. The…

Statistics Theory · Mathematics 2025-02-19 Erika Banzato , Mathias Drton , Kian Saraf-Poor , Hongjian Shi

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

We present a new explicit construction of onesided bipartite lossless expanders of constant degree, with arbitrary constant ratio between the sizes of the two vertex sets. Our construction is simpler to state and analyze than the only prior…

Combinatorics · Mathematics 2024-01-10 Louis Golowich

We give a randomness-efficient homomorphism test in the low soundness regime for functions, $f: G\to \mathbb{U}_t$, from an arbitrary finite group $G$ to $t\times t$ unitary matrices. We show that if such a function passes a derandomized…

Computational Complexity · Computer Science 2024-09-25 Tushant Mittal , Sourya Roy

The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lovasz to determine the Shannon capacity of the pentagon; to show a direct sum theorem for…

Computational Complexity · Computer Science 2008-05-01 Troy Lee , Rajat Mittal

Let $P \subset \mathbb R^2$ be a point set with cardinality $N$. We give an improved bound for the number of dot products determined by $P$, proving that, \[ |\{ p \cdot q :p,q \in P \}| \gg N^{2/3+c}. \] A crucial ingredient in the proof…

Combinatorics · Mathematics 2021-10-01 Brandon Hanson , Oliver Roche-Newton , Steven Senger

Agreement tests are a generalization of low degree tests that capture a local-to-global phenomenon, which forms the combinatorial backbone of most PCP constructions. In an agreement test, a function is given by an ensemble of local…

Computational Complexity · Computer Science 2020-12-14 Irit Dinur , Yuval Filmus , Prahladh Harsha

Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…

Combinatorics · Mathematics 2007-05-23 Van Vu

We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product…

Computational Complexity · Computer Science 2010-11-29 Rahul Jain

In recent years, high dimensional expanders have been found to have a variety of applications in theoretical computer science, such as efficient CSPs approximations, improved sampling and list-decoding algorithms, and more. Within that, an…

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