Related papers: Constant Degree Direct Product Testers with Small …

In this paper we introduce a direct family of simple polytopes $P^{0}\subset P^{1}\subset\ldots$ such that for any $k$, $2\leq k\leq n$ there are non-trivial strictly defined Massey products of order $k$ in the cohomology rings of their…

The theory of uniform approximation of real numbers motivates the study of products of consecutive partial quotients in regular continued fractions. For any non-decreasing positive function $\varphi:\mathbb{N}\to [2,\infty)$, we determine…

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…

Let $k$ be any field. Let $X \subset \mathbb{P}_k^N$ be a degree $d \geq 2$ hypersurface. Under some conditions, we prove that if $X(K) \neq \emptyset$ for some extension $K/k$ with $n:=[K:k] \geq 2$ and $\gcd(n,d)=1$, then $X(L) \neq…

If $G$ is a group, we say a subset $S$ of $G$ is product-free if the equation $xy=z$ has no solutions with $x,y,z \in S$. For $D \in \mathbb{N}$, a group $G$ is said to be $D$-quasirandom if the minimal dimension of a nontrivial complex…

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

We expose a strong connection between good $2$-query locally testable codes (LTCs) and high dimensional expanders. Here, an LTC is called good if it has constant rate and linear distance. Our emphasis in this work is on LTCs testable with…

The convergence of DP Fourier series which are neither strongly convergent nor strongly divergent is discussed in terms of the Taylor series of the corresponding inner analytic functions. These are the cases in which the maximum disk of…

We revisit the relation between two fundamental property testing models for bounded-degree directed graphs: the bidirectional model in which the algorithms are allowed to query both the outgoing edges and incoming edges of a vertex, and the…

In this paper we construct a new family of sets based on Diophantine approximation in the Euclidean space, and consider their applications in several problems in harmonic analysis. Our first application is on the Hausdorff dimension of our…

Let $K$ be an algebraically closed field of arbitrary characteristic, $X$ an irreducible variety and $Y$ an irreducible projective variety over $K$, both are not necessarily smooth. Let $f:X\rightarrow X$ and $g:Y\rightarrow Y$ be dominant…

Let $E \subset \mathbb{R}^n$ be a compact set, and $f:E \to \mathbb{R}$. How can we tell if there exists a convex extension $F \in C^{1,1}(\mathbb{R}^n)$ of $f$, i.e. satisfying $F|_E = f|_E$? Assuming such an extension exists, how small…

We establish a generic form of hardness amplification for the approximability of constant-depth Boolean circuits by polynomials. Specifically, we show that if a Boolean circuit cannot be pointwise approximated by low-degree polynomials to…

In the study of Dirichlet series with arithmetic significance there has appeared (through the study of known examples) certain expectations, namely (i) if a functional equation and Euler product exists, then it is likely that a type of…

We analyse the subgroup structure of direct products of groups. Earlier work on this topic has revealed that higher finiteness properties play a crucial role in determining which groups appear as subgroups of direct products of free groups…

High dimensional expanders simultaneously satisfying spectral and combinatorial (coboundary) expansion have recently played a major role in breakthroughs in PCP and coding theory, but the only known construction of such complexes is…

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

It is shown that, if $R$ is either an Artin algebra or a commutative noetherian domain of Krull dimension $1$, then infinite direct products of $R$-modules resist direct sum decomposition as follows: If $(M_n)_{n \in \Bbb N}$ is a family of…

We study the problems of identity and closeness testing of $n$-dimensional product distributions. Prior works by Canonne, Diakonikolas, Kane and Stewart (COLT 2017) and Daskalakis and Pan (COLT 2017) have established tight sample complexity…