English
Related papers

Related papers: Functional equations in polynomials

200 papers

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

Algebraic Geometry · Mathematics 2013-05-07 Pinaki Mondal , Tim Netzer

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

We determine the roots in F_{q^3} of the polynomial X^{2q^k+1} + X + c for each positive integer k and each c in F_q, where q is a power of 2. We introduce a new approach for this type of question, and we obtain results which are more…

Number Theory · Mathematics 2023-02-28 Zhiguo Ding , Michael E. Zieve

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

Data Structures and Algorithms · Computer Science 2018-01-22 Joergen Bang-Jensen , Stéphane Bessy

A function in a class $\mathcal{F}(X)$ is said to be subdifferentially determined in $\mathcal{F}(X)$ if it is equal up to an additive constant to any function in $\mathcal{F}(X)$ with the same subdifferential. A function is said to be…

Optimization and Control · Mathematics 2018-10-16 Marc Lassonde

Let $g_1,\dots, g_s \in \mathbb{R}[X_1,\dots, X_n,Y]$ and $S = \{(\bar{x},y)\in \mathbb{R}^{n+1} \mid g_1(\bar{x},y) \ge 0, \dots, g_s(\bar{x}, y) \ge 0\}$ be a non-empty, possibly unbounded, subset of a cylinder in $\mathbb{R}^{n+1}$. Let…

Algebraic Geometry · Mathematics 2024-01-09 Gabriela Jeronimo , Daniel Perrucci

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Combinatorics · Mathematics 2015-08-04 Alexander Barvinok , Pablo Soberón

Polynomial functors are a categorical generalization of the usual notion of polynomial, which has found many applications in higher categories and type theory: those are generated by polynomials consisting a set of monomials built from sets…

Logic in Computer Science · Computer Science 2021-12-30 Eric Finster , Samuel Mimram , Maxime Lucas , Thomas Seiller

The equation $f^n+g^n=1$, $n\in\mathbb{N}$ can be regarded as the Fermat Diophantine equation over the function field. In this paper we study the characterization of entire solutions of some system of Fermat type functional equations by…

Complex Variables · Mathematics 2023-11-01 Goutam Haldar

We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing…

Number Theory · Mathematics 2023-02-28 Zhiguo Ding , Michael E. Zieve

We treat two related trigonometric functional equations on semigroups. First we solve the $\mu$-sine subtraction law \[\mu(y) k(x \sigma(y))=k(x) l(y)-k(y) l(x), \quad x, y \in S,\] for $k, l : S\rightarrow \mathbb{C}$, where $S$ is a…

Functional Analysis · Mathematics 2022-10-18 Youssef Aserrar , Elhoucien Elqorachi

We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…

Rings and Algebras · Mathematics 2009-05-08 Mark Kambites

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…

Number Theory · Mathematics 2007-05-23 Roland Bacher

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Group Theory · Mathematics 2022-02-11 Dominik Bernhardt , Tim Boykett , Alice Devillers , Johannes Flake , S. P. Glasby

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

We investigate semiconjugate rational functions, that is rational functions $A,$ $B$ related by the functional equation $A\circ X=X\circ B$, where $X$ is a rational function of degree at least two. We show that if $A$ and $B$ is a pair of…

Dynamical Systems · Mathematics 2016-08-17 F. Pakovich

We consider differential-algebraic equations in infinite dimensional state spaces and study, under which conditions we can associate a $C_{0}$-semigroup with such equations. We determine the right space of initial values and characterise…

Functional Analysis · Mathematics 2020-01-07 Sascha Trostorff

Let $\mathbb{F}$ be a finite field and let $f$ be a linear polynomial in $\mathbb{F}[x]$. We investigate the number of polynomials of degree $d$ which commute with $f$ under composition. In so doing, we rediscover a result of Park, but with…

Number Theory · Mathematics 2023-06-16 Jeffrey Hatley , Mayah Teplitskiy

There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…

Rings and Algebras · Mathematics 2016-10-27 Sophie Frisch

We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…

Combinatorics · Mathematics 2007-05-23 Ki Hang Kim , Fred W. Roush