English
Related papers

Related papers: Turing Degrees of Hyperjumps

200 papers

We prove upper and lower bounds for sums of eigenvalues of Lieb-Thirring type for non-self-adjoint Schr\"odinger operators on the half-line. The upper bounds are established for general classes of integrable potentials and are shown to be…

Spectral Theory · Mathematics 2022-03-01 Leonid Golinskii , Alexei Stepanenko

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following…

Combinatorics · Mathematics 2019-09-09 Xuancheng Shao

Let $z=(z_1, ..., z_n)$ and $\Delta=\sum_{i=1}^n \fr {\p^2}{\p z^2_i}$ the Laplace operator. The main goal of the paper is to show that the well-known Jacobian conjecture without any additional conditions is equivalent to the following what…

Complex Variables · Mathematics 2009-02-02 Wenhua Zhao

Let $p$ be a homogeneous polynomial of degree $n$ in $n$ variables, $p(z_1,...,z_n) = p(Z)$, $Z \in C^{n}$. We call such a polynomial $p$ {\bf H-Stable} if $p(z_1,...,z_n) \neq 0$ provided the real parts $Re(z_i) > 0, 1 \leq i \leq n$. This…

Combinatorics · Mathematics 2008-05-14 Leonid Gurvits

This paper deals with the class of Q-tensors, that is, a Q-tensor is a real tensor $\mathcal{A}$ such that the tensor complementarity problem $(\q, \mathcal{A})$: $$\mbox{ finding } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q +…

Optimization and Control · Mathematics 2017-01-18 Yisheng Song , Liqun Qi

For a given decreasing positive real function $\psi$, let $\mathcal{A}_n(\psi)$ be the set of real numbers for which there are infinitely many integer polynomials $P$ of degree up to $n$ such that $\left\lvert P(x) \right\rvert \leq…

Number Theory · Mathematics 2020-08-18 Alessandro Pezzoni

This paper is an erratum to our paper, entitled "On an application of Guth-Katz theorem", Math. Res. Lett. 18 (2011), no. 4, 691-697. Let $F$ be the real or complex field and $\omega$ a non-degenerate skew-symmetric bilinear form in the…

Combinatorics · Mathematics 2015-12-10 Alex Iosevich , Oliver Roche-Newton , Misha Rudnev

For a real degree $d$ polynomial $P$ with all nonvanishing coefficients, with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$), Descartes' rule of signs says that $P$ has $pos\leq c$ positive and…

Classical Analysis and ODEs · Mathematics 2020-12-09 Hassen Cheriha , Yousra Gati , Vladimir Petrov Kostov

In this article, we prove that for any Zhou valuation $\nu$, there exists a graded sequence of ideals $\mathfrak{a}_{\bullet}$ and a nonzero ideal $\mathfrak{q}$ such that $\nu$ $\mathscr{A}-$computes the jumping number…

Complex Variables · Mathematics 2024-12-12 Shijie Bao , Qi'an Guan , Zheng Yuan

The number of steps required in order to maximize a Bell inequality for arbitrary number of qubits is shown to grow exponentially with either the number of steps and the number of parties involved. The proof that the optimization of such…

Quantum Physics · Physics 2015-03-03 J. Batle , C. H. Raymond Ooi

We investigate the truth-table degrees of (co-)c.e.\ sets, in particular, sets of random strings. It is known that the set of random strings with respect to any universal prefix-free machine is Turing complete, but that truth-table…

Logic in Computer Science · Computer Science 2015-07-01 Mingzhong Cai , Rodney G Downey , Rachel Epstein , Steffen Lempp , Joseph Miller

Ramsey--Tur\'an theory considers Tur\'an type questions in Ramsey-context, asking for the existence of a small subgraph in a graph $G$ where the complement $\overline{G}$ lacks an appropriate subgraph $F$, such as a clique of linear size.…

Combinatorics · Mathematics 2024-11-28 Jie Han , Seonghyuk Im , Jaehoon Kim , Donglei Yang

We prove a Freiman--Ruzsa-type theorem with polynomial bounds in arbitrary abelian groups with bounded torsion, thereby proving (in full generality) a conjecture of Marton. Specifically, let $G$ be an abelian group of torsion $m$ (meaning…

Number Theory · Mathematics 2024-05-22 W. T. Gowers , Ben Green , Freddie Manners , Terence Tao

This paper discusses Tverberg-type theorems with coordinate constraints (i.e., versions of these theorems where all points lie within a subset $S \subset \mathbb{R}^d$ and the intersection of convex hulls is required to have a non-empty…

Metric Geometry · Mathematics 2019-01-30 Jesús A. De Loera , Thomas A. Hogan , Frédéric Meunier , Nabil Mustafa

This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…

Commutative Algebra · Mathematics 2009-02-13 Zur Izhakian , Louis Rowen

Suppose that $A \subset \mathbb{R}$ has positive upper density, \[ \limsup_{|I| \to \infty} \frac{|A \cap I|}{|I|} = \delta > 0,\] and $P(t) \in \mathbb{R}[t]$ is a polynomial with no constant or linear term, or more generally a non-flat…

Classical Analysis and ODEs · Mathematics 2019-01-08 Ben Krause

For a base $b\geq 2$ and a set of digits $\mathcal{A}\subset \{0,...,b-1\}$, let $\mathcal{P}$ denote the set of prime numbers with digits restricted to $\mathcal{A}$, when written in base-$b$. We prove that if $A\subset \mathbb{N}$ has…

Number Theory · Mathematics 2025-10-16 Alex Burgin

Let $T_R$ be a right $n$-tilting module over an arbitrary associative ring $R$. In this paper we prove that there exists a $n$-tilting module $T'_R$ equivalent to $T_R$ which induces a derived equivalence between the unbounded derived…

Rings and Algebras · Mathematics 2009-05-25 S. Bazzoni , F. Mantese , A. Tonolo

Let $\ell$ and $r$ be integers. A real number $\alpha \in [0,1)$ is a jump for $r$ if for any $\varepsilon > 0$ and any integer $m,\ m \geq r$, any $r$-uniform graph with $n > n_0(\varepsilon,m)$ vertices and at least \alpha+…

Combinatorics · Mathematics 2017-11-27 Ran Gu , Xueliang Li , Zhongmei Qin , Yongtang Shi , Kang Yang

The paper contains a proof for the P != NP hypothesis with the help of the two "natural" postulates. The postulates restrict capacity of the Turing machines and state that each independent and necessary condition of the problem should be…

Computational Complexity · Computer Science 2020-11-06 O. V. German