Related papers: From Polynomials to Databases: Arithmetic Structur…

By using the action of certain Galois groups on complex irreducible characters and conjugacy classes, we define the Galois characters and Galois classes. We will introduce a set of Galois characters, called Galois irreducible characters,…

Grothendieck's theory of dessins provides a bridge between algebraic numbers and combinatorics. This paper adds a new concept, called 'bias', to the bridge. This produces: (i) from a biased plane tree the construction of a sequence of…

This paper provides a realization of all classical and most exceptional finite groups of Lie type as Galois groups over function fields over F_q and derives explicit additive polynomials for the extensions. Our unified approach is based on…

We describe Galois connections which arise between two kinds of combinatorial structures, both of which generalize trees with labelled leaves, and then apply those connections to a family of polytopes. The graphs we study can be imbued with…

Let $p\geq 7$ be a prime and $n>1$ be a natural number. We show that there exist infinitely many Galois representations $\varrho:Gal(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow GL_{n}(\mathbb{Z}_p)$ which are unramified outside $\{p, \infty\}$…

We relate two different proposals to extend the \'etale topology into homotopy theory, namely via the notion of finite cover introduced by Mathew and via the notion of separable commutative algebra introduced by Balmer. We show that finite…

We explore families of pairs of quadratic polynomials $f(x)=x^2+c\in \mathbb{Q}$ and $a\in \mathbb{Q}$ with $a$ being a strictly preperiodic point of $f$ to provide infinitely many new examples for which the associated arboreal Galois…

We investigate the nature of divergences in quantum field theory, showing that they are organized in the structure of a certain `` motivic Galois group'', which is uniquely determined and universal with respect to the set of physical…

Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full…

In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois…

The classical Galois theory deals with certain finite algebraic extensions and establishes a bijective order reversing correspondence between the intermediate fields and the subgroups of a group of permutations called the Galois group of…

Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…

We establish a Galois connection between sub-monads of an augmented monad and sub-functors of the forgetful functor from its Eilenberg-Moore category. This connection is given in terms of invariants and stabilizers defined through universal…

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…

Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical algebraic geometry, whose development has been driven by applications of mathematics. We use numerical homotopy continuation to investigate…

Let $\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore that for…

In Proposition I of "Memoire sur les conditions de resolubilite des equations par radicaux", Galois established that any intermediate extension of the splitting field of a polynomial with rational coefficients is the fixed field of its…

The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…

Let $n \geq 2$ and $p$ be a prime. Let $K$ be a number field and consider two Galois representations $\rho_1, \rho_2 : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_n(\mathbb{Z}_p)$ having residual image a $p$-group. We explain…

This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…