中文
相关论文

相关论文: On Pseudosquares and Pseudopowers

200 篇论文

We prove uniform ``pseudo-Siegel'' a priori bounds for Siegel disks of bounded type that give a uniform control of oscillations of their boundaries in all scales. As a consequence, we construct the Mother Hedgehog controlling the…

动力系统 · 数学 2024-12-31 Dzmitry Dudko , Mikhail Lyubich

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

应用统计 · 统计学 2016-12-20 Roger Bilisoly

Given a prime $p$, we consider the dynamical system generated by repeated exponentiations modulo $p$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod p$ and $0 \le f_g(u) \le p-1$. This map is in particular used in a…

数论 · 数学 2009-08-28 Lev Glebsky , Igor E. Shparlinski

We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph $G$ is $(\varepsilon,p,k,\ell)$-pseudorandom if for all disjoint $X$ and $Y\subset V(G)$…

组合数学 · 数学 2014-02-07 Peter Allen , Julia Böttcher , Hiep Hàn , Yury Person , Yoshiharu Kohayakawa

We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…

最优化与控制 · 数学 2021-11-23 Yang Zheng , Giovanni Fantuzzi

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

数论 · 数学 2017-05-12 Alessandro Languasco , Alessandro Zaccagnini

Let $S(a,b)$ denote the normalized Dedekind sum. We study the range of possible values for $S(a,b)=\frac{k}{q}$ with $\gcd(k,q)=1$. Girstmair proved local restrictions on $k$ depending on $q\pmod{12}$ and whether $q$ is a square and…

数论 · 数学 2018-12-27 Michael Kural

Motivated by questions of Fouvry and Rudnick on the distribution of Gaussian primes, we develop a very general setting in which one can study inequities in the distribution of analogues of primes through analytic properties of infinitely…

数论 · 数学 2025-12-01 Lucile Devin

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

数论 · 数学 2024-01-22 Gareth A. Jones , Alexander K. Zvonkin

We survey the potential for progress in additive number theory arising from recent advances concerning major arc bounds associated with mean value estimates for smooth Weyl sums. We focus attention on the problem of representing large…

数论 · 数学 2024-02-16 Joerg Bruedern , Trevor D. Wooley

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

数论 · 数学 2021-07-12 Asif Zaman

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

代数几何 · 数学 2010-10-27 J. Maurice Rojas , Swaminathan Sethuraman

We prove that an odd number is an Euler pseudoprime for exactly one half of the admissible bases if and only if it is a special Carmichael number.

数论 · 数学 2011-09-19 Lorenzo Di Biagio

We introduce a new class of pseudoprimes-so called "overpseudoprimes" which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime iff value…

数论 · 数学 2012-03-19 Vladimir Shevelev

We compute integral moments of partial sums of the Riemann zeta function on the critical line and obtain an expression for the leading coefficient as a product of the standard arithmetic factor and a geometric factor. The geometric factor…

数论 · 数学 2007-05-23 Brian Conrey , Alex Gamburd

We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…

组合数学 · 数学 2017-02-15 Sami Assaf

This note is an attempt to attack a conjecture of Fraenkel and Simpson stated in 1998 concerning the number of distinct squares in a finite word. By counting the number of (right-)special factors, we give an upper bound of the number of…

组合数学 · 数学 2022-04-01 Shuo Li

Using a generalization due to Lerch [M. Lerch, Sur un th\'{e}or\`{e}me de Zolotarev. Bull. Intern. de l'Acad. Fran\c{c}ois Joseph 3 (1896), 34-37] of a classical lemma of Zolotarev, employed in Zolotarev's proof of the law of quadratic…

数论 · 数学 2015-01-22 Emmanuel Tsukerman

This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…

泛函分析 · 数学 2024-05-14 Igor Klep , Victor Magron , Jurij Volčič

Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We provide an explicit example of a convex form of degree four in…

最优化与控制 · 数学 2022-08-23 James Saunderson