相关论文: Invariant Rational Functions, Linear Fractional Tr…

Polynomial functions on the group of units Q_n of the ring Z_{2^n} are considered. A finite set of reduced polynomials RP_n in Z[x] that induces the polynomial functions on Q_n is determined. Each polynomial function on Q_n is induced by a…

We demonstrate that the ring of invariants for the natural action of a subgroup G of GL_n(F_q) on a polynomial ring R=K[X_1,...,X_n] need not be F-pure. In these examples G is the symplectic group over a finite field, and the invariant…

Let $\mathbb{F}_q[t]$ denote the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements. We prove an estimate for fractional parts of polynomials over $\mathbb{F}_q[t]$ satisfying a certain divisibility condition…

We develop further the theory of $q$-deformations of real numbers introduced by Morier-Genoud and Ovsienko, and focus in particular on the class of real quadratic irrationals. Our key tool is a $q$-deformation of the modular group…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Using the description of the Frobenius limit of modules over the ring of invariants under an action of a finite group on a polynomial ring over a field of characteristic $p>0$ developed by Symonds and the author, we give a characterization…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

We show that if G is a Chevalley group of rank n and F_q[t,t^{-1}] is the ring of Laurent polynomials over a finite field, then G(F_q[t,t^{-1}]) is of type F_{2n-1}. This bound is optimal because it is known -- and we show again -- that the…

We examine general aspects of parity functions arising in rational conformal field theories, as a result of Galois theoretic properties of modular transformations. We focus more specifically on parity functions associated with affine Lie…

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

Let $F$ be any field containing the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that all powers of $x$ that appear in $L$ with nonzero coefficient have exponent a…

Let $G$ be a finite subgroup of $GL_4(\bm{Q})$. The group $G$ induces an action on $\bm{Q}(x_1,x_2,x_3,x_4)$, the rational function field of four variables over $\bm{Q}$. Theorem. The fixed subfield…

Permutation polynomials with explicit constructions over finite fields have long been a topic of great interest in number theory. In recent years, by applying linear translators of functions from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$, many…

We discuss a modification of Uq(sl(2,R)) and a class of its irreducible representations when q is a root of unity.

We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…