Jeffrey Lin Thunder
We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display good behavior in terms of the coefficients of the form, and greatly improve upon previous estimates in this regard.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.
On the number of solutions of decomposable form inequalities
本文将Thunder关于有限型可分解型不等式整数解个数的估计推广到本质有限型，并在二元型情形改进了Mahler 1933年的结果。
Finiteness criteria for the solutions of a sequence of decomposable form inequalities
本文研究了序列半$q$-可分解形式方程和不等式解的有限性准则，通过分解多项式来确定解的有限性。
A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree and bounded height. Moreover, we obtain asymptotic formulas for the number of decomposable monic polynomials of even degree. For example, the number of monic sextic integer polynomials which are decomposable and of height at most $H$ is asymptotic to $(16ζ(3)-5/4)H^3$ as $H \to \infty$.
We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say such a form is of finite type if the total volume of all real solutions to this inequality is finite and if, for every n'-dimensional subspace S\subseteq R^n defined over Q, the corresponding n'-dimensional volume for F restricted to S is also finite. We show that the number of integral solutions x \in Z^n to our inequality above is finite for all m if and only…
We classify the closed orbits under the action of maximal tori on the S-adic homogeneous spaces. As an application, we prove that if the set of values at the integer points of any homogeneous non-degenerate split form is discrete, then the form is multiple of a form with rational coefficients. Our result is related to the notable Littlewood conjecture.
Decomposable forms generated by linear recurrences
本研究针对满足同一关系的k个不同k阶齐次线性递推，证明其与k次可分解型相关并给出广义恒等式，推导了对应丢番图方程的无穷整数解，给出可分解型的因式分解方法及k=2、3的实例，所用工具为矩阵方法。
In this paper we prove that decomposable forms, or homogeneous polynomials $F(x_1, \cdots, x_n)$ with integer coefficients which split completely into linear factors over $\mathbb{C}$, take on infinitely many square-free values subject to simple necessary conditions and $\operatorname{deg} f \leq 2n + 2$ for all irreducible factors $f$ of $F$. This work generalizes a theorem of Greaves.
A set $\mathcal{A}\subset \mathbb{N}$ is called additively decomposable (resp. asymptotically additively decomposable) if there exist sets $\mathcal{B},\mathcal{C}\subset \mathbb{N}$ of cardinality at least two each such that $\mathcal{A}=\mathcal{B}+\mathcal{C}$ (resp. $\mathcal{A}Δ(\mathcal{B}+\mathcal{C})$ is finite). If none of these properties hold, the set $\mathcal{A}$ is called totally primitive. We define $\mathbb{Z}$-decomposability analogously with subsets $\mathcal{A,B,C}$ of $\mathbb{Z}$. Wirsing showed that almost all subsets of $\mathbb{N}$ are totally primitive. In this paper, …
The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many solutions in primes exist.
S-parts of values of univariate polynomials, binary forms and decomposable forms at integral points
本文利用 p-adic Thue-Siegel-Roth 定理与 p-adic 子空间定理等工具，改进并推广了多项式取值 S-部分的上界估计，证明了相应的渐近密度结果，并将结论扩展至二元型与可分解型。
For an integer b>=2, let s_b(n) be the sum of the digits of the integer n when written in base b, and let S_b(N) be the sum of s_b(n) over n=0,...,N-1, so that S_b(N) is the sum of all b-ary digits needed to write the numbers 0,1,...,N-1. Several inequalities are derived for S_b(N). Some of the inequalities can be interpreted as comparing the average value of s_b(n) over integer intervals of certain lengths to the average value of a beginning subinterval. Two of the main results are applied to derive a pair of "approximate convexity" inequalities for a sequence of Takagi-like functions. One of…
Let $F(x,y)$ be an irreducible binary form of degree $\geq 3$ with integer coefficients and with real roots. Let $M$ be an imaginary quadratic field, with ring of integers $Z_M$. Let $K>0$. We describe an efficient method how to reduce the resolution of the relative Thue inequalities \[ |F(x,y)|\leq K \;\; (x,y\in Z_M) \] to the resolution of absolute Thue inequalities of type \[ |F(x,y)|\leq k \;\; (x,y\in Z). \] We illustrate our method with an explicit example.
Following a method originally due to Siegel, we establish upper bounds for the number of primitive integer solutions to inequalities of the shape $0<|F(x, y)| \leq h$, where $F(x , y) =(αx + βy)^r -(γx + δy)^r \in \mathbb{Z}[x ,y]$, $α$, $β$, $γ$ and $δ$ are algebraic constants with $αδ-βγ\neq 0$, and $r \geq 3$ and $h$ are integers. As an important application, we pay special attention to the binomial Thue's inequaities $|ax^r - by^r| \leq c$. The proofs are based on the hypergeometric method of Thue and Siegel and its refinement by Evertse.
In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the $c(m,n)$ are defined by \[ \frac{1}{(sq^a,sq^{M-a};q^M)_{\infty}}-\frac{1}{(sq^b,sq^{M-b};q^M)_{\infty}}:=\sum_{m,n\geq 0} c(m,n)s^m q^n, \] then $c(m, Mn)\geq 0$ for all integers $m\geq 0, n\geq 0$. %If, in addition, $M$ is even, then $c(m, Mn+M/2)\geq 0$ for all integers $m\geq 0, n\geq 0$. A similar result is proved for the integers $d(m,n)$ defined by \[ (-…
Certain positive $q$-series and inequalities for two-color partitions
本文研究依赖于正整数对$(k,m)$的$q$-级数的正性问题，通过将其与带权重的双色整数分拆生成函数相联系，推导出关于这些分拆的不等式。
Denote by $s_0^{(r)}$ the least integer such that if $s \ge s_0^{(r)}$, and $F$ is a cubic form with real coefficients in $s$ variables that splits into $r$ parts, then $F$ takes arbitrarily small values at nonzero integral points. We bound $s_0^{(r)}$ for $r \le 6$.
We will give an explicit upper bound for the number of solutions to cubic inequality |F(x, y)| \leq h, where F(x, y) is a cubic binary form with integer coefficients and positive discriminant D. Our upper bound is independent of h, provided that h is smaller than D^{1/4}.
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ θ,$ where $ θ>2$ is real and non-integral. For fixed non-zero real numbers $ λ_i $ not all of the same sign we write \begin{equation*} \mathcal F (\textbf{x}) = λ_1 x_1^θ+ \cdots + λ_s x_s^θ. \end{equation*} For a fixed positive real number $ τ$ we give an asymptotic formula for the number of positive integer solutions of the inequality $ | \mathcal F (\textbf{x}) | < τ$ inside a box of side length $P.$ Moreover, we investigate the problem of representing a large positive real number by a positiv…
Let $λ_i, μ_j$ be non-zero real numbers not all of the same sign and let $a_i, b_k$ be non-zero integers not all of the same sign. We investigate a mixed Diophantine system of the shape \begin{equation*} \begin{cases} \left| λ_1 x_1^θ+ \cdots + λ_\ell x_\ell^θ+ μ_1 y_1^θ+ \cdots + μ_m y_m^θ\right| < τ\\[10pt] a_1 x_1^d + \cdots a_\ell x_\ell^d + b_1 z_1^d + \cdots + b_n z_n^d =0, \end{cases} \end{equation*} where $ d\geq 2 $ is an integer, $ θ> d+1$ is real and non-integral and $ τ$ is a positive real number. For such systems we obtain an asymptotic formula for the number of positive integer s…
This paper concerns the values of the Euler phi-function evaluated simultaneously on k arithmetic progressions a_1 n + b_1, a_2 n + b_2, ..., a_k n + b_k. Assuming the necessary condition that no two of the polynomials a_i x + b_i are constant multiples of each other, we show that there are infinitely many integers n for which phi(a_1 n + b_1) > phi(a_2 n + b_2) > ... > phi(a_k n + b_k). In particular, there exist infinitely many strings of k consecutive integers whose phi-values are arranged from largest to smallest in any prescribed manner. Also, under the necessary condition ad \ne bc, any …
Given positive real numbers, we prove two inequalities involving their potential energy and their power sums. We also prove an inequality involving the energy and the discriminant and apply it to deduce a result on totally positive irreducible polynomials.
For any given non-square integer $ D\equiv 0,1 \pmod{4} $, we prove Euclid's type inequalities for the sequence $ \{q_{i}\} $ of all primes satisfying the Kronecker symbol $ (D/q_{i})=-1 $, $ i=1,2,\cdots, $ and give a new criterion on a ternary quadratic form to be irregular as an application, which simplifies Dickson and Jones's argument in the classification of regular ternary quadratic forms to some extent.
In this paper we prove several inequalities for binomial coefficients. For instance, if $ k$ and $n$ are positive integers such that $n\ge 400$ and $[\frac n5]\le k\le [\frac n2]$, where $[x]$ is the greatest integer not exceeding $x$, then $$\binom nk<\Big(1-\frac{5(k-[\f n5])}{6n^2}\Big) \frac{n^{n-\f 12}}{k^k(n-k)^{n-k}}.$$
Large sieve inequalities with power moduli and Waring's problem
本文通过将大筛法不等式与华林问题的受限变体关联，并利用经典除数界和 Wooley 的指数和均值结果，改进了所有 k≥4 情形下带 k 次幂模的大筛法不等式，同时给出了基于 Hardy-Littlewood 猜想公式的条件性结果。
We provide some general conditions which ensure that a system of inequalities involving homogeneous polynomials with coefficients in a S-adic field has nontrivial S-integral solutions. The proofs are based on the strong approximation property for Zariski-dense subgroups and adelic geometry of numbers. We give two examples of applications for systems involving quadratic and linear forms.
We study difference inequality systems for the 3x+1 problem introduced by the first author in 1989. These systemes can be used to give lower bounds for the number of integers below x that contain 1 in their forward orbit under the 3x+1 map. Previous methods gave away some information in these inequalities. We give an improvement which apparantly extracts full information from the inequalities. By computer aided proof we show that at least x^{0.84} of the integers below x contain 1 in their forward orbit under the 3x+1 map.
Arithmetic probability measures
本文研究复平面紧子集上由代数整数伽罗瓦共轭极限分布产生的算术概率测度，证明该类测度只需验证两个条件即可满足无穷多积分不等式，特定紧集下等价于检查两个整数多项式对应的不等式。
Assume that $ y < N$ are integers, and that $ (b,y) =1$. Define an average along the primes in a progression of diameter $ y$, given by integer $ (b,y)=1 $. \begin{align*} A_{N,y,b} := \frac{ϕ(y)}{N} \sum _{\substack{n <N\\n\equiv b\pmod{y}}} Λ(n) f(x-n) \end{align*} Above, $Λ$ is the von Mangoldt function and $ϕ$ is the totient function. We establish improving and maximal inequalities for these averages. These bounds are uniform in the choice of progression. For instance, for $ 1< r < \infty $ there is an integer $N _{y, r}$ so that \begin{align*} \lVert \sup _{N>N _{y,r}} \lvert A_{N,y,b} f …
Asymptotics and inequalities for the distinct partition function
本文研究了偏移不同划分函数的渐近分析与不等式，推导出四次二元形式不变量及相关不等式的精确阈值。
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of partitions into odd parts and the generating function for the number of odd divisors.
Inequalities among higher-order difference sets, or, remarks on a construction of Ruzsa
通过扩展Ruzsa的一个鲜为人知的构造，刻画了使得对所有有限集A⊆ℤ不等式|sA-tA|≤|uA-vA|成立的非负整数四元组(s,t,u,v)。
On general approach to Bessenrodt-Ono type inequalities and log-concavity property
本文提出一种一般方法，在温和条件下证明满足特定增长性质的函数具有Bessenrodt-Ono型不等式，并给出对数凹性条件下的充分条件。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。