5,875 research outputs found

    Galois groups of Schubert problems via homotopy computation

    Full text link
    Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical algebraic geometry, whose development has been driven by applications of mathematics. We use numerical homotopy continuation to investigate the problem in pure mathematics of determining Galois groups in the Schubert calculus. For example, we show by direct computation that the Galois group of the Schubert problem of 3-planes in C^8 meeting 15 fixed 5-planes non-trivially is the full symmetric group S_6006.Comment: 17 pages, 4 figures. 3 references adde

    The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings

    Get PDF
    Many well-known graph drawing techniques, including force directed drawings, spectral graph layouts, multidimensional scaling, and circle packings, have algebraic formulations. However, practical methods for producing such drawings ubiquitously use iterative numerical approximations rather than constructing and then solving algebraic expressions representing their exact solutions. To explain this phenomenon, we use Galois theory to show that many variants of these problems have solutions that cannot be expressed by nested radicals or nested roots of low-degree polynomials. Hence, such solutions cannot be computed exactly even in extended computational models that include such operations.Comment: Graph Drawing 201

    On computing Belyi maps

    Get PDF
    We survey methods to compute three-point branched covers of the projective line, also known as Belyi maps. These methods include a direct approach, involving the solution of a system of polynomial equations, as well as complex analytic methods, modular forms methods, and p-adic methods. Along the way, we pose several questions and provide numerous examples.Comment: 57 pages, 3 figures, extensive bibliography; English and French abstract; revised according to referee's suggestion

    Numerical verification of the Cohen-Lenstra-Martinet heuristics and of Greenberg's pp-rationality conjecture

    Get PDF
    In this paper we make a series of numerical experiments to support Greenberg's pp-rationality conjecture, we present a family of pp-rational biquadratic fields and we find new examples of pp-rational multiquadratic fields. In the case of multiquadratic and multicubic fields we show that the conjecture is a consequence of the Cohen-Lenstra-Martinet heuristic and of the conjecture of Hofmann and Zhang on the pp-adic regulator, and we bring new numerical data to support the extensions of these conjectures. We compare the known algorithmic tools and propose some improvements

    Automorphisms of Curves and Weierstrass semigroups for Harbater-Katz-Gabber covers

    Full text link
    We study pp-group Galois covers XP1X \rightarrow \mathbb{P}^1 with only one fully ramified point. These covers are important because of the Katz-Gabber compactification of Galois actions on complete local rings. The sequence of ramification jumps is related to the Weierstrass semigroup of the global cover at the stabilized point. We determine explicitly the jumps of the ramification filtrations in terms of pole numbers. We give applications for curves with zero pp--rank: we focus on maximal curves and curves that admit a big action. Moreover the Galois module structure of polydifferentials is studied and an application to the tangent space of the deformation functor of curves with automorphisms is given
    corecore