中文
相关论文

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

200 篇论文

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

数论 · 数学 2018-08-20 Apoloniusz Tyszka

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

组合数学 · 数学 2026-01-05 Robert Coulter , Steven Senger

In this paper, we solve the simultaneous Diophantine equations m.(x_1^k+....+x_{t_1}^k)=n.(y_1^k+....+y_{t_2}^k); k=1,3, where t_1, t_2>3, and m, n are fixed arbitrary and relatively prime positive integers. This is done by choosing two…

数论 · 数学 2017-05-04 Farzali Izadi , Mehdi Baghalaghdam

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

数论 · 数学 2021-11-11 Kalyan Chakraborty , Azizul Hoque

We give upper bounds for the number of integral solutions of bounded height to a system of equations $f_i(x_1,\ldots,x_n) = 0$, $1 \leq i \leq r$, where the $f_i$ are polynomials with integer coefficients. The estimates are obtained by…

数论 · 数学 2016-07-07 Oscar Marmon

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

数论 · 数学 2021-08-02 Constantinos Poulias

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

数论 · 数学 2018-05-09 Christian Elsholtz , Stefan Planitzer

For the positive integer $n$, let $f(n)$ denote the number of positive integer solutions $(n_1,\,n_2,\,n_3)$ of the Diophantine equation $$ {4\over n}={1\over n_1}+{1\over n_2}+{1\over n_3}. $$ For the prime number $p$, $f(p)$ can be split…

数论 · 数学 2011-07-28 Chaohua Jia

Consider a sum $S_n=v_i\varepsilon_1+\cdots+v_n\varepsilon_{n}$, where $(v_i)^{n}_{i=1}$ are non-zero vectors in $\mathbb{R}^{d}$ and $(\varepsilon_i)^{n}_{i=1}$ are independent Rademacher random variables (i.e.,…

概率论 · 数学 2019-10-23 Dainius Dzindzalieta , Tomas Juškevičius

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…

经典分析与常微分方程 · 数学 2014-06-26 Pascal Auscher , Sebastian Stahlhut

In the present work, we discuss the existence of a unique positive solution of a boundary value problem for nonlinear fractional order equation with singularity. Precisely, order of equation $D_{0+}^\alpha u(t)=f(t,u(t))$ belongs to $(3,4]$…

经典分析与常微分方程 · 数学 2016-05-31 E. T. Karimov , K. Sadarangani

The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…

度量几何 · 数学 2007-05-23 Julian Pfeifle , Günter M. Ziegler

For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For…

组合数学 · 数学 2018-08-07 Bart Litjens , Sven Polak , Alexander Schrijver

Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the…

数论 · 数学 2024-05-01 Mircea Cimpoeas

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

综合数学 · 数学 2014-04-04 N. A. Carella

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

代数几何 · 数学 2012-05-10 Aleksandr Pukhlikov

For two relatively prime square-free positive integers $a$ and $b$, we study integers of the form $a p+b P_{2}$ and give a new lower bound for the number of such representations, where $a p$ and $b P_{2}$ are both square-free, $p$ denote a…

数论 · 数学 2025-08-20 Runbo Li

Consider a sequence of positive integers of the form $ca^n-d$, $n\geq 1$, where $a, c$ and $d$ are positive integers, $a>1$. For each $n\geq 1$, let $S_n$ be the submonoid of $\mathbb N$ generated by $\mathbf s_j=ca^{n+j}-d$, with…

数论 · 数学 2023-01-25 Fabián Arias , Jerson Borja

The anti-maximum principle for the homogeneous Dirichlet problem to $-\Delta_p u = \lambda |u|^{p-2}u + f(x)$ with positive $f \in L^\infty(\Omega)$ states the existence of a critical value $\lambda_f > \lambda_1$ such that any solution of…

偏微分方程分析 · 数学 2020-07-13 Vladimir Bobkov , Pavel Drabek , Yavdat Il'yasov

We consider a generalization of the Frobenius Problem where the object of interest is the greatest integer which has exactly $j$ representations by a collection of positive relatively prime integers. We prove an analogue of a theorem of…