Related papers: Polynomial equations for additive functions II
We consider elliptic partial differential equations with diffusion coefficients that depend affinely on countably many parameters. We study the summability properties of polynomial expansions of the function mapping parameter values to…
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.…
In this paper, we describe a congruence property of solvable polynomials with coefficients in the Gaussian field Q(i).
In this paper, we have characterized the nature and form of solutions of the following non-linear delay-differential equation: $$f^{n}(z)+\sum_{i=1}^{n-1}b_{i}f^{i}(z)+q(z)e^{Q(z)}L(z,f)=P(z),$$ where $b_i\in\mathbb{C}$, $L(z,f)$ be a…
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…
Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…
It is established that for every pair of additive forms $f=\sum_{i=1}^s a_i x_i^k, g=\sum_{i=1}^s b_i x_i^k$ of degree $k$ in $s>2k^2$ variables the equations $f=g=0$ have a non-trivial $p$-adic solution for all odd primes $p$.
We investigate various properties of p-adic differential equations which have as a solution an analytic function of the form $F_k (x) = \sum_{n\geq 0} n! P_k (n) x^n$, where $P_k (n) = n^k + C_{k-1} n^{k-1} + ...+ C_0$ is a polynomial in n…
Using properties of Gauss and Jacobi sums, we derive explicit formulas for the number of solutions to a diagonal equation of the form $x_1^{2^m}+\dots+x_n^{2^m}=0$ over a finite field of characteristic $p\equiv\pm 3\pmod{8}$. All of the…
The aim of this paper is twofold. On one hand, the additive solvability of the system of functional equations \[d_{k}(xy)=\sum_{i=0}^{k}\Gamma(i,k-i) d_{i}(x)d_{k-i}(y) \qquad (x,y\in \R,\,k\in\{0,\ldots,n\}) \] is studied, where…
Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…
We study the following functional equation that has arisen in the context of mechanical systems invariant under the Poincare algebra: \sum\limits_{i=1}^{n+1}\dfrac{\partial}{\partial x_{i}}\prod\limits_{j\neq i}f(x_{i}-x_{j}) =0,\qquad n…
We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…
We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…
Let $\F_q$ be a finite field of order $q$ and $P$ be a polynomial in $\F_q[x_1, x_2]$. For a set $A \subset \F_q$, define $P(A):=\{P(x_1, x_2) | x_i \in A \}$. Using certain constructions of expanders, we characterize all polynomials $P$…
In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…
Let $g_1, \dots , g_M$ be additive functions for which there exist nonconstant polynomials $G_1, \dots , G_M$ satisfying $g_i(p) = G_i(p)$ for all primes $p$ and all $i \in \{1, \dots , M\}$. Under fairly general and nearly optimal…
The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…