English
Related papers

Related papers: Logarithmic Representability of Integers as k-Sums

200 papers

A set of positive integers is primitive (or 1-primitive) if no member divides another. Erd\H{o}s proved in 1935 that the weighted sum $\sum1/(n \log n)$ for $n$ ranging over a primitive set $A$ is universally bounded over all choices for…

Number Theory · Mathematics 2022-05-11 Tsz Ho Chan , Jared Duker Lichtman , Carl Pomerance

Let $\Phi$ be a subset of the simple roots of a (possibly non-reduced) abstract root system $\Sigma$, and let $\lambda \in \Sigma$. We define the $\Phi$-string of $\lambda$ as the set of elements in $\Sigma \cup \{0\}$ of the form $\lambda…

Rings and Algebras · Mathematics 2024-12-17 Victor Sanmartin-Lopez

We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…

High Energy Physics - Theory · Physics 2015-06-22 J. Ablinger , J. Blümlein , C. G. Raab , C. Schneider

In this paper, we use the transference principle to investigate the representation of sufficiently large positive integers as the sum of prime powers and integer powers, where the primes are drawn from a positive density subset of the set…

Number Theory · Mathematics 2024-02-20 Meng Gao

Let $n$ be a positive integer and let $A$ be nonempty finite set of positive integers. We say that $A$ is relatively prime if $\gcd(A) =1$ and that $A$ is relatively prime to $n$ if $\gcd(A,n)=1$. In this work we count the number of…

Number Theory · Mathematics 2010-02-18 Mohamed El Bachraoui

Let $\theta >2$ be real and non-integral with integer part $n = \lfloor \theta \rfloor$ and let $ \phi (x)$ be a generalised polynomial with leading term $x^\theta.$ We establish a mean value estimate for the exponential sum…

Number Theory · Mathematics 2021-08-24 Constantinos Poulias

For all integers $n \geq k \geq 1$, define $H(n,k) := \sum 1 / (i_1 \cdots i_k)$, where the sum is extended over all positive integers $i_1 < \cdots < i_k \leq n$. These quantities are closely related to the Stirling numbers of the first…

Number Theory · Mathematics 2017-08-29 Paolo Leonetti , Carlo Sanna

We extend the strong multiplicity one theorem of Jacquet, Piatetski-Shapiro and Shalika. Let $\pi$ be a unitary, cuspidal, automorphic representation of $GL_n(\A_K)$. Let $S$ be a set of finite places of $K$, such that the sum $\sum_{v\in…

Number Theory · Mathematics 2007-05-23 C. S. Rajan

Let n,k be the positive integers, and let S_{k}(n) be the sums of the k-th power of positive integers up to n. By means of that we consider the evaluation of the sum of more general series by Bernstein polynomials. Additionally we show the…

Number Theory · Mathematics 2014-04-30 Mehmet Acikgoz , Ilknur Koca , Serkan Araci

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

Number Theory · Mathematics 2020-12-08 Alessandro Gambini , Remis Tonon , Alessandro Zaccagnini

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

The slowly converging series sum_{k=3}^infinity 1/[k * log k * (log log k)^a] is evaluated to 38.4067680928 at a=2. After some initial terms, the infinite tail of the sum is replaced by the integral of the associated interpolating function,…

Numerical Analysis · Mathematics 2021-06-25 Richard J. Mathar

This work is an extension of our earlier article, where a well-known integral representation of the logarithmic function was explored, and was accompanied with demonstrations of its usefulness in obtaining compact, easily-calculable, exact…

Information Theory · Computer Science 2020-07-15 Neri Merhav , Igal Sason

In [12], Nilsson proposed the probabilistic logic in which the truth values of logical propositions are probability values between 0 and 1. It is applicable to any logical system for which the consistency of a finite set of propositions can…

Artificial Intelligence · Computer Science 2013-04-12 Su-shing Chen

We present a theorem on taking the repeated indefinite summation of a holomorphic function $\phi(z)$ in a vertical strip of $\mathbb{C}$ satisfying exponential bounds as the imaginary part grows. We arrive at this result using transforms…

Complex Variables · Mathematics 2015-03-24 James Nixon

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

Number Theory · Mathematics 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

Number Theory · Mathematics 2022-03-29 Ramanujam Kamaraj , Ben Kane , Ryoko Tomiyasu

Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We…

Number Theory · Mathematics 2016-04-11 László Tóth

Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Data Structures and Algorithms · Computer Science 2024-10-29 Amir Abboud , Nick Fischer , Ron Safier , Nathan Wallheimer