Related papers: Sums of arithmetic functions over values of binary…

In this paper we consider ordinal sums of combinatorial games where each summand is a number, not necessarily in canonical form. In doing so we give formulas for the value of an ordinal sum of numbers where the literal form of the base has…

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

Let $K$ be a number field, ${\mathcal O}_K$ its ring of integers, and $f(x, y) \in {\mathcal O}_K[x, y]$ a binary form with integer coefficents. For any given prime $p \in {\mathcal O}_K$ we determine explicitly a binary form $g$ (resp.…

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…

In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the…

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the…

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…

We derive and prove an explicit formula for the sum of the fractional parts of certain geometric series. Although the proof is straightforward, we have been unable to locate any reference to this result. This summation formula allows us to…

In this paper, we study the sum of additive characters over finite fields, with a focus on those of specified \(\mathbb{F}_q\)-Order. We establish a general formula for these character sums, providing an additive analogue to classical…

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…

Let $\gamma$ denote imaginary parts of complex zeros of the Riemann zeta-function $\zeta(s)$. Certain sums over the $\gamma$'s are evaluated, by using the function $G(s) = \sum_{\gamma>0}\gamma^{-s}$ and other techniques. Some integrals…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

Determining the approximate degree composition for Boolean functions remains a significant unsolved problem in Boolean function complexity. In recent decades, researchers have concentrated on proving that approximate degree composes for…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…