Related papers: Polynomial equations for additive functions II
In this paper we consider an aggregation model f: X1 x ... x Xn --> Y for arbitrary sets X1, ..., Xn and a finite distributive lattice Y, factorizable as f(x1, ..., xn) = p(u1(x1), ..., un(xn)), where p is an n-variable lattice polynomial…
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…
We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
Finite trigonometric sums appear in various branches of Physics, Mathematics and their applications. For p; q to coprime positive integers and r we consider the finite trigonometric sums involving the product of three trigonometric…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…
Let $\mathbb{F}_{q}$ denote the finite field of order $q$ (a power of a prime $p$). We study the $p$-adic valuations for zeros of $L$-functions associated with exponential sums of the following family of Laurent polynomials…
We provide a method for solving the roots of the general polynomial equation a[n]*x^n+a[n-1]*x^(n-1)+..+a1*x+a0=0. To do so, we express x as a powerseries of s, and calculate the first n-2 coefficients. We turn the polynomial equation into…
A characterization of multiplicative (and additive) arithmetical functions is given. Using this characterization, we show that the group of multiplicative arithmetical functions is isomorphic to the group of additive arithmetical functions.
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
In this paper we find the solutions of the functional equation $$f(xy) = g(x)h(y) + \sum_{j=1}^n g_j(x)h_j(y), \;x,y \in M,$$ where $M$ is a monoid, $n\geq 2$, and $g_j$ (for $j=1,...,n$) are linear combinations of at least $2$ distinct…
In this paper, we present a $q$-analogue of the polynomial reduction which was originally developed for hypergeometric terms. Using the $q$-Gosper representation, we describe the structure of rational functions that are summable when…
Let $S$ be a semigroup. Our main results is that we describe the complex-valued solutions of the following functional equations \[g(x\sigma (y)) = g(x)g(y)+f(x)f(y),\ x,y\in S,\] \[f(x\sigma (y)) = f(x)g(y)+f(y)g(x),\ x,y\in S,\] and…
We show that on real algebraic sets algebraically constructible functions coincide with the finite sums of signs of polynomials. Then we give some applications.
In this paper, we propose some algorithms for analytical solution construction to nonlinear polynomial partial differential equations with constant function coefficients. These schemes are based on one-(single), two- (double) or three-…
The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…