English
Related papers

Related papers: Method for solving an iterative functional equatio…

200 papers

Let $K$ be a field of characteristic 0, $f:\mathbb{N}\to K$ be a multiplicative function, and $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ be algebraic over $K(z)$. Then either there is a natural number $k$ and a periodic multiplicative function…

Number Theory · Mathematics 2010-03-15 Jason P. Bell , Michael Coons

In this paper we established a class of optimal fourth-order methods which is obtained by existing third-order method for solving nonlinear equations for simple roots by using weight functions. Some physical examples are given to illustrate…

Numerical Analysis · Mathematics 2013-07-30 J. P. Jaiswal

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…

Number Theory · Mathematics 2026-02-16 Meselem Karras

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

Number Theory · Mathematics 2007-05-23 T. Narayaninsamy , D. -J. Mercier , J. -P. Cherdieu

Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', and we give a…

Number Theory · Mathematics 2023-01-19 Andrea Ciprietti , Federico Glaudo

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Symbolic Computation · Computer Science 2008-10-29 Laurent Busé , Bernard Mourrain

A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…

Combinatorics · Mathematics 2010-09-21 Giuseppe Scollo

We show that the there exists an infinite family of APN functions of the form $F(x)=x^{2^{s}+1} + x^{2^{k+s}+2^k} + cx^{2^{k+s}+1} + c^{2^k}x^{2^k + 2^s} + \delta x^{2^{k}+1}$, over $\gf_{2^{2k}}$, where $k$ is an even integer and…

Information Theory · Computer Science 2011-10-17 Carl Bracken , Chik How Tan , Tan Yin

It is demonstrated how an explicit expression of the (partial) sum of Tetranacci numbers can be found and proved using generating functions and the Hadamard product. We also provide a Binet-type formula for generalized Fibonacci numbers, by…

Number Theory · Mathematics 2020-01-22 Helmut Prodinger , Sarah J. Selkirk

To date, the best methods for estimating the growth of mean values of arithmetic functions rely on the Vorono\"{\i} summation formula. By noticing a general pattern in the proof of his summation formula, Vorono\"{\i} postulated that…

Number Theory · Mathematics 2026-04-06 Arindam Roy , Jagannath Sahoo , Akshaa Vatwani

In this note we obtain the solutions of four $q$-functional equations and express the solutions in $q$-operator forms. These equations give sufficient conditions for $q$-operator methods.

Combinatorics · Mathematics 2010-01-05 Jun-Ming Zhu

In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…

Number Theory · Mathematics 2023-12-08 Parham Zarghami

We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…

Combinatorics · Mathematics 2014-11-26 Daniel K. Du , Qing-Hu Hou

This article determines all the solutions in the finite field $GF{2^{4n}}$ of the equation $x^{2^{3n}+2^{2n}+2^{n}-1}+(x+1)^{2^{3n}+2^{2n}+2^{n}-1}=b$. Specifically, we explicitly determine the set of $b$'s for which the equation has $i$…

Information Theory · Computer Science 2022-04-12 Kwang Ho Kim , Sihem Mesnager

In this paper, we give a new proof and an extension of the following result of B\'ezivin. Let $f:\B{N}\to K$ be a multiplicative function taking values in a field $K$ of characteristic 0 and write $F(z)=\sum_{n\geq 1} f(n)z^n\in K[[z]]$ for…

Number Theory · Mathematics 2010-03-16 Jason P. Bell , Nils Bruin , Michael Coons

We investigate the n-variable real functions G that are solutions of the Chisini functional equation F(x)=F(G(x),...,G(x)), where F is a given function of n real variables. We provide necessary and sufficient conditions on F for the…

Functional Analysis · Mathematics 2010-07-01 Jean-Luc Marichal

In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…

Classical Analysis and ODEs · Mathematics 2018-03-13 Xiao Tang , Weinian Zhang

A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linear equation, this paper presents an absolutely…

History and Overview · Mathematics 2019-12-04 Dagnachew Jenber Negash

Let $k,N \in \mathbb{N}$ with $N$ square-free and $k>1$. We prove an orthogonal relation and use this to compute the Fourier coefficients of the Eisenstein part of any $f(z) \in M_{2k}(\Gamma_0(N))$ in terms of sum of divisors function. In…

Number Theory · Mathematics 2018-08-06 Zafer Selcuk Aygin

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic