中文
相关论文

相关论文: Je{\'s}manowicz' conjecture for polynomials

200 篇论文

We study higher-dimensional analogs of the Dedekind-Carlitz polynomials c(u,v;a,b) := sum_{k=1..b-1} u^[ka/b] v^(k-1), where u and v are indeterminates and a and b are positive integers. Carlitz proved that these polynomials satisfy the…

数论 · 数学 2008-12-20 Matthias Beck , Christian Haase , Asia R. Matthews

In this paper we establish some new results similar to Lagrange's four-square theorem. For example, we prove that any integer $n>1$ can be written as $w(5w+1)/2+x(5x+1)/2+y(5y+1)/2+z(5z+1)/2$ with $w,x,y,z\in\mathbb Z$. Let $a$ and $b$ be…

数论 · 数学 2024-12-06 Zhi-Wei Sun

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

数论 · 数学 2016-03-22 Christian Reiher

A natural question about Dedekind sums is to find conditions on the integers $a_1, a_2$, and $b$ such that $s(a_1,b) = s(a_2, b)$. We prove that if the former equality holds then $ b \ | \ (a_1a_2-1)(a_1-a_2)$. Surprisingly, to the best of…

数论 · 数学 2011-05-13 Stanislav Jabuka , Sinai Robins , Xinli Wang

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

交换代数 · 数学 2012-10-25 William Messing , Victor Reiner

Let $d>r\ge 0$ be integers. For positive integers $a,b,c$, if any term of the arithmetic progression $\{r+dn:\ n=0,1,2,\ldots\}$ can be written as $ax^2+by^2+cz^2$ with $x,y,z\in\mathbb{Z}$, then the form $ax^2+by^2+cz^2$ is called…

数论 · 数学 2024-01-12 Hai-Liang Wu , Zhi-Wei Sun

A class P_{n,m,p}(x) of polynomials is defined. The combinatorial meaning of its coefficients is given. Chebyshev polynomials are the special cases of P_{n,m,p}(x). It is first shown that P_{n,m,p}(x) may be expressed in terms of…

复变函数 · 数学 2008-04-15 Milan Janjic

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

数论 · 数学 2016-03-17 Yan Kun , Li Hou Biao

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

群论 · 数学 2014-02-26 Christopher J. Hillar , Lionel Levine , Darren Rhea

We introduce and study the \emph{Rademacher-Carlitz polynomial} \[ \RC(u, v, s, t, a, b) := \sum_{k = \lceil s \rceil}^{\lceil s \rceil + b - 1} u^{\fl{\frac{ka + t}{b}}} v^k \] where $a, b \in \Z_{>0}$, $s, t \in \R$, and $u$ and $v$ are…

数论 · 数学 2016-06-07 Matthias Beck , Florian Kohl

In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.

综合数学 · 数学 2019-04-02 Huan Xiao

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…

数论 · 数学 2014-04-15 Harald Andrés Helfgott

We prove a conjecture posted in the Online Encyclopedia of Integer Sequences, namely that there are exactly five positive integers that can be written in more than one way as the sum of a nonnegative power of 2 and a nonnegative power of 3.…

数论 · 数学 2019-07-11 Douglas Edward Iannucci

Je retracerai l'histoire des conjectures de Weil sur le nombre de solutions d'\'equations polynomiales dans un corps fini et quelques unes des approches qui ont \'et\'e propos\'ees pour les r\'esoudre. The Weil conjectures: origins,…

数论 · 数学 2022-11-28 Antoine Chambert-Loir

Erd\H{o}s and Szekeres showed in 1978 that for any four positive integers satisfying m_1+m_2 = n_1+n_2, the two binomial coefficients (m_1+m_2)!/m_1! m_2! and (n_1+n_2)!/n_1! n_2! have a common divisor >1. The analogous statement for…

数论 · 数学 2013-05-10 George M. Bergman

Let $P(x)$ be a polynomial of degree $m$, with nonnegative and non-decreasing coefficients. We settle the conjecture that for any positive real number $d$, the coefficients of $P(x+d)$ form a unimodal sequence, of which the special case $d$…

组合数学 · 数学 2008-09-10 Yi Wang , Yeong-Nan Yeh

We study the Goldbach problem for primes represented by the polynomial $x^2+y^2+1$. The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even…

数论 · 数学 2018-01-31 Joni Teräväinen

Catalan's conjecture claims that the Diophantine equation $x^p-y^q=1$ admits the unique solution $3^2-2^3=1$ in integers $x,y,p,q \ge 2$. The conjecture has been finally proved by P. Mih\u{a}ilescu (2002) using the theory of cyclotomic…

数论 · 数学 2017-02-14 Paolo Leonetti

The celebrated (First) Borwein Conjecture predicts that for all positive integers~$n$ the sign pattern of the coefficients of the ``Borwein polynomial'' $$(1-q)(1-q^2)(1-q^4)(1-q^5) \cdots(1-q^{3n-2})(1-q^{3n-1})$$ is $+--+--\cdots$. It was…

组合数学 · 数学 2022-02-01 Chen Wang , Christian Krattenthaler

For the two sixth-order polynomials $a(s)$ and $b(s),$ Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial $c(s)$ such that $c(s)/a(s)$ and $c(s)/b(s)$ are both strictly positive real.…

最优化与控制 · 数学 2007-05-23 Long Wang