English
Related papers

Related papers: Refuting Feder, Kinne and Rafiey

200 papers

This paper has been withdrawn by the author due to an error in Lemma 3, making the (bijective) proof of Theorem 4 and Corollary 5 invalid (symmetry of k-nonnesting and k-noncrossing set partitions).

Combinatorics · Mathematics 2007-10-09 Robert Parviainen

We present a generic functional inequality on Riemannian manifolds, both in additive and multiplicative forms, that produces well known and genuinely new Hardy-type inequalities. For the additive version, we introduce Riccati pairs that…

Analysis of PDEs · Mathematics 2024-02-16 Sándor Kajántó , Alexandru Kristály , Ioan Radu Peter , Wei Zhao

The arithmetic Kakeya conjecture, formulated by Katz and Tao in 2002, is a statement about addition of finite sets. It is known to imply a form of the Kakeya conjecture, namely that the upper Minkowski dimension of a Besicovitch set in…

Number Theory · Mathematics 2017-12-07 Ben Green , Imre Ruzsa

In 2012 Gamayun, Iorgov, Lisovyy conjectured an explicit expression for the Painlev\'e VI $\tau$~function in terms of the Liouville conformal blocks with central charge $c=1$. We prove that proposed expression satisfies Painlev\'e VI…

Mathematical Physics · Physics 2015-12-31 M. A. Bershtein , A. I. Shchechkin

We show the flaw in a theorem of Konno, Namiki, Soshi, and Sudbury in [3] and provide the necessary correction in the case of the Finite Hadamard walk and use it to show that a conjecture of Ambainis, Bach, Nayak, Vishwanath, and Watrous in…

Mathematical Physics · Physics 2010-12-08 Clement Ampadu

We prove that a conjecture of Fujita on the semi-ampleness is true in the case of rank one direct summand, though it is wrong in higher rank case by Catanese and Dettweiler.

Algebraic Geometry · Mathematics 2020-12-04 Yujiro Kawamata

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

Computational Complexity · Computer Science 2017-03-28 Lucy Ham

It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy…

Computational Complexity · Computer Science 2013-08-05 Jakub Bulin , Dejan Delic , Marcel Jackson , Todd Niven

We provide a proof of Pisot conjecture, a classification problem in Ergodic Theory on recurrent sequences generated by irreducible Pisot substitutions.

Dynamical Systems · Mathematics 2023-09-04 Kentaro Nakaishi

Under what condition is a random constraint satisfaction problem hard to refute by the sum-of-squares (SoS) algorithm? A sufficient condition is t-wise uniformity, that is, each constraint has a t-wise uniform distribution of satisfying…

Computational Complexity · Computer Science 2026-05-01 Siu On Chan , Tommaso d'Orsi , Jeff Xu

An earlier version of this paper constructed a family of $n$-vertex $C_4$-free graphs which we conjectured to have independence number $n^{\frac 12+o(1)}$. This conjecture is false, as pointed out by Michael Tait.

Combinatorics · Mathematics 2021-08-23 Yuval Wigderson

We generalize some results of Gray and McGibbon-Roitberg on relations between phantom maps and rational homotopy to relative phantom maps. Since the $\lim^1$ and the profinite completion techniques do not apply to relative phantom maps, we…

Algebraic Topology · Mathematics 2020-10-30 Daisuke Kishimoto , Takahiro Matsushita

A ``self--similar'' example is constructed that shows that a conjecture of N. U. Arakelyan on the order of decrease of deficiencies of an entire function of finite order is not true.

Complex Variables · Mathematics 2016-09-06 Alexandre Erëmenko

In this Comment, we refute conclusions made in Phys. Rev. Lett. 112, 233601 (2014) by L.-G. Wang, L. Wang, M. Al-Amri, S.-Y. Zhu, and M. S. Zubairy. These conclusions stem from the use of the linear theory, which is not applicable to…

Other Condensed Matter · Physics 2015-11-30 D. G. Baranov , A. A. Zyablovsky , A. V. Dorofeenko , A. P. Vinogradov , A. A. Lisyansky

Random constraint satisfaction problems (CSPs) are known to exhibit threshold phenomena: given a uniformly random instance of a CSP with $n$ variables and $m$ clauses, there is a value of $m = \Omega(n)$ beyond which the CSP will be…

Data Structures and Algorithms · Computer Science 2016-11-07 Prasad Raghavendra , Satish Rao , Tselil Schramm

The proof of the conjecture of the Birch and Swinnerton - Dyer is presented in the paper. The Riemann's hypothesis on the distribution of non-trivial zeroes of the zeta-function of Riemann, previously proven, is word to prove this…

General Mathematics · Mathematics 2014-06-10 S. V. Matnyak

We answer negatively a 2014 problem of Yang and Chen on Romanoff type representations. Sharp results involving their problem were also obtained in this article.

Number Theory · Mathematics 2024-03-20 Yuchen Ding

This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…

Number Theory · Mathematics 2024-07-29 Wenbo Sun

We present a counter example to a theorem given by Amir {\em et al.} J. Math. Phys. {\bf 35}, 3005 (1994). We also comment on a misleading statements of the same reference.

General Relativity and Quantum Cosmology · Physics 2009-10-28 R. Bertolotti , G. Contreras , L. A. Núñez , U. Percoco , J. Carot

We show that the Hermitian analogue of a famous result of Pfister fails. To do so we provide a Hermitian symmetric polynomial $r$ of total degree 2d such that any non-zero multiple of it cannot be written as a Hermitian sum of squares with…

Complex Variables · Mathematics 2012-01-31 John P. D'Angelo , Jiri Lebl