March 22, 2022
This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as the permutation group of the roots of $f(x)$ and the approximate roots with sufficient precision beforehand. Of course, the approximate roots are not necessary but can help reduce the quantity of computation. The algorithm complexity is appr...
February 29, 2000
In this survey I should like to introduce some concepts of algebraic geometry and try to demonstrate the fruitful interaction between algebraic geometry and computer algebra and, more generally, between mathematics and computer science. One of the aims of this article is to show, by means of examples, the usefulness of computer algebra to mathematical research.
September 18, 2000
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 groups have been regarded as amongst the most mysterious objects in number theory. Very little has hitherto been discovered regarding them despite their importance in studying p-adic Galois representations unramified at p. The conjectures of ...
October 24, 2006
In the thesis we present a new method for parametrizing algebraic varieties over the field of characteristic zero. The problem of parametrizing is reduced to a problem of finding an isomorphism of algebras. We introduce the Lie algebra of a variety as a Lie algebra related to its group of automorphisms. Constructing an isomorphism of this one and some classical Lie algebra (for example the algebra of matrices of the zero trace) then leads to parametrizing the variety. The p...
July 8, 2018
An irreducible, algebraic curve $\mathcal X_g$ of genus $g\geq 2$ defined over an algebraically closed field $k$ of characteristic $\mbox{char } \, k = p \geq 0$, has finite automorphism group $\mbox{Aut} (\mathcal X_g)$. In this paper we describe methods of determining the list of groups $\mbox{Aut} (\mathcal X_g)$ for a fixed $g\geq 2$. Moreover, equations of the corresponding families of curves are given when possible.
March 25, 2020
Given an irreducible bivariate polynomial $f(t,x)\in \mathbb{Q}[t,x]$, what groups $H$ appear as the Galois group of $f(t_0,x)$ for infinitely many $t_0\in \mathbb{Q}$? How often does a group $H$ as above appear as the Galois group of $f(t_0,x)$, $t_0\in \mathbb{Q}$? We give an answer for $f$ of large $x$-degree with alternating or symmetric Galois group over $\mathbb{Q}(t)$. This is done by determining the low genus subcovers of coverings $\tilde{X}\rightarrow \mathbb{P}^1_{...
October 5, 2022
This paper presents a new characterisation of the Fermat curve, according to the arrangement of Galois points.
August 8, 2019
We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the equations of subvarieties of X that realize these cycles. In practice, a bulk of the computations involve transcendental numbers and have to be carried out with floating point numbers. However, if X is defined over algebraic numbers then the ...
November 27, 2012
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this paper, we present the full development of a generation engine by describing the related theory, establishing a mathematical and practical complexity, and exposing some benchmarks. We next show two applications to effective invariant theory and ...
May 10, 2021
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic subproblems, and whether or not it has any symmetries. Tools from numerical algebraic geometry and computational group theory allow us to apply this framework to classical and novel reconstruction problems. We consider three classical cases--3-p...