Related papers: From Polynomials to Databases: Arithmetic Structur…

An algebraic technique is presented that does not use results of model theory and makes it possible to construct a general Galois theory of arbitrary nonlinear systems of partial differential equations. The algebraic technique is based on…

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

We generalize the notion of semi-normalized classes of systems of differential equations, study properties of such classes and extend the algebraic method of group classification to them. In particular, we prove the important theorems on…

We compute the first explicit polynomials with Galois groups $G=P\Gamma L_3(4)$, $PGL_3(4)$, $PSL_3(4)$ and $PSL_5(2)$ over $\mathbb{Q}(t)$. Furthermore we compute the first examples of totally real polynomials with Galois groups…

We present a fully non neural learning framework based on Graph Laplacian Wavelet Transforms (GLWT). Unlike traditional architectures that rely on convolutional, recurrent, or attention based neural networks, our model operates purely in…

We show how the output of the algorithm to compute modular Galois representations described in our previous article can be certified. We have used this process to compute certified tables of such Galois representations obtained thanks to an…

A Gelfand model for a semisimple algebra A over C is a complex linear representation that contains each irreducible representation of A with multiplicity exactly one. We give a method of constructing these models that works uniformly for a…

The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the…

We study the middle convolution of local systems on the punctured affine line in the setting of singular cohomology and in the setting of \'etale cohomology. We derive a formula to compute the topological monodromy of the middle convolution…

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

Let $G$ be a Frobenius group with an abelian Frobenius kernel $F$ and let $k$ be a finite extension of $\mathbb{Q}$. We obtain an upper bound for the number of degree $|F|$ algebraic extensions $K/k$ with Galois group $G$ with the norm of…

A categorical theory for the discretization of a large class of dynamical systems with variable coefficients is proposed. It is based on the existence of covariant functors between the Rota category of Galois differential algebras and…

Let K be a number field, and let lambda(x,t)\in K[x, t] be irreducible over K(t). Using algebraic geometry and group theory, we study the set of alpha\in K for which the specialized polynomial lambda(x,alpha) is K-reducible. We apply this…

We prove that the arboreal Galois representations attached to certain unicritical polynomials have finite index in an infinite wreath product of cyclic groups, and we prove surjectivity for some small degree examples, including a new family…

We develop a computational framework for the statistical characterization of Galois characters with finite image, with application to characterizing Galois groups and establishing equivalence of characters of finite images of…

Let $A$ be a unital associative algebra over a field $k$. All unital associative algebras containing $A$ as a subalgebra of a given codimension $\mathfrak{c}$ are described and classified. For a fixed vector space $V$ of dimension…

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…

The computation of the characters of supercuspidal representations of a p-adic group involves some 4th roots of unity whose values are defined in terms of orbits of the Galois group of a p-field on a root system. The part of the definition…

We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.