中文
相关论文

相关论文: To answer a question of Professor Georges Rhin

200 篇论文

We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an…

数据结构与算法 · 计算机科学 2012-03-01 Bin Fu , Wenfeng Li , Zhiyong Peng

Let $G$ be an additive abelian group and $h$ be a positive integer. For a nonempty finite subset $A=\{a_0, a_1,\ldots, a_{k-1}\}$ of $G$, we let \[h_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i} a_{i}: (\lambda_{0}, \ldots,…

数论 · 数学 2018-10-08 Jagannath Bhanja , Ram Krishna Pandey

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

概率论 · 数学 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…

数论 · 数学 2013-06-04 Dmitriy Frolenkov , Igor D. Kan

Let A be a set of nonnegative integers. For every nonnegative integer n and positive integer h, let r_{A}(n,h) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,..., a_h are elements of A and…

数论 · 数学 2016-12-30 Melvyn B. Nathanson

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

代数几何 · 数学 2022-11-15 Curtis Heberle , Alexander J. Sutherland

The Sylvester's denumerant \( d(t; \boldsymbol{a}) \) is a quantity that counts the number of nonnegative integer solutions to the equation \( \sum_{i=1}^{N} a_i x_i = t \), where \( \boldsymbol{a} = (a_1, \dots, a_N) \) is a sequence of…

组合数学 · 数学 2024-06-28 Guoce Xin , Chen Zhang

We explain how a slight variant in the use of our recursive algorithm leads to improve the known lower bounds for the absolute trace of a totally positive algebraic integer. We also link the absolute trace of a totally positive algebraic…

数论 · 数学 2019-07-23 V. Flammang

Using an application of Schmidt's Subspace Theorem, this paper gives new transcendence criteria for rapidly converging infinite products of algebraic numbers. The paper also improves existing criteria for irrationality of products and…

数论 · 数学 2025-03-04 Mathias L. Laursen

A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…

数论 · 数学 2016-08-02 Shigeki Akiyama , Jan-Hendrik Evertse , Attila Pethő

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

代数几何 · 数学 2007-05-23 Laurent Busé , Carlos D'Andrea

Let $\mathcal{G}$ be the greedy algorithm that, for each $\theta\in (0,1]$, produces an infinite sequence of positive integers $(a_n)_{n=1}^\infty$ satisfying $\sum_{n=1}^\infty 1/a_n = \theta$. For natural numbers $p < q$, let…

数论 · 数学 2024-01-23 Hung Viet Chu

Disproving a conjecture of Bleicher and Erd\H{o}s, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all rational numbers from a non-empty open interval. We also…

数论 · 数学 2025-12-04 Wouter van Doorn , Vjekoslav Kovač

Let $\mathbf{x}=(x_1,\dots,x_n)$ be an $n$-tuple of positive real numbers and the sequence $(x_i)_{i\in\mathbb{Z}}$ be its $n$-periodic extension. Given an $n$-tuple $\mathbf{r}=(r_1,\dots,r_n)$ of positive integers, let $a_i$ be the…

经典分析与常微分方程 · 数学 2022-10-04 Sergey Sadov

Exploiting an iterative formula already introduced in a previous manuscript to count the number $O_d$ of finite $O$-sequences of multiplicity $d$, we obtain some new information about $O_d$. Letting $A_d$ be the number of the finite…

交换代数 · 数学 2026-04-14 Francesca Cioffi , Margherita Guida , Enrica Pirozzi

Combining the mollifiers, we exhibit other choices of coefficients that improve the results on large gaps between the zeros of the Riemann zeta-function. Precisely, assuming the Generalized Riemann Hypothesis (GRH), we show that there exist…

数论 · 数学 2012-11-06 H. M. Bui

Our work is motivated by the fact that the norms of the Eulerian integers are related to the sums of form $a^2-ab+b^2$, providing a natural generalization for problems concerning products over sums or differences of integers. Let $E$ be the…

数论 · 数学 2026-02-10 Erik Füredi , Katalin Gyarmati

The Riemann zeta function $\zeta(s)$ is defined as the infinite sum $\sum_{n=1}^\infty n^{-s}$, which converges when ${\rm Re}\,s>1$. The Riemann hypothesis asserts that the nontrivial zeros of $\zeta(s)$ lie on the line ${\rm Re}\,s=…

数论 · 数学 2019-11-05 Dorje C Brody , Carl M. Bender

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

组合数学 · 数学 2017-04-05 Brendan Murphy , Oliver Roche-Newton , Ilya Shkredov

Let $\Sigma=\{a_1, \ldots , a_n\}$ be a set of positive integers with $a_1 < \ldots < a_n$ such that all $2^n$ subset sums are pairwise distinct. A famous conjecture of Erd\H{o}s states that $a_n>C\cdot 2^n$ for some constant $C$, while the…

组合数学 · 数学 2024-02-02 Simone Costa , Stefano Della Fiore , Andrea Ferraguti