Related papers: Counterexample to the Laptev--Safronov conjecture
The identifications of transverse boost and rotation operators in light front theory done in Phys. Rev. Lett. {109}, 152005 (2012) is incorrect. The simple parton interpretation claimed is, in fact, for the transverse boost operator.…
We show that if there exists a counter example for the rational case of the Franks-Misiurewicz conjecture, then it must exhibit unbounded deviations in the complementary direction of its rotation set.
We investigate versions of the Shafarevich conjecture, as proved for curves and abelian varieties by Faltings, for other classes of varieties. We first obtain analogues for certain Fano threefolds. We use these results to prove the…
We study classes of weights ensuring the absence and presence of the Lavrentiev's phenomenon for double phase functionals upon every choice of exponents. We introduce a new sharp scale for weights for which there is no Lavrentiev's…
Counterexamples are presented to weighted forms of the Weiss conjecture in discrete and continuous time. In particular, for certain ranges of $\alpha$, operators are constructed that satisfy a given resolvent estimate, but fail to be…
In this paper we show that there exists a large family of smooth dynamical systems defined over noncompact spaces that does not satisfy Ruelle's inequality between entropy and Lyapunov exponents.
We prove a conditional theorem on the positivity of the Lyapunov exponent for a Schr\"odinger cocycle over a skew shift base with a cosine potential and the golden ratio as frequency. For coupling below 1, which is the threshold for…
The paper presents a counterexample to the Hodge conjecture.
We use state-of-art lattice algorithms to improve the upper bound on the lowest counterexample to the Mertens conjecture to $\approx \exp(1.96 \times 10^{19})$, which is significantly below the conjectured value of $\approx \exp(5.15 \times…
The Shapiro conjecture in the real Schubert calculus, while likely true for Grassmannians, fails to hold for flag manifolds, but in a very interesting way. We give a refinement of the Shapiro conjecture for the flag manifold and present…
Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…
We provide counterexamples showing that uniform laws of large numbers do not hold for subdifferentials under natural assumptions. Our constructions are univariate random Lipschitz functions and bivariate random convex functions with two…
We disprove a conjecture of Simon for higher-order Szego theorems for orthogonal polynomials on the unit circle and propose a modified version of the conjecture.
Recently GM Sofi & SA Shabir [arXive: 1903.01850v2 [math.GM] 6 Mar 2019] made an attempt to prove the Sendov's conjecture. But unfortunately the proof is not correct. In this note, we discuss the fallacy in the proof.
In this review paper we carry on our investigations on Schroedinger operators with inverse square potentials on the half-line. Depending on several parameters, such operators possess either a finite number of complex eigenvalues, or an…
A counterexample is given for the Knaster-like conjecture of Makeev for functions on $S^2$. Some particular cases of another conjecture of Makeev, on inscribing a quadrangle into a smooth simple closed curve, are solved positively.
We give here a counter-example to a conjecture of Spivakovsky. M. Spivakovsky conjectured that the function that appears in the strong Artin approximation theorem is bounded by a linear function. First we show that there is no Liouville…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
We study lower bounds on the Lyapunov exponent associated with one-frequency quasiperiodic Schr\"odinger operators with an added finite valued background potential. We prove that, for sufficiently large coupling constant, the Lyapunov…
A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…