Related papers: Certifying Galois/monodromy Actions via Homotopy G…
The homotopy continuation method has been widely used in solving parametric systems of nonlinear equations. But it can be very expensive and inefficient due to singularities during the tracking even though both start and end points are…
We present a certified algorithm that takes a smooth algebraic curve in $\mathbb{R}^n$ and computes an isotopic approximation for a generic projection of the curve into $\mathbb{R}^2$. Our algorithm is designed for curves given implicitly…
This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…
To a "stable homotopy theory" (a presentable, symmetric monoidal stable $\infty$-category), we naturally associate a category of finite \'etale algebra objects and, using Grothendieck's categorical machine, a profinite group that we call…
The automorphism group of the Galois covering induced by a pluri-canonical generic covering of a projective space is investigated. It is shown that by means of such coverings one obtains, in dimensions one and two, serieses of specific…
Three aspects of applying homotopy continuation, which is commonly used to solve parameterized systems of polynomial equations, are investigated. First, for parameterized systems which are homogeneous, we investigate options for performing…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
We determine the representation of the group of automorphisms for cyclotomic function fields in characteristic $p > 0$ induced by the natural action on the space of holomorphic differentials via construction of an explicit basis of…
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…
We study the arithmetic and geometric iterated monodromy groups associated to the postcritically finite (PCF) quadratic rational function $f(x)=\frac{2}{(x-1)^2}$ defined over a number field $k$, whose critical points are both strictly…
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…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
This paper clarifies the main research methods and ideas of the thesis [1,2,4]. The special calculation process is also realized by corresponding computer algorithm. Finally, we introduce zero rows sum case and give the corresponding…
Verifying graph algorithms has long been considered challenging in separation logic, mainly due to structural sharing between graph subcomponents. We show that these challenges can be effectively addressed by representing graphs as a…
In this article we survey and examine the realizability of $p$-groups as Galois groups over arbitrary fields. In particular we consider various cohomological criteria that lead to necessary and sufficient conditions for the realizability of…
The Galois group of a family of cubic surfaces is the monodromy group of the 27 lines of its generic fibre. We describe a method to compute this group for linear systems of cubic surfaces using certified numerical computations. Applying…
In this paper, we review a method for computing and parameterizing the set of homotopy classes of chain maps between two chain complexes. This is then applied to finding topologically meaningful maps between simplicial complexes, which in…