The diophantine equation $\left(2^{k}-1\right)\left(3^{k}-1\right)=x^{n}$
Bo He, Chang Liu
本文考察特定指数型丢番图方程，证明其在 $k、x$ 为正整数且 $n>2$ 时无解。
本文研究丢番图方程 \\[ (2^k - 1)(3^k - 1) = x^n \\]，并证明该方程不存在满足正整数 $k、x、n > 2$ 的解。
In this paper, we investigate the Diophantine equation \[ (2^k - 1)(3^k - 1) = x^n \] and prove that it has no solutions in positive integers $k, x, n > 2$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show that the Diophantine pair $\{1, 3\}$ can not be extended to a Diophantine quintuple in $\mathbb{Z}\left[\sqrt{-2}\right]$. This result completes the work of the first author and establishes non-extensibility of the Diophantine pair $\{1, 3\}$ to a Diophantine quintuple in $\mathbb{Z}\left[\sqrt{-d}\right]$ for all $d\in \mathbb{N}$.
This paper deals with the analogue of Inhomogeneous Diophantine Approximation in function fields. The inhomogeneous approximation constant of a Laurent series $θ\in\mathbb F_q\left(\left(\frac{1}{t}\right)\right)$ with respect to $γ\in\mathbb F_q\left(\left(\frac{1}{t}\right)\right)$ is defined to be $c(θ,γ)=\inf_{0\neq N\in\mathbb F_q\left[t\right]}|N|\cdot|\langle Nθ- γ\rangle|$. We show that for every $θ$ there exists $γ$ such that $c(θ,γ)\geq q^{-2}$, and find a sufficient condition on $θ$ which forces $c(θ,γ) \leq q^{-2}$ for every $γ$. Given $θ$, we prove that the set $BA_θ=\left\{γ\in\m…
The Diophantine equation $a \left(\frac{b^k-1}{b-1}\right) = \mathcal{U}_n-\mathcal{U}_m$
该研究刻画了一个含广义 Lucas 序列项之差与几何和的丢番图方程，并在判别式为正的整数参数条件下给出其全部正整数解。
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 above inequality has a solution in primes $p_1$, $p_2$, $p_3$ such that each of the numbers $p_1 + 2, p_2 + 2, p_3 + 2$ has at most $\left[ \frac{369}{180 - 168 c} \right]$ prime factors, counted with the multiplicity.
On a nonlinear Diophantine equation with powers of three consecutive $k$--Lucas Numbers
本文完整求解了由三个连续$k$--广义卢卡斯数幂构成的非线性丢番图方程，给出了所有非负整数解。
A note on general isolation result in Diophantine Approximation
本文给出关于实数有理逼近中隔离现象的简单通用陈述，研究函数f>f1，使得不等式解的存在性可传递至更紧的不等式。
The present paper is a sequel to [Monatsh.~Math.\ {\bf 194} (2021), 523--554] in which results of that paper are generalized so that they hold in the setting of inhomogeneous Diophantine approximation. Given any integers $n \geq 2$ and $\ell \geq 1$, any ${\pmb ξ} = \left(ξ_1, \dots , ξ_\ell \right) \in \mathbb{R}^\ell$, and any homogeneous function \linebreak $f = \left(f_1, \dots , f_\ell \right): \mathbb{R}^n \to \mathbb{R}^\ell$ that satisfies a certain nonsingularity assumption, we obtain a biconditional criterion on the approximating function $ψ= \left(ψ_1, \dots , ψ_\ell \right): \mathb…
Unbounded Oscillation of Euler-Gompertz Diophantine Errors from Bell and Gould Numbers
研究Bell数与Gould数线性组合的丢番图误差δB_n - A_n的渐近行为，证明该误差随n→∞无界振荡，即上下极限分别为正负无穷。
It is well known that a triangle with side lengths 3, 4 and 5 is right-angled. Euclid was the first to give a formula for generating other right-angled triangles with integer side lengths. In this text, I present a novel algorithm to generate all possible right-angled triangles with integer side lengths, in which the three side lengths have no common divisor. The algorithm is based on the difference in length between the hypothenuse and the largest of the two other sides. I also prove the completeness of this algorithm: it generates all possible such triangles and nothing but such triangles.
In this paper, we study inhomogeneous Diophantine approximation with rational numbers of reduced form. The central object to study is the set $W(f,θ)$ as follows, \begin{eqnarray*} \left\{x\in [0,1]:\left |x-\frac{m+θ(n)}{n}\right|<\frac{f(n)}{n}\text{ for infinitely many coprime pairs of numbers } m,n\right\}, \end{eqnarray*} where $\{f(n)\}_{n\in\mathbb{N}}$ and $\{θ(n)\}_{n\in\mathbb{N}}$ are sequences of real numbers in $[0,1/2]$. We will completely determine the Hausdorff dimension of $W(f,θ)$ in terms of $f$ and $θ$. As a by-product, we also obtain a new sufficient condition for $W(f,θ)$…
Multiplicative Diophantine Approximation on Planar Lines with Restricted Denominators
本文研究了平面直线上具有限制分母的乘法丢番图逼近问题，推导了收敛条件并给出了Hausdorff维度的上界。
Diophantine Approximation with Piatetski-Shapiro Primes
本文证明了关于Piatetski-Shapiro素数的丢番图逼近结果，即在特定参数条件下存在无穷多个形如$p=[n^c]$的素数满足给定的逼近不等式。
We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realization of a fractal percolation process, then almost surely (conditioned on $E\neq\emptyset$), for every countable collection $\left(f_{i}\right)_{i\in\mathbb{N}}$ of $C^{1}$ diffeomorphisms of $\mathbb{R}^{d}$, $\dim_{H}\left(E\cap\left(\bigcap_{i\in\mathbb{N}}f_{i}\left(\text{BA}_{d}\right)\right)\right)=\dim_{H}\left(E\right)$, where $\text{BA}_{d}$ is the set of badly approximable …
On the Diophantine Equations $J_n +J_m =L_k$ and $L_n +L_m =J_k$
本文利用 Baker 对数线性形式定理及 Dujella 和 Pethő 的缩减方法，求出了丢番图方程 $L_n +L_m =J_k$ 和 $J_n +J_m =L_k$ 的所有非负整数解，找出了所有可表示为两个 Jacobsthal 数之和的 Lucas 数及反之。
We prove that there are infinitely many solutions of $$ |λ_0+λ_1p+λ_2P_r|<p^{-τ}, $$ where $r=3,$ $τ=\frac1{118}$, and $λ_0$ is an arbitrary real number and $λ_1,λ_2\in\BR$ with $λ_2\neq0$ and $0>\frac{λ_1}{λ_2}$ not in $\mathbb{Q}$. This improves a result by Harman. Moreover, we show that one can require the prime $p$ to be of the form $\floor{n^c}$ for some positive integer $n$, i.e. $p$ is a Piatetski-Shapiro prime, with $r=13$ and $τ=ρ(c),$ a constant explicitly determined by $c$ supported in $\left(1, 1+\frac1{149}\right].$
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
We deal with the problem to find the number $P(b)$ of integer non-negative solutions of an equation $\sum_{i=1}^{n} a_i x_i=b$, where $a_1,a_2,...,a_n$ are natural numbers and $b$ is a non-negative integer. As different from the traditional methods of investigation of the function $P(b)$, in our study we do not employ the techniques of number series theory, but use in the main the properties of the Kronecker function and the elements of combinatorics. The formula is derived to express $P(b)$, for an integer non-negative $b$, via $P(r)$, $P(r+M)$,..., $P(r+(s-1)M)$ when $s\neq 0$, where $s=\lef…
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some reasonable assumptions, this equation has only finitely many integer solutions.
Let $\left( g\left( x \right),xg\left( x \right) \right)$ be a Riordan matrix from the Bell subgroup. We denote ${{\left( g\left( x \right),xg\left( x \right) \right)}^{φ}}=\left( {{g}^{\left( φ\right)}}\left( x \right),x{{g}^{\left( φ\right)}}\left( x \right) \right)$, where a matrix power is defined in the standard way. The polynomials ${{c}_{n}}\left( x \right)$ such that ${{g}^{\left( φ\right)}}\left( x \right)=\sum\nolimits_{n=0}^{\infty }{{{c}_{n}}}\left( φ\right){{x}^{n}}$ will be called composition polynomials. We consider the composition polynomials of the RNA matrix. The construction…
The Duffin-Schaeffer Conjecture for multiplicative Diophantine approximation
本文证明了乘法丢番图逼近的Duffin-Schaeffer型结果，去除了单调性假设，给出了无穷多个逼近成立的充要条件，解决了Beresnevich、Haynes和Velani的猜想。
We solve the two Diophantine equations $P_k=J_n+J_m$ and $Q_k=J_n+J_m$ where $\left\lbrace P_{k}\right\rbrace_{k\geq0}$, $\left\lbrace Q_{k}\right\rbrace_{k\geq0}$ and $\left\lbrace J_{k}\right\rbrace_{k\geq0}$ are the sequences of Pell numbers, Pell-Lucas numbers and Jacobsthal numbers, respectively. The main tool is the theory of linear forms in logarithms.
We consider the group of the matrices $\left( 1,g\left( x \right) \right)$ isomorphic to the group of formal power series $g\left( x \right)=x+{{g}_{2}}{{x}^{2}}+...$ under composition: $\left( 1,{{g}_{2}}\left( x \right) \right)\left( 1,{{g}_{1}}\left( x \right) \right)=\left( 1,{{g}_{1}}\left( {{g}_{2}}\left( x \right) \right) \right)$. Denote $P_{k}^{α}=\left( 1,x{{\left( 1-kα{{x}^{k}} \right)}^{{-1}/{k}\;}} \right)$. Matrix $\left( 1,g\left( x \right) \right)$is decomposed into an infinite product of the matrices $P_{k}^{α}$ with suitable exponents in two ways: to left-handed and right-han…
In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation $3^{a}+3^{b}+2=n^5$, where $(n,3)=1$ and $a>b>0$ is insoluble for pairs of positive integers $(a,b)$ where they are both even or one is even and the other is odd. In the case where both $(a,b)$ are odd, there is one known solution $2^5=3^3+3^1+2.$ We will show that there are no other solutions to the diophantine equation for $n^{5}<32\left(1+3(10^6)\right)^5$.
The number of solutions of the diophantine equation $\sum_{i=1}^k \frac{1}{x_i}=1,$ in particular when the $x_i$ are distinct odd positive integers is investigated. The number of solutions $S(k)$ in this case is, for odd $k$: \[\exp \left( \exp \left( c_1\, \frac{k}{\log k}\right)\right) \leq S(k) \leq \exp \left( \exp \left(c_2\, k \right)\right) \] with some positive constants $c_1$ and $c_2$. This improves upon an earlier lower bound of $S(k) \geq \exp \left( (1+o(1))\frac{\log 2}{2} k^2\right)$.
For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $Φ\left(n\right)$ denote, respectively, the number of subsets $A$ of $\left\{1, 2, \ldots, n\right\}$ such that $\gcd\left(A\right) = 1$ and the number of subsets $A$ of $\left\{1, 2, \ldots, n\right\}$ such that $\gcd\left(A\cup\left\{n\right\}\right) =1$. Let $D\left(n\right)$ be the divisor sum of $f\left(n\right)$. In this article, we obtain partial sums of $f\left(n\right)$, $Φ\left(n\right)$ and $D\left(n\right)$. We also obtain…
Each numerical sequence $\left( {{b}_{0}},{{b}_{1}},{{b}_{2}},... \right)$ with the generating function $B\left( x \right)$ defines the pseudo-involution in the Riordan group $\left( 1,xg\left( x \right) \right)$ such that $g\left( x \right)=1+xg\left( x \right)B\left( {{x}^{2}}g\left( x \right) \right)$. In the present paper we realize a simple idea: express the coefficients of the series ${{g}^{m}}\left( x \right)$ in terms of the coefficients of the series $B\left( x \right)$. Obtained expansion has a bright combinatorial character, sheds light on the connection of the pseudo-involution in …
Erdős considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a generalisation stating that the gaps between primes $p$ for which there is no $\mathbb{Q}_p$-point on a random variety are Poisson distributed.
Let $\left(a_{n}\right)_{n}$ be a strictly increasing sequence of positive integers, denote by $A_{N}=\left\{ a_{n}:\,n\leq N\right\} $ its truncations, and let $α\in\left[0,1\right]$. We prove that if the additive energy $E\left(A_{N}\right)$ of $A_{N}$ is in $Ω\left(N^{3}\right)$, then the sequence $\left(\left\langle αa_{n}\right\rangle \right)_{n}$ of fractional parts of $αa_{n}$ does not have Poissonian pair correlations (PPC) for almost every $α$ in the sense of Lebesgue measure. Conversely, it is known that $E\left(A_{N}\right)=\mathcal{O}\left(N^{3-\varepsilon}\right)$, for some fixed …
All the periodic points of a certain algebraic function related to the Rogers-Ramanujan continued fraction $r(τ)$ are determined. They turn out to be $0, \frac{-1 \pm \sqrt{5}}{2}$, and the conjugates over $\mathbb{Q}$ of the values $r(w_d/5)$, where $w_d$ is one of a specific set of algebraic integers, divisible by the square of a prime divisor of 5, in the field $K_d=\mathbb{Q}(\sqrt{-d})$, as $-d$ ranges over all negative quadratic discriminants for which $\left(\frac{-d}{5}\right) = +1$. This yields new insights on class numbers of orders in the fields $K_d$. Conjecture 1 of Part I is prov…
Let $Λ\left(n\right)$ be the von Mangoldt function and $r_{G}\left(n\right) := \sum_{m_1 + m_2=n} Λ\left(m_1 \right) Λ\left(m_2 \right)$ be the counting function for the numbers that can be written as sum of two primes (that we will call "Goldbach numbers", for brevity) and let $\widetilde{S }\left(z\right) := \sum_{n\geq1} Λ\left(n\right) e^{-nz}$, with $z\in\mathbb{C}$, $\mathrm{Re}\left(z\right)>0$. In this paper we will prove the identity $$\widetilde{S}\left(z\right) = \frac{e^{-2z}}{z}-\sum_ρz^{-ρ} Γ\left(ρ\right) + \sum_ρ \left(z^{-ρ} γ\left(ρ,2z\right) - \frac{2^ρe^{-z}}ρ \right) + G\l…
Lower Bounds for Densities of Transcendental Gamma-Function Derivatives
研究超越函数导数在正整点和有理移位整点上的超越性，推导其密度下界。
The fundamental objective of this paper is to obtain some interesting properties for $\left(h,q\right)$-Genocchi numbers and polynomials by using the fermionic $p$-adic $q$-integral on $\mathbb{Z}_{p}$ and mentioned in the paper $q$-Bernstein polynomials. By considering the $q$-Euler zeta function defined by T. Kim, which can also be obtained by applying the Mellin transformation to the generating function of $\left(h,q\right)$-Genocchi polynomials, we study $\left(h,q\right)$-Zeta-type function. We derive symmetric properties of $\left(h,q\right)$-Zeta function and from these properties we gi…
Let $Λ\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}Λ\left(m_{1}\right)Λ\left(m_{2}\right)Λ\left(m_{3}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares of primes. Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,4$ suitable parameters depending on $Γ(s)$. We prove that $$\sum_{n\leq N}r_{SP}\left(n\right)\frac{\left(N-n\right)^{k}}{Γ\left(k+1\right)}=M_{1}\left(N,k\right)+M_{2}\left(N,k\right)+M_{3}\left(N,k\right)+M_{4}\left(N,k\right)+O…
Building on previous work of Di Nasso and Luperi Baglini, we provide general necessary conditions for a Diophantine equation to be partition regular. These conditions are inspired by Rado's characterization of partition regular linear homogeneous equations. We conjecture that these conditions are also sufficient for partition regularity, at least for equations whose corresponding monovariate polynomial is linear. This would provide a natural generalization of Rado's theorem. We verify that such a conjecture hold for the equations $x^{2}-xy+ax+by+cz=0$ and $x^{2}-y^{2}+ax+by+cz=0$ for $a,b,c\in…
"Infinitely Often" Transcendence of Gamma-Function Derivatives
研究伽马函数在任意非负整数点以外的有理数点处导数的超越性，证明对于特定q，导数序列中存在无限多个超越数，并给出超越数密度的下界。
Riordan matrices are infinite lower triangular matrices corresponding to the certain operators in the space of formal power series. Generalized Euler polynomials ${{g}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{p}_{n}}}\left( m \right){{x}^{m}}$, where ${{p}_{n}}\left( m \right)$ is the polynomial of degree $\le n$, are the numerator polynomials of the generating functions of diagonals of the ordinary Riordan matrices. Generalized Narayana polynomials ${{h}_{n}}\left( x \right)={{\left( 1-x \right)}^{2n+1}}\sum\nolimits_{m=0}^{\infty }{\left( m+1 \right)..…
Hausdorff dimension of some exceptional sets in Lüroth expansions
本文研究Lüroth展开中数字增长率的度量理论，完全确定了与数字增长率极限相关的三类例外集的Hausdorff维数。
Let $Λ$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}Λ\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will call Linnik numbers, for brevity). Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,k$ suitable parameters depending on $J_{v}\left(u\right)$, where $J_{v}\left(u\right)$ denotes the Bessel function of complex order $v$ and real argument $u$. We prove that $$ \sum_{n\leq N}r_{Q}\left(n\right)\frac{\left(N-n\right)^{k}}{Γ\left(k…
Two theorems are demonstrated giving analytical expressions of the fundamental solutions of the Pell equation $X^{2}-DY^{2}=1$ found by the method of continued fractions for two squarefree polynomial expressions of radicands of Richaud-Degert type $D$ of the form $D=\left(f\left(u\right)\right)^{2}\pm2^αn$, where $D$, $n>0$, $α\geq0,\in\mathbb{Z}$, and $f\left(u\right)>0,\in\mathbb{Z}$, any polynomial function of $u\in\mathbb{Z}$ such that $f\left(u\right)\equiv0\left(mod\,\left(2^{α-1}n\right)\right)$ or $f\left(u\right)\equiv\left(2^{α-2}n\right)\left(mod\,\left(2^{α-1}n\right)\right)$.
Let $Λ\left(n\right)$ be the Von Mangoldt function, let \[ r_{G}\left(n\right)=\underset{{\scriptstyle m_{1}+m_{2}=n}}{\sum_{m_{1},m_{2}\leq n}}Λ\left(m_{1}\right)Λ\left(m_{2}\right), \] \[ r_{PT}\left(N,h\right)=\sum_{n=0}^{N}Λ\left(n\right)Λ\left(n+h\right),\,h\in\mathbb{N} \] be the counting function of the Goldbach numbers and the counting function of the prime tuples, respectively. Let $N>2$ be an integer. We will find the explicit formulae for the averages of $r_{G}\left(n\right)$ and $r_{PT}\left(N,h\right)$ in terms of elementary functions, the incomplete Beta function $B_{z}\left(a,b\…
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello investigated the parity of $b_{t}(n)$ when $t\leq 28$. They discovered new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving every prime $p$ with $p\equiv 13, 17, 19, 23 \pmod{24}$. In this paper, we investigate the parity of $b_{21}(n)$ involving the primes $p$ with $p\equiv 1, 5, 7, 11 \pmod{24}$. We prove new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving the odd pr…
Generalized Euler polynomials ${{α}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{p}_{n}}}\left( m \right){{x}^{m}}$, where ${{p}_{n}}\left( x \right)$ is the polynomial of degree $n$, are the numerator polynomials of the generating functions of diagonals of the ordinary Riordan arrays. Generalized Narayana polynomials ${{φ}_{n}}\left( x \right)={{\left( 1-x \right)}^{2n+1}}\sum\nolimits_{m=0}^{\infty }{\left( m+1 \right)...\left( m+n \right){{p}_{n}}}\left( m \right){{x}^{m}}$ are the numerator polynomials of the generating functions of diagonals of the expo…
In this paper, we generalize the arithmetic functions $τ$ and $τ^{\left(e\right)}$ in algebraic number fields and we find some properties of these functions.
An explicit decomposition formula of a matrix in $GL_{2}\left(\mathbb{Z}\right)$
本文针对$GL_{2}\left(\mathbb{Z}\right)$矩阵分解问题，提出了一种显式公式，可将任意矩阵$M$分解为由特定元素$A$、$B$和$C$生成的子群中。
We show the following bounds on the prime counting function $π(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{π(x)}{x / \log x} \geq \liminf_{x \rightarrow \infty} \frac{π(x)}{x / \log x} \geq \log 2$$ for all $x$ sufficiently large. We also conjecture about the bounding of $π((x+1)^{2}) - π(x^{2})$, as is relevant to Legendre's conjecture about the number of primes in the aforementioned interval such that: $$ \left \lfloor\frac{1}{2}\left(\frac{\left(x+1\right)^{2}}{\log\left(x+1\right)}-\frac{x^{2}}{\log x}\right)-\f…
Sharpening Borel's result in Diophantine approximation
本文通过为连续三个逼近系数最小值提供更精确界限，锐化了博雷尔1903年在丢番图逼近中的结果，聚焦于\(a_{n + 1}=1\)的情况进行研究。
On the Gan-Gross-Prasad conjecture and its refinement for $\left(\mathrm{U}\left(2n\right),\mathrm{U}\left(1\right)\right)$
本文一般地证明了酉群对 (U(2n),U(1)) 的 Gan-Gross-Prasad 猜想，并在一定假设下建立中心 L 值的 Ichino-Ikeda 型精细公式；同时证明其分裂类比 (GL_{2n},GL_1) 的相应猜想与精细形式。
On the Gross-Prasad conjecture with its refinement for $\left(\mathrm{SO}\left(5\right),\mathrm{SO}\left(2\right)\right)$ and the generalized Böcherer conjecture
本文通过组合多个theta对应，在（SO(5), SO(2)）情形下证明了Bessel周期的Ichino-Ikeda型公式，并由此将Böcherer猜想推广到非平凡环面特征情形。
Arithmetic properties of arguments of algebraic numbers on the unit circle
研究单位圆上代数数的论证属性，证明其迪奥菲安性和超越性，扩展了关于平面曲线几何和弹道动力学的问题。
Given $n\in\mathbb{N}$, let $ω\left(n\right)$ denote the number of distinct prime factors of $n$, let $Z$ denote a standard normal variable, and let $P_{n}$ denote the uniform distribution on $\left\{ 1,\ldots,n\right\} $. The Erdős-Kac Theorem states that $$P_{n}\left(m\le n:ω\left(m\right)-\log\log n\le x\left(\log\log n\right)^{1/2}\right)\to\mathbb{P}\left(Z\le x\right)$$ as $n\to\infty$; i.e., if $N\left(n\right)$ is a uniformly distributed variable on $\lbrace 1,\ldots,n \rbrace$, then $ω\left(N\left(n\right)\right)$ is asymptotically normally distributed as $n\to \infty$ with both mean …
We introduce the $N\times N$ random matrices $$ X_{j,k}=\exp\left(2πi \sum_{q=1}^d\ ω_{j,q} k^q\right) \quad \text{with } \{ω_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables}, $$ and $d$ a fixed integer. We prove that the distribution of their singular values converges to the local Marchenko-Pastur law at scales $N^{-θ_d}$ for an explicit, small $θ_d>0$, as long as $d\geq 18$. To our knowledge, this is the first instance of a random matrix ensemble that is explicitly defined in terms of only $O(N)$ random variables exhibiting a universal local spectral law. Ou…
An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} α\right)_{n\geq 1}$ is uniformly distributed modulo one for almost all $α$. However, in general it is a very hard problem to calculate the precise order of convergence of the discrepancy of $\left(\left\{a_{n} α\right\}\right)_{n \geq 1}$ for almost all $α$. In particular it is very difficult to give sharp lower bounds for the speed of convergence. Until now this was only carried out for lacunary sequences $\left(a_{n}\righ…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。