中文
相关论文

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

200 篇论文

We give an improved upper bound for the Gr\"unbaum--Hadwiger--Ramos problem: Let $d,n,k \in \mathbb{N}$ such that $d \geq 2^n(1+2^{k-1})$. Given $2^{n+1}$ masses on $\mathbb{R}^d$, there exist $k$ hyperplanes in $\mathbb{R}^d$ that…

组合数学 · 数学 2022-03-28 Jonathan Kliem

A good range of problems on trees can be described by the following general setting: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, we need to estimate the largest possible absolute value…

组合数学 · 数学 2025-07-15 Vuong Bui

Let $S=\left\langle s_1,\ldots,s_n\right\rangle$ be a numerical semigroup generated by the relatively prime positive integers $s_1,\ldots,s_n$. Let $k\geqslant 2$ be an integer. In this paper, we consider the following $k$-power variant of…

数论 · 数学 2022-05-25 Jonathan Chappelon , Jorge Luis Ramírez Alfonsín

Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming…

离散数学 · 计算机科学 2016-10-03 Sergey Bereg , Avi Levy , I. Hal Sudborough

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-08-01 Chaohua Jia

Let $n$ be a non-zero integer. A set $S$ of positive integers is a Diophantine tuple with the property $D(n)$ if $ab+n$ is a perfect square for each $a,b \in S$ with $a \neq b$. It is of special interest to estimate the quantity $M_n$, the…

数论 · 数学 2025-05-14 Chi Hoi Yip

Let E_n={x_k=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. For any integer n \geq 2214, we define a system T \subseteq E_n which has a unique integer solution (a_1,...,a_n). We prove that the numbers a_1,...,a_n are positive and…

数论 · 数学 2015-10-05 Apoloniusz Tyszka

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

数论 · 数学 2023-12-15 Yuhui Liu

We consider the Diophantine inequality \[ \left| p_1^{c} + p_2^{c} + p_3^c- N \right| < (\log N)^{-E} , \] where $1 < c < \frac{15}{14}$, $N$ is a sufficiently large real number and $E>0$ is an arbitrarily large constant. We prove that the…

数论 · 数学 2017-01-27 D. I. Tolev

The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$ and finding the Frobenius number is called the Frobenius problem. In this paper, we introduce the Frobenius problem for numerical…

数论 · 数学 2017-08-24 Kyunghwan Song

We investigate the existence, non-existence, uniqueness, and multiplicity of positive solutions to the following problem: \begin{align}\label{P} \left\{ \begin{array}{l} D_{0+}^\alpha u + h(t)f(u) = 0, \quad 0<t<1, \\[1ex] u(0)=u(1)=0,…

偏微分方程分析 · 数学 2026-01-21 Inbo Sim , Satoshi Tanaka

For $ k \geq 2 $, let $ A = (a_{1}, a_{2}, \ldots, a_{k}) $ be a $k$-tuple of positive integers with $\gcd(a_{1}, a_2, \ldots, a_k) = 1$. For a non-negative integer $s$, the generalized Frobenius number of $A$, denoted as $\mathtt{g}(A;s) =…

数论 · 数学 2025-01-16 Kittipong Subwattanachai

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

数论 · 数学 2015-05-13 Mihai Cipu , Maurice Mignotte

We consider the Gaussian limit law for the distribution of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an optimal bound for the speed of convergence, thereby improving on previous estimates…

数论 · 数学 2025-04-29 Jonathan Rotgé

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

数论 · 数学 2012-04-10 Aran Nayebi

Let $f(m)$ be the largest integer such that for every set $A = \{a_1 < \cdots < a_m\}$ of $m$ positive integers and every open interval $I$ of length $2a_m$, there exist at least $f(m)$ disjoint pairs $(a, b)$ with $a \in A$ dividing $b \in…

组合数学 · 数学 2026-03-31 Wouter van Doorn , Yanyang Li , Quanyu Tang

Let $F \in \mathbb{Z}[x_1, \ldots, x_n]$ be a homogeneous form of degree $d \geq 2$, and let $V_F^*$ denote the singular locus of the affine variety $V(F) = \{ \mathbf{z} \in {\mathbb{C}}^n: F(\mathbf{z}) = 0 \}$. In this paper, we prove…

数论 · 数学 2021-05-27 Shuntaro Yamagishi

By employing the assessment of the asymptotic size of various sums of G\'{a}l studied by La Bret\`eche and Tenenbaum, we provide an improvement on the recent result of A. Bondarenko, P. Darbar, M. V. Hagen, W. Heap, and K. Seip regarding…

数论 · 数学 2023-07-17 Patrick Nyadjo Fonga

Let $A$ be a finite set of relatively prime positive integers, and let $S(A)$ be the set of all nonnegative integral linear combinations of elements of $A$. The set $S(A)$ is a semigroup that contains all sufficiently large integers. The…

数论 · 数学 2020-04-17 Melvyn B. Nathanson

In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…

数论 · 数学 2026-04-10 Moni Kumari , Prabhat Kumar Mishra , Jyotirmoy Sengupta