English
Related papers

Related papers: Monomial functions, normal polynomials and polynom…

200 papers

In this paper, it is shown that every polynomial function is mixed monotone globally with a polynomial decomposition function. For univariate polynomials, the decomposition functions can be constructed from the Gram matrix representation of…

Optimization and Control · Mathematics 2026-01-21 Adam M Tahir

Let $G$ be a topological group. We investigate relations between two classes of "polynomial like" continuous functions on $G$ defined, respectively, by the conditions (1) $\Delta_h^{n+1}f=0$ for every $h \in G$, and (2) $\Delta_{h_{n+1}}…

Classical Analysis and ODEs · Mathematics 2017-09-26 J. M. Almira , E. V. Shulman

Generalized almost perfect nonlinear (GAPN) functions were defined to satisfy some generalizations of basic properties of almost perfect nonlinear (APN) functions for even characteristic. In this paper, we study monomial GAPN functions for…

Combinatorics · Mathematics 2017-08-03 Masamichi Kuroda

Let K be a complete algebraically closed p-adic field of characteristic zero. Let f, g be two transcendental meromorphic functions in the whole field K or meromorphic functions in an open disk that are not quotients of bounded analytic…

Number Theory · Mathematics 2011-05-31 Kamal Boussaf , Escassut Alain , Jacqueline Ojeda

Suppose that $h$ and $g$ belong to the algebra $\B$ generated by the rational functions and an entire function $f$ of finite order on ${\Bbb C}^n$ and that $h/g$ has algebraic polar variety. We show that either $h/g\in\B$ or $f=q_1e^p+q_2$,…

Complex Variables · Mathematics 2007-05-23 Dan Coman , Evgeny A. Poletsky

The study of finite projective planes involves planar functions, namely, functions f : F_q --> F_q such that, for each nonzero a in F_q, the function c --> f(c+a) - f(c) is a bijection on F_q. Planar functions are also used in the…

Combinatorics · Mathematics 2016-03-04 Michael Zieve

Let $\mathbb{F}_q$ denote the finite field of order $q$. For $q$ odd, we investigate the planarity over $\mathbb{F}_{q^3}$ of the family $$ f_{E,A,B,C,D}(X) := EX^2+ AX^{q+1}+ BX^{q^2+1}+CX^{2q} +DX^{2q^2}\in \mathbb{F}_{q}[X]. $$ Using…

Number Theory · Mathematics 2026-05-27 João Paulo Guardieiro , Adler Marques , Luciane Quoos , Guilherme Tizziotti

We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…

Computational Complexity · Computer Science 2012-03-28 Hervé Fournier , Guillaume Malod , Stefan Mengel

We study the form of possible algebraic relations between functions satisfying linear differential equations. In particular , if f and g satisfy linear differential equations and are algebraically dependent, we give conditions on the…

Commutative Algebra · Mathematics 2020-11-04 Julien Roques , Michael F. Singer

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

Number Theory · Mathematics 2016-12-20 Joachim König

For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

A generalized polymorphism of a predicate $P \subseteq \{0,1\}^m$ is a tuple of functions $f_1,\dots,f_m\colon \{0,1\}^n \to \{0,1\}$ satisfying the following property: If $x^{(1)},\dots,x^{(m)} \in \{0,1\}^n$ are such that…

Combinatorics · Mathematics 2025-12-02 Yaroslav Alekseev , Yuval Filmus

Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…

Information Theory · Computer Science 2016-06-15 Jingxue Ma , Tao Zhang , Tao Feng , Gennian Ge

In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…

Commutative Algebra · Mathematics 2007-05-23 Marie A. Vitulli

Let $f$ be a transcendental meromorphic function defined in the complex plane $\mathbb{C}$, and $\varphi(\not\equiv 0,\infty)$ be a small function of $f$. In this paper, We give a quantitative estimation of the characteristic function $T(r,…

Complex Variables · Mathematics 2020-08-31 Weiran Lü , Bikash Chakraborty

We show the polynomial property of $F$-polynomials for generalized quantum cluster algebras and obtain the associated separation formulas under a mild condition. Along the way, we obtain Gupta's formulas of $F$-polynomials for generalized…

Rings and Algebras · Mathematics 2024-09-04 Changjian Fu , Liangang Peng , Huihui Ye

In this paper we present several new classes of logarithmically completely monotonic functions. Our functions have in common that they are defined in terms of the $q-$gamma and $q-$digamma functions. As an applications of this results, some…

Classical Analysis and ODEs · Mathematics 2015-12-21 Khaled Mehrez

We compare two known methods of extending a complex, unital, commutative normed algebra so as to include solutions to sets of monic polynomials over the original algebra. (One of these is a generalisation of a construction from the thesis…

Functional Analysis · Mathematics 2007-05-23 Thomas Dawson

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget