中文
相关论文

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

200 篇论文

A quadratic polynomial $\Phi_{a,b,c}(x,y,z)=x(ax+1)+y(by+1)+z(cz+1)$ is called universal if the diophantine equation $\Phi_{a,b,c}(x,y,z)=n$ has an integer solution $x,y,z$ for any non negative integer $n$. In this article, we show that if…

数论 · 数学 2017-01-12 Jangwon Ju , Byeong-Kweon Oh

A long-standing conjecture asserts that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has nonnegative coefficients whenever $m$ is a positive integer and $A$ and $B$ are any two $n \times n$ positive semidefinite Hermitian matrices. The…

算子代数 · 数学 2007-05-23 Christopher J. Hillar

The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and…

组合数学 · 数学 2020-10-21 Clément Lagisquet , Edita Pelantová , Sébastien Tavenas , Laurent Vuillon

The expression $a^n + b^n$ can be factored as $(a+b)(a^{n-1} - a^{n-2} b + a^{n-3} b^2 - ... + b^{n-1})$ when $n$ is an odd integer greater than one. This paper focuses on proving a few properties of the longer factor above, which we call…

综合数学 · 数学 2021-10-28 David Bodiu

We prove that for any positive integer c and any s > 0 there are representations of c as a sum a+b of two coprime positive integers a, b, such that the respective radicals are all greater than K(s)R(c)^(1-s)c^2. For the reprasentations in…

数论 · 数学 2007-05-23 Constantin M. Petridi

In this paper, we give a specific way of describing positive integer solutions of a Diophantine equation $(x+y)^2+(y+z)^2+(z+x)^2=12xyz$ and introduce a generalized cluster pattern behind it.

数论 · 数学 2022-09-20 Yasuaki Gyoda

We establish an analogue of the Goldbach conjecture for Laurent polynomials with positive integer coefficients.

数论 · 数学 2023-12-05 Sophia Liao , Harold Polo

Let $f$ be a polynomial with integer coefficients such that $f(n)$ positive for any positive integer $n$. We consider diverging sequences $\{ y_n\}$ given by $y_0 = b$ and $y_{n+1} = f^{y_n}(a)$ with positive integers $a$ and $b$. We show…

数论 · 数学 2022-11-30 Rin Gotou

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

综合数学 · 数学 2016-10-07 Dhananjay P. Mehendale

In 2013, Zhi-Wei Sun proposed a Romanov-type conjecture stating that every integer $n > 1$ can be written as $n = k + m$ with $k, m \ge 1$ such that $2^k + m$ is a prime. In this paper, we unconditionally prove that the natural numbers…

数论 · 数学 2026-05-18 Songlin Han , Jinbo Yu

Let $a,b,c$ be positive integers. It is known that there are infinitely many positive integers not representated by $ax^2+by^2+cz^2$ with $x,y,z\in\mathbb Z$. In contrast, we conjecture that any natural number is represented by $\lfloor…

数论 · 数学 2015-12-24 Zhi-Wei Sun

The Markov numbers are the positive integers that appear in the solutions of the equation $x^2+y^2+z^2=3xyz$. These numbers are a classical subject in number theory and have important ramifications in hyperbolic geometry, algebraic geometry…

数论 · 数学 2022-10-12 Kyungyong Lee , Li Li , Michelle Rabideau , Ralf Schiffler

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

组合数学 · 数学 2017-01-20 Xiang-dong Hou

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

组合数学 · 数学 2007-10-02 Sheng Chen , Nan Li

An integer-valued polynomial $P(x,y,z)$ is said to be universal (over $\mathbb Z$) if each nonnegative integer can be written as $P(x,y,z)$ with $x,y,z\in\mathbb Z$. In this paper, we mainly introduce a new technique to determine the…

数论 · 数学 2026-02-26 Nasser Abdo Saeed Bulkhali , Zhi-Wei Sun

The Erd\H{o}s-Straus conjecture, proposed in 1948 by Paul Erd\H{o}s and Ernst G. Straus, asks whether the Diophantine equation \[ \frac{4}{a} = \frac{1}{b} + \frac{1}{c} + \frac{1}{d} \] admits positive integer solutions $b, c, d \in…

数论 · 数学 2025-08-12 Bilal Ghermoul

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

数论 · 数学 2023-09-01 Luis H. Gallardo , Olivier Rahavandrainy

For positive integers $a,b,c$, and an integer $n$, the number of integer solutions $(x,y,z) \in \mathbb Z^3$ of $a \frac{x(x-1)}{2} + b \frac{y(y-1)}{2} + c \frac{z(z-1)}{2} = n$ is denoted by $t(a,b,c;n)$. In this article, we prove some…

数论 · 数学 2018-01-16 Mingyu Kim , Byeong-Kweon Oh

We show, assuming Schanuel's conjecture, that every irreducible complex polynomial in two variables where both variables appear has infinitely many algebraically independent solutions of the form (z,e^z).

数论 · 数学 2011-01-07 Ayhan Gunaydin , Amador Martin-Pizarro

We improve earlier work on the title equation (where $p$ and $q$ are primes and $c$ is a positive integer) by allowing $x$ and $y$ to be zero as well as positive. Earlier work on the title equation showed that, with listed exceptions, there…

数论 · 数学 2011-12-21 Reese Scott , Robert Styer