中文
相关论文

相关论文: Bounds for the Number of Terms of Harmonic Sums

200 篇论文

An arithmetic read-once formula (ROF) is a formula (circuit of fan-out 1) over $+, \times$ where each variable labels at most one leaf. Every multilinear polynomial can be expressed as the sum of ROFs. In this work, we prove, for certain…

计算复杂性 · 计算机科学 2015-12-15 Meena Mahajan , Anuj Tawari

\medskip\noindent\textbf{R\'esum\'e.} Soit $l$ un entier et $\ors=(s_1, \dots, s_l)$ une s\'equence d'entiers positifs. Dans ce document, nous \'etudierons les propri\'et\'es arithm\'etique de sommes harmoniques multiples $H(\ors; n)$, qui…

数论 · 数学 2013-03-21 Jianqiang Zhao

We define and study the interpolated finite multiple harmonic $q$-series. A generating function of the sums of the interpolated finite multiple harmonic $q$-series with fixed weight, depth and $i$-height is computed. Some Ohno-Zagier type…

数论 · 数学 2019-03-22 Zhonghua Li , Ende Pan

The number of frequencies of factors of length $n+1$ in a recurrent aperiodic infinite word does not exceed $3\Delta \C(n)$, where $\Delta \C (n)$ is the first difference of factor complexity, as shown by Boshernitzan. Pelantov\'a together…

组合数学 · 数学 2013-02-05 Lubomira Balkova

The notion of an \emph{Egyptian} integral domain $D$ (where every fraction can be written as a sum of unit fractions with denominators from $D$) is extended here to the notion that a ring $R$ is \emph{$W$-Egyptian}, with $W$ a…

交换代数 · 数学 2023-09-20 Neil Epstein

For any integer $q\geq 2$ we provide a formula to express indefinite sums of a sequence $(f(n))_{n\geq 0}$ weighted by $q$-periodic sequences in terms of indefinite sums of sequences $(f(qn+p))_{n\geq 0}$, where $p\in\{0,\ldots,q-1\}$. When…

组合数学 · 数学 2019-05-10 Jean-Luc Marichal

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.

数论 · 数学 2020-12-08 Alessandro Gambini , Remis Tonon , Alessandro Zaccagnini

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

综合数学 · 数学 2021-09-10 Roudy El Haddad

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

数论 · 数学 2016-12-15 Eknath Ghate , T. N. Venkataramana

Let $T_o(k)$ denote the number of solutions of $\sum_{i=1}^k\frac 1{x_i}=1$ in odd numbers $1<x_1<x_2<...<x_k$. It is clear that $T_o(2k)=0$. For distinct primes $p_1, p_2,..., p_t$, let $S(p_1, p_2,...,…

数论 · 数学 2014-09-16 Yong-Gao Chen , Christian Elsholtz , Li-Li Jiang

This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…

高能物理 - 唯象学 · 物理学 2008-11-26 J. A. M. Vermaseren

Let $\mathbb{F}_q$ denote the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ represent the nonzero elements of $\mathbb{F}_{q}$. In this paper, by using the Smith normal form we…

数论 · 数学 2016-03-08 Shuangnian Hu , Shaofang Hong , Xiaoer Qin

We show some new Wolstenholme type $q$-congruences for some classes of multiple $q$-harmonic sums of arbitrary depth with strings of indices composed of ones, twos and threes. Most of these results are $q$-extensions of the corresponding…

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

组合数学 · 数学 2019-03-26 Josef Rukavicka

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

数论 · 数学 2013-04-23 Darren Glass

We obtain a tight, up to a logarithmic factor, upper bound on the number of solutions to the equation $$ \sum_{j=1}^n a_j \frac{s_j}{r_j} =a_0, \qquad $$ with variables $r_1,...,r_n$ in an arbitrary box at the origin and variables $s_1,...,…

数论 · 数学 2015-03-10 Igor E. Shparlinski

We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…

数论 · 数学 2022-02-09 Kwang-Wu Chen

Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…

数学物理 · 物理学 2009-11-11 S. Moch , P. Uwer

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

组合数学 · 数学 2025-09-25 Benjamin Móricz , Zoltán Lóránt Nagy

Summation by parts is used to find the sum of a finite series of generalized harmonic numbers involving a specific polynomial or rational function. The Euler-Maclaurin formula for sums of powers is used to find the sums of some finite…

数论 · 数学 2012-02-10 Maarten Kronenburg