Related papers: From Polynomials to Databases: Arithmetic Structur…
Graded-division algebras are building blocks in the theory of finite-dimensional associative algebras graded by a group G. If G is abelian, they can be described, using a loop construction, in terms of central simple graded-division…
Humans develop certain cognitive abilities to recognize objects and their transformations without explicit supervision, highlighting the importance of unsupervised representation learning. A fundamental challenge in unsupervised…
This paper deals with criteria of algebraic independence for the derivatives of solutions of rank one difference equations. The key idea consists in deriving from the commutativity of the differentiation and difference operators a sequence…
We introduce and develop a structure theory of a new class of noncommutative rings - Galois orders, that generalize classical orders in noncommutative rings. Galois orders realized as certain subrings of invariants in skew semigroup rings.…
We present new theoretical results on the existence of intersective polynomials with certain prescribed Galois groups, namely the projective and affine linear groups $PGL_2(\ell)$ and $AGL_2(\ell)$ as well as the affine symplectic groups…
Normalizing flows model complex probability distributions by combining a base distribution with a series of bijective neural networks. State-of-the-art architectures rely on coupling and autoregressive transformations to lift up invertible…
Born from years of teaching undergraduate and graduate algebra courses at Chongqing University, this text is designed to introduce Galois theory while minimizing prerequisites. It seeks to reconnect the abstract machinery of modern algeba:…
By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…
We present short elementary proofs of the well-known Ruffini-Abel-Galois theorems on insolvability of algebraic equations in radicals. These proofs are obtained from existing expositions by stripping away material not required for the…
In previous works, we described algorithms to compute the number field cut out by the mod ell representation attached to a modular form of level N=1. In this article, we explain how these algorithms can be generalised to forms of higher…
This paper presents a connection between Galois points and rational functions over a finite field with small value sets. This paper proves that the defining polynomial of any plane curve admitting two Galois points is an irreducible…
We produce a new family of polynomials f(x) over fields K of characteristic 2 which are exceptional, in the sense that f(x)-f(y) has no absolutely irreducible factors in K[x,y] besides the scalar multiples of x-y; when K is finite, this…
The supermultiplet model, based on the reduction chain $\mathfrak{su}(4) \supset \mathfrak{su}(2) \times \mathfrak{su}(2)$, is revisited through the lens of commutants within universal enveloping algebras of Lie algebras. From this…
A lot of work has gone into computing images of Galois representations coming from elliptic curves. This article presents an algorithm to determine the image of the mod-$3$ Galois representation associated to a principally polarized abelian…
In 1992, Avner Ash and Mark McConnell presented computational evidence of a connection between three-dimensional Galois representations and certain arithmetic cohomology classes. For some examples they were unable to determine the attached…
We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…
In this paper, we explain how to compute the Lie algebra of the differential Galois group of a reducible linear differential system. We achieve this by showing how to transform a block-triangular linear differential system into a…
Substitution Box or S-Box had been generated using 4-bit Boolean Functions (BFs) for Encryption and Decryption Algorithm of Lucifer and Data Encryption Standard (DES) in late sixties and late seventies respectively. The S-box of Advance…
In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…
A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…