C. L. Stewart, Stanley Yao Xiao
Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d$ at least $3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. We prove that there is a positive number $C_F$ such that $R_F(Z)$ is asymptotic to $C_F Z^{\frac{2}{d}}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In this note we show that for a given irreducible binary quadratic form $f(x,y)$ with integer coefficients, whenever we have $f(x,y) = f(u,v)$ for integers $x,y,u,v$, there exists a rational automorphism of $f$ which sends $(x,y)$ to $(u,v)$.
Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational integers with absolute value at most s by f, as s tends to infinity.
We prove that for any countable set $A$ of real numbers, the set of binary indefinite quadratic forms $Q$ such that the closure of $Q(\mathbb{Z}^2)$ is disjoint from $A$ has full Hausdorff dimension.
We prove part of a conjecture of Borwein and Choi concerning an estimate on the square of the number of solutions to n=x^2+Ny^2 for a squarefree integer N.
Number of integers represented by families of binary forms
本文把分圆形式取值整数个数的既有结论推广到一般整系数二元形式族，核心是给出次数大于3的不同构二元形式公共值集合基数的渐近上界，并以典型例子验证应用。
We establish some upper bounds for the number of integer solutions to the Thue inequality $|F(x , y)| \leq m$, where $F$ is a binary form of degree $n \geq 3$ and with non-zero discriminant $D$, and $m$ is an integer. Our upper bounds are independent of $m$, when $m$ is smaller than $|D|^{\frac{1}{4(n-1)}}$. We also consider the Thue equation $|F(x , y)| = m$ and give some upper bounds for the number of its integral solutions. In the case of equation, our upper bounds will be independent of integer $m$, when $ m < |D|^{\frac{1}{2(n-1)}}$.
Integers represented by binary recursive sequences
本文研究满足二元递归关系的整数序列所表示的整数，针对非退化序列，仅用两个初始值给出零项最高指标与项绝对值增长阶的界，部分界在常数因子意义下最优。
Given a negative $D>-(\log X)^{\log 2-δ}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of discriminant $D$. We also give an analogous upper bound for square free integers of the form $q+a<X$ where $q$ is prime and $a\in\mathbb Z$ is fixed. Combined with the 1/2-dimensional sieve of Iwaniec, this yields a lower bound on the number of such integers $q+a<X$ represented by a binary quadratic form of discriminant $D$, where $D$ is allowed to grow with $X$ …
We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the absolute value of the discriminant of the binary form $F$. Our bounds depend on the number of non-vanishing coefficients of $F(x , y)$. When $F$ is really sparse, we establish a sharp upper bound for the number of solutions that is linear in terms of the number of non-vanishing coefficients. This work will provide affirmative answers to a number of conjectures …
The homogeneous form $Φ_n(X,Y)$ of degree $φ(n)$ which is associated with the cyclotomic polynomial $ϕ_n(X)$ is dubbed a {\it cyclotomic binary form}. A positive integer $m\ge 1$ is said to be {\it representable by a cyclotomic binary form} if there exist integers $n,x,y$ with $n\ge 3$ and $\max\{|x|, |y|\}\ge 2$ such that $Φ_n(x,y)=m$. We prove that the number $a_m$ of such representations of $m$ by a cyclotomic binary form is finite. More precisely, we have $\,φ(n) \le ({2}/ {\log 3})\log m\, $ and $\, \max\{|x|,|y|\} \le ({2}/{\sqrt{3}})\, m^{1/φ(n)}.\,$ We give a description of the asympto…
Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d \geq 3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. In 2019 Stewart and Xiao proved that $R_F(Z) \sim C_FZ^{2/d}$ for some positive number $C_F$. We compute $C_{R_n}$ and $C_{J_n}$ for the binary forms $R_n(x, y)$ and $J_n(x, y)$ defined by means of the relation $ (x + yi)^n = R_n(x, y) + J_n(x, y)i$, where the variables $x$ and $y$ are real.
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two polynomials that their orders are greater than one. By comparing the coefficients of two side, we obtain a system of the multivariate quadratic equations. Therefore, the integer decomposition problem is transformed into the problem of solving a system of the multivariate quadratic equations. Furthermore, the method transforms integer decomposition problem into solvin…
Let $f(x,y)=ax^2+bxy+cy^2$ be a binary quadratic form with integer coefficients. For a prime $p$ not dividing the discriminant of $f$, we say $f$ is completely $p$-primitive if for any non-zero integer $N$, the diophantine equation $f(x,y)=N$ has always an integer solution $(x,y)=(m,n)$ with $(m,n,p)=1$ whenever it has an integer solution. In this article, we study various properties of completely $p$-primitive binary quadratic forms. In particular, we give a necessary and sufficient condition for a definite binary quadratic form $f$ to be completely $p$-primitive.
In this article, we establish an average behaviour of the normalised Fourier coefficients of the Hecke eigenforms supported at the integers represented by any primitive integral positive definite binary quadratic form of fixed discriminant $D < 0$ when the class number $h(D) = 1$. We also obtain a quantitative result for the number of sign changes of the sequence of the normalised Fourier coefficients $λ_{f}(n)$ of the Hecke eigenforms $f$ where $n$ is represented by any primitive integral positive definite binary quadratic form of fixed discriminant $D < 0$ when the class number $h(D) = 1$ in…
Almost all binary forms of degree $\geq 3$ fail to represent a fixed integer
该研究证明，次数≥3的整系数二元型中，能表示固定非零整数的比例随高度趋于无穷而趋近于零，核心方法为格点计数与几何分析，结果对不可约形式也成立。
Let $h$ and $l$ be integers such that $0\le h\le 2$, $0\le l\le 4$. We obtain asymptotic formulas for the numbers of solutions of the equations $n-3m=h$, $n-5m=l$ in positive integers $m$ and $n$ of a special kind, $m\le X$.
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in some depth. In this paper, we show previously unknown connections between BSD representations and the Stern polynomial. We derive a weight-distribution theorem for $i$-bit BSD representations of an integer $n$ in terms of the coefficients and degrees of the terms of the Stern polynomial of $2^i-n$. We then show new recursions on Stern polynomials, and from the…
A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If there is an integer bilinear map s such that f(s(x,y))=f(x)f(y) for all vectors x and y from the integer 2-dimensional lattice, then the form f has semigroup property. We give an explicit description of all pairs (f,s) with the property stated above. We do not know any other examples of forms with semigroup property.
We improve some results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$ and $n=p^{\ell_1} + m^{\ell_2}$, where $\ell_1, \ell_2\ge 2$ are fixed integers, $p,p_1,p_2$ are prime numbers and $m$ is an integer.
Number of integers represented by families of binary forms II: binomial forms
本文研究二元二项式形式族 $aX^d+bY^d$ 对整数的表示，借助线性对数形式下界证明高次形式数量的一致界及低次形式的几乎完全表示。
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient computation, coding theory and cryptography. We link these two ideas here, showing that the number of $i$-bit binary signed-digit representations of an integer $n$ with $n<2^i$ is the $(2^i-n)^\text{th}$ element in Stern's diatomic sequence. This correspondence makes the vast range of results known for Stern's diatomic sequence available for consideration in the s…
Let $X$ be a sufficiently large positive integer. We prove that one may choose a subset $S$ of primes with cardinality $O(\log X)$, such that a positive proportion of integers less than $X$ can be represented by $x^2 + p y^2$ for at least one of $p \in S$.
We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms $n=p_{1}^{\ell_1}+p_{2}^{\ell_2}$, with $\ell_1, \ell_2\in\{2,3\}$, $\ell_1+\ell_2\le 5$ are fixed integers, and $n=p^{\ell_1} + m^{\ell_2}$, with $\ell_1=2$ and $2\le \ell_2\le 11$ or $\ell_1=3$ and $ \ell_2=2$ are fixed integers, $p,p_1,p_2$ are prime numbers and $m$ is an integer.
Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y and g(x,y)=u_2x+v_2y with integral coefficients, there exist arbitrarily large finite sets of integers A and B such that |f(A)| > |g(A)| and |f(B)| < |g(B)|.
For a congruence subgroup $Γ$, we define the notion of $Γ$-equivalence on binary quadratic forms which is the same as proper equivalence if $Γ= \mathrm{SL}_2(\mathbb Z)$. We develop a theory on $Γ$-equivalence such as the finiteness of $Γ$-reduced forms, the isomorphism between $Γ_0(N)$-form class group and the ideal class group, $N$-representation of integers, and $N$-genus of binary quadratic forms. As an application, we deal with representations of integers by binary quadratic forms under certain congruence condition on variables.
On the representation of $k$-free integers by binary forms
本文研究整数系数二元型所表示的无 $k$ 次因子整数计数，并在关于 $k$ 与不可约因子最大次数 $r$ 的条件下证明其具有主项为常数乘 $Z^{2/d}$ 的渐近公式。
The sequence A268289 from the On-Line Encyclopedia of Integer Sequences, namely the cumulated differences between the number of digits 1 and the number of digits 0 in the binary expansion of consecutive integers, is studied here. This sequence happens to match a sequence of cardinalities of some specific sets. Furthermore, it can also be expressed by using the Takagi function. The three different definitions have their own properties and combining them together lead to some new identities.
Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy, i.e. problems neither known to be polynomial time or NP-complete. Let L(F) denote the length of the binary encoding of the coefficients of a binary quadratic diophantine equation F(x_1, x_2)=0. This paper shows there is a certificate of length polynomial in L(F) that such an equation has an integer solution (resp. positive integer solution) when one exists. Th…
In this methodological paper, we first review the classic cubic Diophantine equation $a^3 + b^3 + c^3 = d^3$, and consider the specific class of solutions $q_1^3 + q_2^3 + q_3^3 = q_4^3$ with each $q_i$ being a binary quadratic form. Next we turn our attention to the familiar sums of powers of the first $n$ positive integers, $S_k = 1^k + 2^k + \cdots + n^k$, and express the squares $S_k^2$, $S_m^2$, and the product $S_k S_m$ as a linear combination of power sums. These expressions, along with the above quadratic-form solution for the cubic equation, allows one to generate an infinite number o…
This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be represented as $a^2+ab+b^2$ if and only if $p$ is of the form $6k+1$, with the only exception of 3, (ii) any positive integer can be represented as $a^2+ab+b^2$ if and only if its all prime factors that are not in the same form have even exponents in the standard factorization, and (iii) all the factors of an integer in the form $a^2+ab+b^2$, where $a$ and $b$ are po…
Number of integers represented by families of binary forms III: fewnomials
本文研究二元形式族中整数表示的数量，针对少项式族给出渐近估计，主项由最低次数形式决定，高次形式仅影响误差项。
In this paper we determine the group of rational automorphisms of binary cubic and quartic forms with integer coefficients and non-zero discriminant in terms of certain quadratic covariants of cubic and quartic forms. This allows one to give precise asymptotic formulae for the number of integers in an interval representable by a binary cubic or quartic form and extends work of Hooley. Further, we give the field of definition of lines contained in certain cubic and quartic surfaces related to binary cubic and quartic forms.
Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are pairwise incongruent modulo $m$. In this paper, we classify all binary recurrent sequences $\{w_n\}_{n\geq 0}$ consisting of different integer terms such that $\mathcal{D}_{\bf w}(2^e)=2^e$ for every $e\geq 1.$ For all of these sequences it is expected that one can actually give a fairly simple description of $\mathcal{D}_{\bf w}(n)$ for every $n\ge 1.$ For …
First moment of Hecke eigenvalues at the integers represented by binary quadratic forms
本文研究稀疏整数集索引的Hecke特征形式傅里叶系数求和估计，给出特定二元二次型表示的无平方因子整数对应的和式上界，并确定其Hecke特征值首次符号改变的量级，改进推广了已有结果。
We present a versatile construction allowing one to obtain pairs of integer sets with infinite symmetric difference, infinite intersection, and identical representation functions.
Exploring the Representation of Large Positive Integers as Sums of Prime Powers and Integer Powers: Analysis with Positive Density Subsets
本文利用转换原理研究大正整数表示为素数幂与整数幂之和的问题，其中素数和整数幂分别取自正密度子集，拓展了加法数论中的表示理论。
A short comment about a recent note by Kiss and Sandor on the maximum values of additive representation functions.
Suppose $k$ is a positive integer. In this work, we establish formulas for for the number of representations of integers by the quadratic forms $$ x_{1}^{2}+\cdots+x_{k}^{2}+l\left(x_{k+1}^{2}+\cdots+x_{2k}^{2}\right) $$ for $l\in\{2,4\}$.
The average number of representations of an integer as a sum of two prime powers over multiples of a fixed integer
本文扩展Ikeda和Suriajaya(2025)的结果，研究固定整数q的倍数上整数n作为两个素数k次幂之和的表示数的渐进行为。
The binary sum-of-digits function $s$ counts the number of ones in the binary expansion of a nonnegative integer. For any nonnegative integer $t$, T.~W.~Cusick defined the asymptotic density $c_t$ of integers $n\geq 0$ such that \[s(n+t)\geq s(n).\] In 2011, he conjectured that $c_t>1/2$ for all $t$ -- the binary sum of digits should, more often than not, weakly increase when a constant is added. In this paper, we prove that there exists an explicit constant $M_0$ such that indeed $c_t>1/2$ if the binary expansion of $t$ contains at least $M_0$ maximal blocks of contiguous ones, leaving open o…
We estimate Weyl sums over the integers with sum of binary digits either fixed or restricted by some congruence condition. In our proofs we use ideas that go back to a paper by Banks, Conflitti and the first author (2002). Moreover, we apply the "main conjecture" on the Vinogradov mean value theorem which has been established by Bourgain, Demeter and Guth (2016) as well as by Wooley (2016, 2019). We use our result to give an estimate of the discrepancy of point sets that are defined by the values of polynomials at arguments having the sum of binary digits restricted in different ways.
We apply the circle method with a Gaussian weight to obtain an asymptotic formula for the density of representations of non-zero integers by non-singular quadratic forms in at least four variables.
Even universal binary Hermitian lattices over imaginary quadratic fields
本研究针对虚二次域上的偶泛二元埃尔米特格问题，提出获取所有这类格的方法，并给出相应域上埃尔米特格偶泛性的最优判据。
We obtain estimates for the number of integral solutions in large balls, of inequalities of the form $|Q(x, y)| < ε$, where $Q$ is an indefinite binary quadratic form, in terms of the Hurwitz continued fraction expansions of the slopes of the lines on which $Q$ vanishes. The method is based on a coding of geodesics on the modular surface via Hurwitz expansions of the endpoints of their lifts in the Poincare half-plane.
For fixed integer $a\ge3$, we study the binary Diophantine equation $\frac{a}n=\frac1x+\frac1y$ and in particular the number $E_a(N)$ of $n\le N$ for which the equation has no positive integer solutions in $x, y$. The asymptotic formula $$E_a(N)\sim C(a) \frac{N(\log\log N)^{2^{m-1}-1}}{(\log N)^{1-1/2^m}}$$ as $N$ goes to infinity, is established in this article, and this improves the best result in the literature dramatically. The proof depends on a very delicate analysis of the underlying group structure.
Representation of even Gaussian integer à la Chen
该研究类比有理数域的陈景润定理，证明了范数充分大的偶高斯整数可表示为一个高斯素数与至多含两个高斯素因子的高斯整数之和。
For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets affording identical representation functions. We solve a recent problem of Lev and Chen.
Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on the notion of local model developed by Ramaré and may be viewed as an abstract circle method.
Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which is not a multiple of $b$ and has only small (in a suitable sense) prime factors has at least four nonzero digits in its representation in base $b$.
The average number of representations of an integer as a sum of three or more primes, over multiples of a fixed integer
该论文将Ikeda和Suriajaya的结果推广至任意$j\ge 3$个素数之和的表示数平均值，证明一般情形下渐近公式成立，并引入广义哥德巴赫问题奇异级数的平均值作为新工具。
Block occurrences in the binary expansion
本文研究二进制展开中块 $\mathtt{11}$ 出现次数的差值，证明其概率分布均匀接近高斯，误差随 $t$ 中 1 的块数增加而趋于 0。
We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{α,β}$, where $α>1$ is irrational and of finite type.
We characterize the generating function of the number of representations described in the title in terms of the theory of modular forms. Appealing to this characterization we obtain explicit formulas for the representation numbers as examples.
Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best possible.
Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underlineλ = (λ_{1}, \dots{} ,λ_{k})$ with $1 \le λ_{1} < λ_{2} < \dots{} < λ_{k}$, we define the additive representation function $R_{A,\underlineλ}(n) = |\{(a_{1}, \dots{} ,a_{k})\in A^{k}: λ_{1}a_{1} + \dots{} + λ_{k}a_{k} = n\}|$. For $k = 2$, Moser constructed a set $A$ of nonnegative integers such that $R_{A,\underlineλ}(n) = 1$ holds for every nonnegative integer $n$. In this paper we characterize all the $k$-tuples $\underlineλ$ and the sets $A$ of nonnegative integers with $…
The general formulas for finding the quantity of all primitive and nonprimitive triples generated by the given number x have been proposed. Also the formulas for finding the complete quantity of the representations of the integers as a difference of two squares have been obtained.
In this paper, we prove a conjecture of Chan and Chua for the number of representations of integers as sums of 8s integral squares. The proof uses a theorem of Imamoglu and Kohnen, and the double shuffle relations satisfied by the double Eisenstein series of level 2.
In this paper we consider certain quaternary quadratic forms and octonary quadratic forms and by using the theory of modular forms, we find formulae for the number of representations of a positive integer by these quadratic forms.
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit (BSD) representation of integers is used widely in efficient computation, coding theory and other applications. We link these two objects, showing that the number of $i$-bit binary signed-digit representations of an integer $n<2^i$ is the $(2^i-n)^\text{th}$ element in Stern's diatomic sequence. This correspondence makes the vast range of results known about the Stern diatomic sequence available for consideration in the study of binary signed-digit integers, an…
Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds for the least positive integer k such that the equation Q=k is insoluble in integers, despite being soluble modulo every prime power.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。