相关论文: Synthesizing Sums

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

The aim of this sequence of work is to investigate polynomial equations satisfied by additive functions. As a result of this, new characterization theorems for homomorphisms and derivations can be given. More exactly, in this paper the…

In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…

Let $\mathbb{A}=\mathbb{F}_{q}[T]$ be the polynomial ring over finite field $\mathbb{F}_{q}$, and $\mathbb{A}_{+}$ be the set of monic polynomials in $\mathbb{A}$. In this paper, we show that a large class of arithmetic functions in…

In this note, we characterize all functions $f : \mathbb{N} \rightarrow \mathbb{C}$ such that $f(x_1^2+ \cdots + x_k^2)=f(x_1)^2+ \cdots + f(x_k)^2$, where $k \geq 3$ and $x_1, \cdots, x_k$ are positive integers.

The present note considers a certain family of sums indexed by the set of fixed length compositions of a given number. The sums in question cannot be realized as weighted compositions. However they can be be related to the hypergeometric…

Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…

Let $ \mathbb{F}_q[T]$\, be the ring of polynomials over a finite field $ \mathbb{F}_q $. Let $ g: \mathbb{F}_q[T] \rightarrow \mathbb{R} $ be a multiplicative function such that for any irreducible polynomial $ P $ over $ \mathbb{F}_q $…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

This paper shows that certain $\,_{3}F_{4}$ hypergeometric functions can be expanded in sums of pair products of $\,_{1}F_{2}$ functions. In special cases, the $\,_{3}F_{4}$ hypergeometric functions reduce to $\,_{2}F_{3}$ functions.…

For two arithmetical functions $f$ and $g$, we study the convolution sum of the form $\sum_{n \le N} f(n) g(n+h)$ in the context of its asymptotic formula with explicit error terms. Here we introduce the concept of finite Ramanujan…

In this paper, we study sums of shifted products $\sum\limits_{n \leq x} F(n) G(n-h)$ for any $|h| \leq x/2$ and arithmetic functions $F=f*1$ and $G=g*1$, with $f$ and $g$ small. We obtain asymptotic formula for different orders of…

We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…

In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.

In this paper we prove new bounds for sums of convex or concave functions. Specifically, we prove that for all $A,B \subseteq \mathbb R$ finite sets, and for all $f,g$ convex or concave functions, we have $$|A + B|^{38}|f(A) + g(B)|^{38}…

In this paper some generalizations of the sum of powers of natural numbers is considered. In particular, the class of sums whose generating function is the power of the generating function for the classical sums of powers is studying. The…

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

We consider Aichinger's equation $$f(x_1+\cdots+x_{m+1})=\sum_{i=1}^{m+1}g_i(x_1,x_2,\cdots, \widehat{x_i},\cdots, x_{m+1})$$ for functions defined on commutative semigroups which take values on commutative groups. The solutions of this…

We study the sums $$ S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor\right) $$ when $f$ is supported on $r$th powers with $r\geq 2$. This restriction allows us to give nontrivial estimates for one of the error terms in…