Related papers: A functional equation arising from multiplication …

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…

We define a series $\mathcal{F}_{M,N}$ as a certain generalization of $q$-hypergeometric function. We study its duality and the system of $q$-difference nonlinear equations which admits particular solutions in terms of $\mathcal{F}_{1,M}$.

We present a natural multiplicative theory of integer partitions (which are usually considered in terms of addition), and find many theorems of classical number theory arise as particular cases of extremely general combinatorial structure…

The objective of this series of papers is to recover information regarding the behaviour of FQ operations in the case $n=2$, and FQ conform-operations in the case $n=3$. In this first part we study how the basic invariance properties of FQ…

The main purpose of this work is to characterize derivations through functional equations. This work consists of five chapters. In the first one, we summarize the most important notions and results from the theory of functional equations.…

For $r \geq 1$ an odd integer, we provide a sequence from the function field $\mathcal{F}_{q, r}$ of the maximal curve over $\mathbb{F}_{q^{2r}}$ defined by the affine equation $y^q+y=x^{q^r + 1}$. This sequence has high nonlinear…

In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalises strong $q$-additivity and -multiplicativity, respectively. We show that…

The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…

Let $q=4$ and $k$ a positive integer. In this short note, we present a class of permutation polynomials over $\Bbb F_{q^{3k}}$. We also present a generalization.

Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…

In this paper we consider generalized monomial functions $f, g\colon \mathbb{F}\to \mathbb{C}$ (of possibly different degree) that also fulfill \[ f(P(x))= Q(g(x)) \qquad \left(x\in \mathbb{F}\right), \] where $P\in \mathbb{F}[x]$ and $Q\in…

We define analogues of higher derivatives for $F_q$-linear functions over the field of formal Laurent series with coefficients in $F_q$. This results in a formula for Taylor coefficients of a $F_q$-linear holomorphic function, a definition…

Two rational functions $f,g\in\Bbb F_q(X)$ are said to be {\em equivalent} if there exist $\phi,\psi\in\Bbb F_q(X)$ of degree one such that $g=\phi\circ f\circ\psi$. We give an explicit formula for the number of equivalence classes of…

Let $\mathbb{F}_q$ be a finite field with $q$ elements and let $n$ be a positive integer. In this paper, we study the digraph associated to the map $x\mapsto x^n h(x^{\frac{q-1}{m}})$, where $h(x)\in\mathbb{F}_q[x].$ We completely determine…

We prove that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and non-negative integers $j$ and $r$ with $j\leqslant m$, the following two expressions \begin{align*} &\frac{1}{[n_1+n_m+1]}{n_1+n_{m}\brack…

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

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…

In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalise strong $q$-additivity and -multiplicativity, respectively. We show that…

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…