Related papers: Elementary characters on semigroups: the rational …
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and $q$-difference equations for these polynomials. A general functional equation is found which allows one to relate…
We describe the Alexander modules and Alexander polynomials (both over $\Q$ and over finite fields $\FF{p}$) of generalized trigonal curves. The rational case is closed completely; in the case of characteristic $p>0$, a few points remain…
We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…
The method of little groups describes the irreducible characters of semidirect products with abelian normal subgroups in terms of the irreducible characters of the factor groups. We modify this method to construct supercharacter theories of…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension…
We single out a large class of semisimple singularities with the property that all roots of the Poincar\'e polynomial of the Lie algebra of derivations of the corresponding suitably (not necessarily quasihomogeneously) graded moduli algebra…
A character of a finite group having degree $n$ takes values which may be expressed as sums of $n$ or fewer roots of unity. In this note, we prove a result which describes the irreducible constituents of generalized characters on abelian…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
We obtain the extended genus field of an abelian extension of a rational function field. We follow the definition of Angl\`es and Jaulent, which uses class field theory. First we show that the natural definition of extended genus field of a…
The proof assistant Lean has support for abstract polynomials, but this is not necessarily the same as support for computations with polynomials. Lean is also a functional programming language, so it should be possible to implement…
We find all polynomials f,g,h over a field K such that g and h are linear and f(g(x))=h(f(x)). We also solve the same problem for rational functions f,g,h, in case the field K is algebraically closed.
The notion of a root functional of polynomials is a generalization of the notion of a root for a multiple root. A root functional is a linear functional that is defined on a polynomial ring and annuls the ideal of a system of polynomials. A…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…
Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…
We prove that every function that is meromorphic on the closure of an analytic Jordan domain and sufficiently well-behaved on the boundary is conformally equivalent to a rational map whose degree is smallest possible. We also show that the…
We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…