中文
相关论文

相关论文: Incomplete Quadratic Exponential Sums in Several V…

200 篇论文

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

数论 · 数学 2011-08-26 Michael Coons

Let $K=\mathbb{Q}(\omega)$ with $\omega$ the root of a degree $n$ monic irreducible polynomial $f\in\mathbb{Z}[X]$. We show the degree $n$ polynomial $N(\sum_{i=1}^{n-k}x_i\omega^{i-1})$ in $n-k$ variables formed by setting the final $k$…

数论 · 数学 2019-10-30 James Maynard

Consider a system F of n polynomials in n variables, with a total of n+k distinct exponent vectors, over any local field L. We discuss conjecturally tight bounds on the maximal number of non-degenerate roots F can have over L, with all…

代数几何 · 数学 2013-09-03 Kaitlyn Phillipson , J. Maurice Rojas

Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials, via the definition of convexity, its first order characterization, and its second order…

最优化与控制 · 数学 2013-12-31 Amir Ali Ahmadi , Pablo A. Parrilo

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

数论 · 数学 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

组合数学 · 数学 2025-10-13 Manik Dhar , Sammy Luo

We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…

最优化与控制 · 数学 2025-08-05 Ahmad Al-Sulami , Hamza Fawzi , Shengding Sun

We prove that any stable method for resolving the Gibbs phenomenon - that is, recovering high-order accuracy from the first $m$ Fourier coefficients of an analytic and nonperiodic function - can converge at best root-exponentially fast in…

数值分析 · 数学 2013-02-04 Ben Adcock , Anders C. Hansen , Alexei Shadrin

We find a polynomial in three variables whose values at nonnegative integers satisfy the Erd\H{o}s-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long…

数论 · 数学 2012-05-01 Manuel Bello-Hernández , Manuel Benito , Emilio Fernández

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg…

组合数学 · 数学 2016-11-17 Antal Balog , Oliver Roche-Newton , Dmitry Zhelezov

Maximum satisfiability is a canonical NP-hard optimization problem that appears empirically hard for random instances. Let us say that a Conjunctive normal form (CNF) formula consisting of $k$-clauses is $p$-satisfiable if there exists a…

概率论 · 数学 2007-05-23 Dimitris Achlioptas , Assaf Naor , Yuval Peres

We use the resolution of singularities algorithm of [G4] to provide new estimates for exponential sums as well as new bounds on how often a function f(x) such as a polynomial with integer coefficients is divisible by various powers of a…

经典分析与常微分方程 · 数学 2014-12-11 Michael Greenblatt

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

数论 · 数学 2026-03-09 Jake Chinis , Besfort Shala

We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.

概率论 · 数学 2007-05-23 B. M. Migdashiev , E. I. Ostrovsky

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

泛函分析 · 数学 2017-06-13 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

In this paper we continue our study, begun in part I, of the exceptional set of integers, not restricted by elementary congruence conditions, which cannot be represented as sums of three or four squares of primes. We correct a serious…

数论 · 数学 2010-08-23 Glyn Harman , Angel Kumchev

We study symmetric nonnegative forms and their relationship with symmetric sums of squares. For a fixed number of variables $n$ and degree $2d$, symmetric nonnegative forms and symmetric sums of squares form closed, convex cones in the…

最优化与控制 · 数学 2020-02-18 Grigoriy Blekherman , Cordian Riener

Let $(A,\mathfrak{m})$ be a complete intersection of dimension $d \geq 1$ and codimension $c \geq 1$. Let $I$ be an $\mathfrak{m}$-primary ideal and let $M$ be a finitely generated $A$-module. For $i \geq 1$ let $\psi_i^I(M)$ be the degree…

交换代数 · 数学 2025-02-25 Tony J. Puthenpurakal