中文
相关论文

相关论文: Refined upper bounds for the linear Diophantine pr…

200 篇论文

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

代数几何 · 数学 2024-09-04 Boulos El Hilany , Sébastien Tavenas

Let $G$ be a finite group and let $ram^{t}(G)$ denote the minimal positive integer $n$ such that $G$ can be realized as the Galois group of a tamely ramified extension of $\mathbb{Q}$ ramified only at $n$ finite primes. Let $d(G)$ denote…

数论 · 数学 2016-11-15 Daniel Rabayev

In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…

数论 · 数学 2025-06-05 Sebastian Heintze , Volker Ziegler

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

数论 · 数学 2023-01-24 Reese Scott , Robert Styer

For a given finite set $\Sigma$ of matrices with nonnegative integer entries we study the growth of $$ \max_t(\Sigma) = \max\{\|A_{1}... A_{t}\|: A_i \in \Sigma\}.$$ We show how to determine in polynomial time whether the growth with $t$ is…

计算复杂性 · 计算机科学 2007-05-23 Raphaël Jungers , Vladimir Protasov , Vincent D. Blondel

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

数论 · 数学 2019-02-12 S. Subburam , J. Tanti

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

数论 · 数学 2015-10-19 Geoffrey B. Campbell , Aleksander Zujev

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

数论 · 数学 2025-10-15 Zeyu Cai

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

数论 · 数学 2025-10-08 Armand Noubissie

Let $F \in \mathbb Z[x, y]$ be an irreducible binary form of degree $d \geq 7$ and content one. Let $\alpha$ be a root of $F(x, 1)$ and assume that the field extension $\mathbb Q(\alpha)/\mathbb Q$ is Galois. We prove that, for every…

数论 · 数学 2022-06-29 Anton Mosunov

Let $d$ be a positive integer. Let $p$ be a prime number. Let $\alpha$ be a real algebraic number of degree $d+1$. We establish that there exist a positive constant $c$ and infinitely many algebraic numbers $\xi$ of degree $d$ such that…

数论 · 数学 2015-05-13 Yann Bugeaud , Bernard De Mathan

Let $P^+(n)$ denote the largest prime of the integer $n$. Using the \begin{align*}\Psi\_{F\_1\cdots F\_t}\left(\mathcal{K}\cap[-N,N]^d,N^{1/u}\right):=\\#\left\{\mathcal{K}\in…

数论 · 数学 2017-08-15 Armand Lachand

The matrix representation of the set $\Delta({\bf d}^3)$, ${\bf d}^3=(d_1,d_2, d_3)$, of the integers which are unrepresentable by $d_1,d_2,d_3$ is found. The diagrammatic procedure of calculation of the generating function $\Phi({\bf…

数论 · 数学 2007-05-23 Leonid G. Fel

We obtain a maximum principle, and "a priori" upper estimates for solutions of a class of non linear singular elliptic differential inequalities on Riemannian manifolds under the sole geometrical assumption of volume growth conditions.…

微分几何 · 数学 2007-05-23 Stefano Pigola , Marco Rigoli , Alberto G. Setti

Let $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab-a-b$ there exist $x,y\in\mathbb{Z}_{\geq 0}$, such that $d=ax+by$. As a byproduct, we obtain a constructive recursive algorithm for…

数论 · 数学 2025-06-26 Giorgos Kapetanakis , Ioannis Rizos

We resolve the open problem of characterizing the Frobenius number $g(A)$ for shifted square sequences $A = (a, a+1^2, \ldots, a+k^2)$, confirming a conjecture of Einstein et al. (2007). By combining a combinatorial reduction to an…

组合数学 · 数学 2026-04-13 Feihu Liu , Guoce Xin

Let $\Omega \subset \mathbb R^N$, $N \geq 2$, be a smooth bounded domain. We consider a boundary value problem of the form $$-\Delta u = c_{\lambda}(x) u + \mu(x) |\nabla u|^2 + h(x), \quad u \in H^1_0(\Omega)\cap L^{\infty}(\Omega)$$ where…

偏微分方程分析 · 数学 2018-11-02 Colette De Coster , Antonio J. Fernández , Louis Jeanjean

For a prime $p$, a restricted arithmetic progression in $\mathbb{F}_p^n$ is a triplet of vectors $x, x+a, x+2a$ in which the common difference $a$ is a non-zero element from $\{0,1,2\}^n$. What is the size of the largest $A\subseteq…

组合数学 · 数学 2024-12-23 Amey Bhangale , Subhash Khot , Dor Minzer

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

逻辑 · 数学 2014-10-21 Apoloniusz Tyszka

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

经典分析与常微分方程 · 数学 2012-05-07 Pedro J. Freitas , Shmuel Friedland , Gaspar Porta
‹ 上一页 1 8 9 10 下一页 ›