English
Related papers

Related papers: Optimal Testing of Reed-Muller Codes

200 papers

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

Commutative Algebra · Mathematics 2018-10-19 Jose Martinez-Bernal , Yuriko Pitones , Rafael H. Villarreal

For a function $g\colon\{0,1\}^m\to\{0,1\}$, a function $f\colon \{0,1\}^n\to\{0,1\}$ is called a $g$-polymorphism if their actions commute: $f(g(\mathsf{row}_1(Z)),\ldots,g(\mathsf{row}_n(Z))) =…

Discrete Mathematics · Computer Science 2021-06-22 Gilad Chase , Yuval Filmus , Dor Minzer , Elchanan Mossel , Nitin Saurabh

The main objective of this paper is to look from the unique point of view at some phenomena arising in different areas of probability theory and mathematical statistics. We will try to understand what is common between classical…

Probability · Mathematics 2012-03-01 Oleg Lepski

We study a novel class of affine invariant and consistent tests for normality in any dimension. The tests are based on a characterization of the standard $d$-variate normal distribution as the unique solution of an initial value problem of…

Methodology · Statistics 2019-09-30 Philip Dörr , Bruno Ebner , Norbert Henze

In this paper, we study the problem of monotone (weakly) DR-submodular continuous maximization. While previous methods require the gradient information of the objective function, we propose a derivative-free algorithm LDGM for the first…

Machine Learning · Computer Science 2019-02-26 Yibo Zhang , Chao Qian , Ke Tang

We show that for the problem of testing if a matrix $A \in F^{n \times n}$ has rank at most $d$, or requires changing an $\epsilon$-fraction of entries to have rank at most $d$, there is a non-adaptive query algorithm making…

Data Structures and Algorithms · Computer Science 2018-10-19 Maria-Florina Balcan , Yi Li , David P. Woodruff , Hongyang Zhang

In this paper, we study the extreme statistics in the complex Ginibre ensemble of $N \times N$ random matrices with complex Gaussian entries, but with no other symmetries. All the $N$ eigenvalues are complex random variables and their joint…

Statistical Mechanics · Physics 2019-01-18 Bertrand Lacroix-A-Chez-Toine , Aurélien Grabsch , Satya N. Majumdar , Gregory Schehr

Let $\mu$ be a compactly supported absolutely continuous probability measure on ${\Bbb R}^n$, we show that $\mu$ admits Fourier frames if and only if its Radon-Nikodym derivative is upper and lower bounded almost everywhere on its support.…

Functional Analysis · Mathematics 2011-10-31 Chun-kit Lai

We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ \sum_{S \subseteq…

Computational Complexity · Computer Science 2019-02-08 Chin Ho Lee

In this paper we obtain estimates for certain transcendence measures of an entire function $f$. Using these estimates, we prove Bernstein, doubling and Markov inequalities for a polynomial $P(z,w)$ in ${\Bbb C}^2$ along the graph of $f$.…

Complex Variables · Mathematics 2007-05-23 Dan Coman , Evgeny A. Poletsky

As evolutionary algorithms (EAs) are general-purpose optimization algorithms, recent theoretical studies have tried to analyze their performance for solving general problem classes, with the goal of providing a general theoretical…

Neural and Evolutionary Computing · Computer Science 2022-11-29 Chao Qian

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

Number Theory · Mathematics 2011-03-25 Hamed Hatami , Shachar Lovett

We consider a class of two-dimensional functions f(x,y) with the property that the smallness of its rectangular norm implies the smallness of rectangular norm for f(x,x+y). Also we study a family of functions f(x,y) having a similar…

Combinatorics · Mathematics 2009-12-15 I. D. Shkredov

In this note we characterize when non-classical polynomials are necessary in the inverse theorem for the Gowers $U^k$-norm. We give a brief deduction of the fact that a bounded function on $\mathbb F_p^n$ with large $U^k$-norm must…

Combinatorics · Mathematics 2022-10-28 Aaron Berger , Ashwin Sah , Mehtaab Sawhney , Jonathan Tidor

We contribute to the exceptional APN conjecture by showing that no polynomial of degree m = 2 r (2 {\ell} + 1) where gcd(r, {\ell}) 2, r 2, {\ell} 1 with a nonzero second leading coefficient can be APN over infinitely many extensions of the…

Number Theory · Mathematics 2022-07-29 Yves Aubry , Fabien Herbaut , Ali Issa

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

Computational Complexity · Computer Science 2015-02-23 Christoph Berkholz , Martin Grohe

The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…

High Energy Physics - Theory · Physics 2018-11-14 Eric D'Hoker , Michael B. Green , Boris Pioline

We prove that constant functions are the unique real-valued maximizers for all $L^2-L^{2n}$ adjoint Fourier restriction inequalities on the unit sphere $\mathbb{S}^{d-1}\subset\mathbb{R}^d$, $d\in\{3,4,5,6,7\}$, where $n\geq 3$ is an…

Classical Analysis and ODEs · Mathematics 2021-01-11 Diogo Oliveira e Silva , René Quilodrán

Recent work has established that, for every positive integer $k$, every $n$-node graph has a $(2k-1)$-spanner on $O(f^{1-1/k} n^{1+1/k})$ edges that is resilient to $f$ edge or vertex faults. For vertex faults, this bound is tight. However,…

Data Structures and Algorithms · Computer Science 2021-02-24 Greg Bodwin , Michael Dinitz , Caleb Robelle