Related papers: Moebius transforms and cyclic equations
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
We propose a conjectural characterization of when the dynamical Galois group associated to a polynomial is abelian, and we prove our conjecture in several cases, including the stable quadratic case over ${\mathbb Q}$. In the postcritically…
We give necessary conditions for a category fibred in pseudo-abelian additive categories over the classifying topos of a profinite group to be a stack; these conditions are sufficient when the coefficients are $\mathbf{Q}$-linear. This…
This note presents Galois theory for finite fields. It was written as a handout for the MAT401 course ``Polynomial equations and fields'' taught at the University of Toronto in Spring 2026. We use without proofs some basic properties of…
We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.
For an additive polynomial and a positive integer, we define an irreducible smooth representation of a Weil group of a non-archimedean local field. We study several invariants of this representation. We deduce a necessary and sufficient…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
We construct Galois theory for sublattices of certain complete modular lattices and their automorphism groups. A well-known description of the intermediate subgroups of the general linear group over an Artinian ring containing the group of…
The purpose of this paper is to construct q-Euler numbers and polynomials by using p-adic q-integral equations on Zp. Finally, we will give some interesting formulae related to these q-Euler numbers and polynomials.
In this paper, we list several interesting structures of cyclotomic polynomials: specifically relations among blocks obtained by suitable partition of cyclotomic polynomials. We present explicit and self-contained proof for all of them,…
We develop a certified numerical algorithm for computing Galois/monodromy groups of parametrized polynomial systems. Our approach employs certified homotopy path tracking to guarantee the correctness of the monodromy action produced by the…
We show that Galois theory of cyclotomic number fields provides a powerful tool to construct systematically integer-valued matrices commuting with the modular matrix S, as well as automorphisms of the fusion rules. Both of these…
We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums,…
We construct algebras of endomorphisms in the derived category of the cohomology of arithmetic manifolds, which are generated by Hecke operators. We construct Galois representations with coefficients in these Hecke algebras and apply this…
We investigate the construction and properties of Clifford algebras by a similar manner as our previous construction of the octonions, namely as a twisting of group algebras of Z_2^n by a cocycle. Our approach is more general than the usual…
Let $L_n$ be a simplest cubic field with Galois group $G=\rm{Gal} (L_n/\mathbb Q)$. The associated order is denoted as ${\cal A}_{L_n/\mathbb Q}:= \{ x\in {\mathbb Q} [G] \, |\, x \cdot \cal{O}_{L_n} \subset {\cal O}_{L_n } \}$, where…
A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The primitive operations involved are byte-wise shifts and…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
It has been recently discovered that exceptional families of Sturm-Liouville orthogonal polynomials exist, that generalize in some sense the classical polynomials of Hermite, Laguerre and Jacobi. In this paper we show how new families of…