Related papers: The Gotsman-Linial Conjecture is False
In 2003, Alfred Menezes, Edlyn Teske and Annegret Weng presented a conjecture on properties of the solutions of a type of quadratic equation over the binary extension fields, which had been convinced by extensive experiments but the proof…
Least-squares data analysis is based on the assumption that the normal (Gaussian) distribution appropriately characterizes the likelihood, that is, the conditional probability of each measurement d, given a measured quantity y, p(d | y). On…
This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…
The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hypersurface, then exp(2\pi i c) is an eigenvalue of the monodromy on the cohomology of the Milnor fiber. A stronger version of the conjecture…
The boxicity of a graph $G$ is the minimum dimension $d$ that admits a representation of $G$ as the intersection graph of a family of axis-parallel boxes in $\mathbb{R}^d$. Computing boxicity is an NP-hard problem, and there are few known…
We discuss when two rational functions $f$ and $g$ can have the same measure of maximal entropy. The polynomial case was completed by (Beardon, Levin, Baker-Eremenko,Schmidt-Steinmetz, etc., 1980s-90s), and we address the rational case…
In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…
Consider a host hypergraph $G$ which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of $G$ are sampled at the appropriate rate then the spanning structure still appears…
The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to…
The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…
Robin Hartshorne and Alexander Hirschowitz proved that a generic collection of lines on $\mathbb P^n$, $n \geq 3$, has bipolynomial Hilbert Function. We extended this result to a specialization of the collection of generic lines, by…
Let $f:\{-1,1\}^{n}\rightarrow \{-1,1\}$ be a Boolean valued function having total degree $d$. Then a conjecture due to Servedio and Gopalan asserts that $\sum_{i=1}^{n}\widehat{f}(i)\leq \sum_{j=1}^{d}\widehat{\text{Maj}}_{d}(j)$ where…
Without using the $L^2$ extension theorem, we provide a new proof of the equality part in Suita's conjecture, which states that for any open Riemann surface admitting a Green's function, the Bergman kernel and the logarithmic capacity…
Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\delta_I(d,r)$ of a graded ideal $I$ in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that…
In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…
We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\mathsf{AND}$, $\mathsf{OR}$, and $\mathsf{NOT}$ gates. Our hierarchy theorem says that for every $d \geq 2$, there is an explicit…
We generalize R. P. Stanley's celebrated theorem that the $h^\ast$-polynomial of the Ehrhart series of a rational polytope has nonnegative coefficients and is monotone under containment of polytopes. We show that these results continue to…
We analyze the average behavior of various arithmetic functions at the values of degree $d$ binary forms ordered by height, with probability $1$. This approach yields averaged versions of the Chowla conjecture and the Bateman-Horn…
Consider the uniform random graph $G(n,M)$ with $n$ vertices and $M$ edges. Erd\H{o}s and R\'enyi (1960) conjectured that the limit $$ \lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2}) is planar}} $$ exists and is a constant strictly…
Landau-Ginzburg mirror symmetry predicts isomorphisms between graded Frobenius algebras (denoted $\mathcal{A}$ and $\mathcal{B}$) that are constructed from a nondegenerate quasihomogeneous polynomial $W$ and a related group of symmetries…