English
Related papers

Related papers: Elementary characters on semigroups: the rational …

200 papers

Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…

Rings and Algebras · Mathematics 2024-12-03 Zijia Li , Hans-Peter Schröcker , Mikhail Skopenkov , Daniel F. Scharler

In this paper a general theory of semi-classical matrix orthogonal polynomials is developed. We define the semi-classical linear functionals by means of a distributional equation $D(u A) = u B,$ where $A$ and $B$ are matrix polynomials.…

Classical Analysis and ODEs · Mathematics 2007-05-23 M. J. Cantero , L. Moral , L. Velazquez

The purpose of the present paper is to show that in certain classes of real (or complex) functions, the Bernoulli polynomials are essentially the only ones satisfying the Raabe functional equation. For the class of the real $1$-periodic…

Classical Analysis and ODEs · Mathematics 2023-03-28 Bakir Farhi

Let X be an affine real algebraic set . We investigate on the theory of algebraically constructible functions on X and the description of the semi-algebraic subsets of X when we replace the polynomial functions on X by some rational…

Algebraic Geometry · Mathematics 2017-12-21 Jean-Philippe Monnier

We define the notion of a semicharacter of a group G : A function from the group to C*, whose restriction to any abelian subgroup is a homomorphism. We conjecture that for any finite group, the order of the group of semicharacters is…

Group Theory · Mathematics 2013-11-12 Gil Alon

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Classical Analysis and ODEs · Mathematics 2008-03-11 Steve Fisk

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

Group Theory · Mathematics 2011-12-21 Robert Guralnick , Gunter Malle

In spite of the analogies between Q_p and F_p((t)) which became evident through the work of Ax and Kochen, an adaptation of the complete recursive axiom system given by them for Q_p to the case of F_p((t)) does not render a complete axiom…

Rings and Algebras · Mathematics 2013-04-02 Franz-Viktor Kuhlmann

We revisit factorizations of classical characters under various specializations, some old and some new. We first show that all characters of classical families of groups twisted by odd powers of an even primitive root of unity factorize…

Combinatorics · Mathematics 2026-03-31 Arvind Ayyer , Nishu Kumari

Suppose $\mathbb{F}$ is a field of prime characteristic $p$ and $E$ is a finite subgroup of the additive group $(\mathbb{F},+)$. Then $E$ is an elementary abelian $p$-group. We consider two such subgroups, say $E$ and $E'$, to be equivalent…

Commutative Algebra · Mathematics 2018-08-06 H. E. A. Campbell , J. Chuai , R. J. Shank , D. L. Wehlau

Planar functions are mappings from a finite field $\mathbb{F}_q$ to itself with an extremal differential property. Such functions give rise to finite projective planes and other combinatorial objects. There is a subtle difference between…

Combinatorics · Mathematics 2018-09-18 Daniele Bartoli , Kai-Uwe Schmidt

In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an…

Combinatorics · Mathematics 2018-02-22 S. Robins , C. Vignat

Our aim in this paper is to initiate the study of exponent semigroups for rational matrices. We prove that every numerical semigroup is the exponent semigroup of some rational matrix. We also obtain lower bounds on the size of such matrices…

Combinatorics · Mathematics 2024-09-04 Arsh Chhabra , Stephan Ramon Garcia , Fangqian Zhang , Hechun Zhang

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

The typical definition of the characteristic polynomial seems totally ad hoc to me. This note gives a canonical construction of the characteristic polynomial as the minimal polynomial of a "generic" matrix. This approach works not just for…

Rings and Algebras · Mathematics 2007-05-23 R. Skip Garibaldi

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

Computational Complexity · Computer Science 2014-12-16 Abhishek Bhowmick , Shachar Lovett

For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…

Commutative Algebra · Mathematics 2021-07-16 Karim Johannes Becher , Parul Gupta

Let $G$ be a group acting on a field $L$, and suppose that $L /L^G$ is a finite extension. We show that the category of semilinear representations of $G$ over $L$ can be described in terms of the category of linear representations of $H$,…

Representation Theory · Mathematics 2026-04-17 James Taylor

Let p be a prime. In this paper we provide a lower bound for the number of almost p-rational characters of degree coprime to p in the principal p-block of a finite group of order divisible by p. We further describe the p-local structure of…

Representation Theory · Mathematics 2024-09-18 Attila Maróti , J. Miquel Martínez , A. A. Schaeffer Fry , Carolina Vallejo

Planar functions are special functions from a finite field to itself that give rise to finite projective planes and other combinatorial objects. We consider polynomials over a finite field $K$ that induce planar functions on infinitely many…

Number Theory · Mathematics 2014-03-18 Florian Caullery , Kai-Uwe Schmidt , Yue Zhou