中文
相关论文

相关论文: Improved Bounds on Sarkozy's Theorem for Quadratic…

200 篇论文

Let $P_{<n}(z)$ be the Rudin-Shapiro polynomial of degree $n-1$. We show that $|P_{<n}(z)|\le \sqrt{6n-2}-1$ for all $n\ge0$ and $|z|=1$, confirming a longstanding conjecture. This bound is sharp in the case when $n=(2\cdot 4^k+1)/3$ and…

经典分析与常微分方程 · 数学 2019-09-20 Paul Balister

Let $\mathcal{N} \neq \{0\}$ be a fixed set of integers, closed under multiplication, closed under negation, or containing $\{\pm 1\}$. We prove that any zero of a polynomial in $\mathbf{Z}[X]$ whose coefficients lie in $\mathcal{N}$ can be…

动力系统 · 数学 2024-12-13 David Hokken

An exponent of distribution 1/16 is established for square-free palindromes. The main input is an upper bound for the number of palindromes, in arithmetic progressions to large moduli, divisible by large squares. Our argument combines a…

数论 · 数学 2026-03-31 Aleksandr Tuxanidy

Let $R$ be a polynomial ring in $N$ variables over an arbitrary field $K$ and let $I$ be an ideal of $R$ generated by $n$ polynomials of degree at most 2. We show that there is a bound on the projective dimension of $R/I$ that depends only…

交换代数 · 数学 2011-06-07 Tigran Ananyan , Melvin Hochster

We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix…

最优化与控制 · 数学 2022-07-06 Feng Guo , Sizhuo Yan , Lihong Zhi

We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamaszek and Wiese \cite{aw-asmwi-13, aw-qmwis-14} to polygons of…

计算几何 · 计算机科学 2013-12-06 Sariel Har-Peled

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

经典分析与常微分方程 · 数学 2007-12-04 Luc Vinet , Alexei Zhedanov

We prove the existence of complex polynomials $p(z)$ of degree $n$ and $q(z)$ of degree $m<n$ such that the harmonic polynomial $ p(z) + \overline{q(z)}$ has at least $\lceil n \sqrt{m} \rceil$ many zeros. This provides an array of new…

复变函数 · 数学 2023-09-01 Erik Lundberg

Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…

数论 · 数学 2024-11-22 Lenny Fukshansky , Sehun Jeong

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

数论 · 数学 2020-08-03 Anuj Jakhar , Srinivas Koytada

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

数论 · 数学 2009-06-11 Lenny Fukshansky

In 2002 Dimitar Dimitrov posted the problem of finding the optimal polynomials that provide the sharpness of Koebe Quarter Theorem for polynomials and asked whether Suffridge polynomials are optimal ones. We disproved Dimitrov's conjecture…

复变函数 · 数学 2018-08-28 Dmitriy Dmitrishin , Ivan Skrinnik , Andrey Smorodin , Alex Stokolos

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

综合数学 · 数学 2015-04-03 N. A. Carella

Bounding the number of preperiodic points of quadratic polynomials with rational coefficients is one case of the Uniform Boundedness Conjecture in arithmetic dynamics. Here, we provide a general framework that may reduce finding periodic…

数论 · 数学 2015-04-17 Zhiming Wang , Robin Zhang

Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known…

组合数学 · 数学 2009-04-01 Vladimir Nikiforov

We prove that the largest $Q_2$-free family of subsets of $[n]$ which contains sets of at most three different sizes has at most $(3 + 2\sqrt {3})N/3 + o(N) \approx 2.1547N + o(N)$ members, where $N = {n \choose {\lfloor n/2 \rfloor}}$.…

组合数学 · 数学 2011-08-23 Jacob Manske , Jian Shen

We investigate the uniform approximation provided by least squares polynomials on the unit Euclidean sphere $\mathbb{S}^q$ in $\mathbb{R}^{q+1}$, with $q\ge 2$. Like any other polynomial projection, the study concerns the growth, as the…

数值分析 · 数学 2018-08-13 Woula Themistoclakis , Marc Van Barel

Given a sequence of complex numbers {\rho}_n, we study the asymptotic distribution of the sets of parameters c {\epsilon} C such that the quadratic maps z^2 +c has a cycle of period n and multiplier {\rho}_n. Assume 1/n.log|{\rho}_n| tends…

动力系统 · 数学 2013-06-13 Xavier Buff , Thomas Gauthier

The theory of continued fractions of functions $ \sqrt D $ is used to give lower bound for class numbers $h(D)$ of general real quadratic function fields $K=k(\sqrt D)$ over $k={\bf F}_q(T)$. For five series of real quadratic function…

数论 · 数学 2007-05-23 Kunpeng Wang , Xianke Zhang

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

组合数学 · 数学 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy