相关论文: Galois groups of Schubert problems via homotopy co…

We develop a certified numerical algorithm for computing Galois/monodromy groups of parametrized polynomial systems. Our approach employs certified homotopy path tracking to guarantee the correctness of the monodromy action produced by the…

We establish a connection between the theory of cyclotomic ideal class groups and the theory of "geometric" Galois modules and obtain results on the Galois module structure of coherent cohomology groups of Galois covers of varieties over Z.…

For every number field and every Cartan Killing type, there is an associated split simple algebraic group. We examine whether the corresponding arithmetic subgroups are profinitely solitary so that the commensurability class of the…

We study Galois embedding problems arising from the 3-torsion of elliptic curves defined over $\mathbb{Q}$, extending the correspondence to all possible images of mod 3 Galois representations; namely,…

Enumerative algebraic geometry counts the solutions to certain geometric constraints. Numerical algebraic geometry determines these solutions for any given instance. This article illustrates how these two fields complement each other. Our…

Many aspects of Schubert calculus are easily modeled on a computer. This enables large-scale experimentation to investigate subtle and ill-understood phenomena in the Schubert calculus. A well-known web of conjectures and results in the…

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…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…

We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…

We show that the Galois group of the polynomial in the title is isomorphic to the full symmetric group on six symbols for all but finitely many $n$. This complements earlier work of Filaseta and Moy, who studied Galois groups 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…

Let $G$ be a finite group and let $N/E$ be a tamely ramified $G$-Galois extension of number fields. We show how Stickelberger's factorization of Gauss sums can be used to determine the stable isomorphism class of various arithmetic…

The classical Neukirch-Uchida theorem states that the absolute Galois group determines a number field up to isomorphism. We prove an analogue of this theorem for 3-manifolds in the framework of arithmetic topology. We study infinite links…

We present a general method for constructing real solutions to some problems in enumerative geometry which gives lower bounds on the maximum number of real solutions. We apply this method to show that two new classes of enumerative…

Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…

In recent work on holomorphic maps that are symmetric under certain complex reflection groups---generated by complex reflections through a set of hyperplanes, the author announced a general conjecture related to reflection groups. The claim…

The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…

We discuss the following two problems: 1) The properties of the multiple zeta-values and their generalizations, multiple polylogarithms at N-th roots of unity; 2) The action of the absolute Galois group on the pro-l-completion of the…