Related papers: Galois groups of polynomials and neurosymbolic net…

A Bayesian network is a graphical model that encodes probabilistic relationships among variables of interest. When used in conjunction with statistical techniques, the graphical model has several advantages for data analysis. One, because…

Motivated by developing algorithms that decide hypertranscendence of solutions of extensions of the Bessel differential equation, algorithms computing the unipotent radical of a parameterized differential Galois group have been recently…

In this paper we develop a differential Galois theory for algebraic Lie-Vessiot systems in algebraic homogeneous spaces. Lie-Vessiot systems are non autonomous vector fields that are linear combinations with time-dependent coefficients of…

We extend and apply the Galois theory of linear differential equations equipped with the action of an endomorphism. The Galois groups in this Galois theory are difference algebraic groups and we use structure theorems for these groups to…

This paper introduces Polynomial Graphical Lasso (PGL), a new approach to learning graph structures from nodal signals. Our key contribution lies in modeling the signals as Gaussian and stationary on the graph, enabling the development of a…

Graph neural networks (GNNs) excel at predictive tasks on graph-structured data but often lack the ability to incorporate symbolic domain knowledge and perform general reasoning. Relational Bayesian Networks (RBNs), in contrast, enable…

This article studies the Galois groups that arise from division points of the lemniscate. We compute these Galois groups two ways: first, by class field theory, and second, by proving the irreducibility of lemnatomic polynomials, which are…

In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…

Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…

In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…

We compare several definitions of the Galois group of a linear difference equation that have arisen in algebra, analysis and model theory and show, that these groups are isomorphic over suitable fields. In addition, we study properties of…

I discuss a seemingly unlikely confluence of topics in algebra, numerical computation, and computer vision. The motivating problem is that of solving multiples instances of a parametric family of systems of algebraic (polynomial or rational…

For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…

We develop a Galois theory for systems of linear difference equations with periodic parameters, for which we also introduce linear difference algebraic groups. We then apply this to constructively test if solutions of linear q-difference…

Employing equivariance in neural networks leads to greater parameter efficiency and improved generalization performance through the encoding of domain knowledge in the architecture; however, the majority of existing approaches require an a…

In the first part of this paper we try to explain to a general mathematical audience some of the remarkable web of conjectures linking representations of Galois groups with algebraic geometry, complex analysis and discrete subgroups of Lie…

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

These notes are an exposition of Galois Theory from the original Lagrangian and Galoisian point of view. A particular effort was made here to better understand the connection between Lagrange's purely combinatorial approach and Galois…

We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…

We introduce a cohomology set for groups defined by algebraic difference equations and show that it classifies torsors under the group action. This allows us to compute all torsors for large classes of groups. We also develop some tools for…