Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
25
Citation
21
Reference
10
Related Paper
Citation Trend
In this note, we show that a Toy Conjecture made by (Boyle, Ishai, Pass, Wootters, 2017) is false, and propose a new one. Our attack does not falsify the full (non-toy) conjecture in that work, and it is our hope that this note will help further the analysis of that conjecture. Independently, (Boyle, Holmgren, Ma, Weiss, 2021) have obtained similar results.
Cite
Citations (0)
In this note, we will give a counter example of Tsuzuki’s fully faithfulness conjecture and propose a modified conjecture. We also propose a weaker conjecture, and prove that this conjecture is sufficient for our final goal, which is the full faithfulness conjecture of overconvergent isocrystals.
Lonely runner conjecture
abc conjecture
Elliott–Halberstam conjecture
Cite
Citations (4)
The main objective of this paper is to present an answer to Bressoud's conjecture for the case $j=0$, resulting in a complete solution to the conjecture. The case for $j=1$ has been recently resolved by Kim. Using the connection established in our previous paper between the ordinary partition function $B_0$ and the overpartition function $\overline{B}_1$, we found that the proof of Bressoud's conjecture for the case $j=0$ is equivalent to establishing an overpartition analogue of the conjecture for $j=1$. By generalizing Kim's method, we obtain the desired overpartition analogue of Bressoud's conjecture for $j=1$, which eventually enables us to confirm Bressoud's conjecture for the case $j=0$.
abc conjecture
Lonely runner conjecture
Elliott–Halberstam conjecture
Cite
Citations (1)
We study K_2 of one-dimensional local domains over a field of characteristic 0, introduce a conjecture, and show that this conjecture implies Geller's conjecture. We also show that Berger's conjecture implies Geller's conjecture, and hence verify it in new cases.
Cite
Citations (0)
We show that the Volume Conjecture for polyhedra implies a weak version of the Stoker Conjecture; in turn we prove that this weak version of the Stoker conjecture implies the Stoker conjecture. The main tool used is an extension of a result of Montcouquiol and Weiss, saying that dihedral angles are local coordinates for compact polyhedra with angles $\leq \pi$.
Polyhedron
Dihedral angle
Cite
Citations (0)
At the end of 1960's, Lawrence Zalcman posed a conjecture that the coefficients of univalent functions $f(z) = z + \sum\limits_2^\infty a_n z^n$ on the unit disk satisfy the sharp inequality $|a_n^2 - a_{2n-1}| \le (n-1)^2$, with equality only for the Koebe function. This remarkable conjecture implies the Bieberbach conjecture, investigated by many mathematicians, and still remains a very difficult open problem for all n > 3; it was proved only in certain special cases. We provide a proof of Zalcman's conjecture based on results concerning the plurisubharmonic functionals and metrics on the universal Teichmüller space. As a corollary, this implies a new proof of the Bieberbach conjecture. Our method gives also other new sharp estimates for large coefficients.
Corollary
Unit disk
Cite
Citations (1)
In this note, we show that a "Toy Conjecture" made by (Boyle, Ishai, Pass, Wootters, 2017) is false, and propose a new one. Our attack does not falsify the full ("non-toy") conjecture in that work, and it is our hope that this note will help further the analysis of that conjecture. Independently, (Boyle, Holmgren, Ma, Weiss, 2021) have obtained similar results.
Cite
Citations (0)
In this paper, we generalize the Cosmetic Surgery Conjecture to an $n$-cusped hyperbolic $3$-manifold and prove it under the assumption of another well-known conjecture in number theory, so called the Zilber-Pink Conjecture. For $n=1$ and $2$, we show them without the assumption.
Manifold (fluid mechanics)
Cite
Citations (5)
Suppose that we have a set of numbers x_1, ..., x_n which have nonnegative sum. How many subsets of k numbers from {x_1, ..., x_n} must have nonnegative sum? Manickam, Miklos, and Singhi conjectured that for n at least 4k the answer is (n-1 \choose k-1). This conjecture is known to hold when n is large compared to k. The best known bounds are due to Alon, Huang, and Sudakov who proved the conjecture when n > 33k^2. In this paper we improve this bound by showing that there is a constant C such that the conjecture holds when n > Ck.
Constant (computer programming)
Cite
Citations (0)