Related papers: Solving Parameterized Polynomial Systems with Deco…

We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…

A numerical irreducible decomposition for a polynomial system provides representations for the irreducible factors of all positive dimensional solution sets of the system, separated from its isolated solutions. Homotopy continuation methods…

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…

The problem of solving tropical linear systems, a natural problem of tropical mathematics, has already proven to be very interesting from the algorithmic point of view: it is known to be in $NP\cap coNP$ but no polynomial time algorithm is…

We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

This paper proposes a novel computational framework for the solution of geometrically parametrised flow problems governed by the Stokes equation. The proposed method uses a high-order hybridisable discontinuous Galerkin formulation and the…

A strategy to address the inverse Galois problem over Q consists of exploiting the knowledge of Galois representations attached to certain automorphic forms. More precisely, if such forms are carefully chosen, they provide compatible…

We present a means of formulating and solving the well known structure-and-motion problem in computer vision with probabilistic graphical models. We model the unknown camera poses and 3D feature coordinates as well as the observed 2D…

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

We use a rigidity argument to prove the existence of two related degree twenty-eight covers of the projective plane with Galois group SU3(3).2 = G2(2). Constructing corresponding two-parameter polynomials directly from the defining…

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

We explore the enumerative problem of finding lines on cubic surfaces defined by symmetric polynomials. We prove that the moduli space of symmetric cubic surfaces is an arithmetic quotient of the complex hyperbolic line, and determine…

Let $L(x)$ be any $q$-linearized polynomial with coefficients in $\mathbb{F}_q$, of degree $q^n$. We consider the Galois group of $L(x)+tx$ over $\mathbb{F}_q(t)$, where $t$ is transcendental over $\mathbb{F}_q$. We prove that when $n$ is a…

For every nonconstant rational function $\phi\in\mathbb{Q}(x)$, the Galois groups of the dynatomic polynomials of $\phi$ encode various properties of $\phi$ that are of interest in the subject of arithmetic dynamics. We study here the…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

Parahoric group schemes are certain possibly non-reductive, smooth, affine integral models of reductive group schemes defined over a henselian discretely valued field $K$ whose residue field is perfect. We show that any such group scheme…

We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be…

In the preprint we present an outline of the one dimensional version of topological Galois theory. The theory studies topological obstruction to solvability of equations "in finite terms" (i.e. to their solvabilty by radicals, by elementary…

We provide a new tableau model from which one can easily deduce the characters of finite-dimensional irreducible polynomial representations of the special orthogonal group $SO_n(\mathbb{C})$. This model originates from the representation…