相关论文: Square root Bound on the Least Power Non-residue u…

The resolvent degree $\textrm{rd}_{\mathbb{C}}(n)$ is the smallest integer $d$ such that a root of the general polynomial $$f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$$ can be expressed as a composition of algebraic functions in at most $d$…

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$. We investigate the following problem: For which ratio $N/n$ and which functions, do we have pointwise convergence of the…

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

Let $r_k(n)$ denote the maximum cardinality of a set $A \subset \{1,2, \dots, n \}$ such that $A$ does not contain a $k$-term arithmetic progression. In this paper, we give a method of constructing such a set and prove the lower bound…

We consider the Steiner polynomial of a C^2 convex body K in R^n (n \leq 5). The opposites of the real parts of the roots of the Steiner polynomial are bounded below by the minimum value and above by the maximum value of the principal radii…

We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…

We address the fundamental network design problem of constructing approximate minimum spanners. Our contributions are for the distributed setting, providing both algorithmic and hardness results. Our main hardness result shows that an…

The nonnegative rank of a nonnegative matrix $X$ is the smallest number of nonnegative rank-one factors that sum to $X$. Since computing the nonnegative rank is NP-hard, it is common to circumvent this issue by computing lower and upper…

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

Littlewood asked how small the ratio $||f||_4/||f||_2$ (where $||.||_\alpha$ denotes the $L^\alpha$ norm on the unit circle) can be for polynomials $f$ having all coefficients in $\{1,-1\}$, as the degree tends to infinity. Since 1988, the…

In seminal work, Lov\'asz, Spencer, and Vesztergombi [European J. Combin., 1986] proved a lower bound for the hereditary discrepancy of a matrix $A \in \mathbb{R}^{m \times n}$ in terms of the maximum $|\det(B)|^{1/k}$ over all $k \times k$…

Let $p$ be a prime and $p_1,\ldots, p_r$ be distinct prime divisors of $p-1$. We prove that the smallest positive integer $n$ which is a simultaneous $p_1,\ldots,p_r$-power nonresidue modulo $p$ satisfies $$ n<p^{1/4 -…

In this paper, we study how small a box contains at least two points from a modular hyperbola $x y \equiv c \pmod p$. There are two such points in a square of side length $p^{1/4 + \epsilon}$. Furthermore, it turns out that either there are…

In this paper, we prove a quantitative version of the statement that every nonempty finite subset of $\mathbb{N}^+$ is a set of quadratic residues for infinitely many primes of the form $[n^c]$ with $1\leqslant c\leqslant243/205$.…

We consider equation systems of the form X_1 = f_1(X_1, ..., X_n), ..., X_n = f_n(X_1, ..., X_n) where f_1, ..., f_n are polynomials with positive real coefficients. In vector form we denote such an equation system by X = f(X) and call f a…

Let f be a degree d polynomial defined over the nonarchimedean field C_p, normalized so f is monic and f(0)=0. We say f is post-critically bounded, or PCB, if all of its critical points have bounded orbit under iteration of f. It is known…

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…

Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…