English
Related papers

Related papers: Solving Parameterized Polynomial Systems with Deco…

200 papers

We extend and apply the Galois theory of linear differential equations equipped with the action of an endomorphism. The Galois groups in this Galois theory are difference algebraic groups and we use structure theorems for these groups to…

Commutative Algebra · Mathematics 2015-04-22 Lucia Di Vizio , Charlotte Hardouin , Michael Wibmer

Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…

Rings and Algebras · Mathematics 2024-07-24 Gang Hu

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…

Number Theory · Mathematics 2020-03-13 Christopher Doris

Computation biology helps to understand all processes in organisms from interaction of molecules to complex functions of whole organs. Therefore, there is a need for mathematical methods and models that deliver logical explanations in a…

Molecular Networks · Quantitative Biology 2018-10-10 Ines Abdeljaoued-Tej , Alia BenKahla , Ghassen Haddad , Annick Valibouze

We deal with aspects of the direct and inverse problems in parameterized Picard-Vessiot (PPV) theory. It is known that, for certain fields, a linear differential algebraic group (LDAG) G is a PPV Galois group over these fields if and only…

Commutative Algebra · Mathematics 2019-02-20 Andrey Minchenko , Alexey Ovchinnikov , Michael F. Singer

We study the postcritically finite non-polynomial map $f(x)=\frac{1}{(x-1)^2}$ over a number field $k$ and prove various results about the geometric $G^{\text{geom}}(f)$ and arithmetic $G^{\text{arith}}(f)$ iterated monodromy groups of $f$.…

Number Theory · Mathematics 2023-08-30 Ozlem Ejder , Yasemin Kara , Ekin Ozman

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Discrete Mathematics · Computer Science 2025-09-29 Mehul Bafna , Shaghik Amirian

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Computational Complexity · Computer Science 2016-06-09 Gabor Ivanyos , Miklos Santha

Born from years of teaching undergraduate and graduate algebra courses at Chongqing University, this text is designed to introduce Galois theory while minimizing prerequisites. It seeks to reconnect the abstract machinery of modern algeba:…

History and Overview · Mathematics 2026-01-06 Huichi Huang

The main objective of this work is to describe a general and original approach for computing an off-line solution for a set of parameters describing the geometry of the domain. That is, a solution able to include information for different…

Numerical Analysis · Mathematics 2019-09-26 Ruben Sevilla , Sergio Zlotnik , Antonio Huerta

In our previous work, a unified description as polynomial Hamiltonian systems was established for a broad class of the Schlesinger systems including the sixth Painleve equation and Garnier systems. The main purpose of this paper is to…

Classical Analysis and ODEs · Mathematics 2010-09-15 Teruhisa Tsuda

The arboreal Galois group of a polynomial $f$ over a field $K$ encodes the action of Galois on the iterated preimages of a root point $x_0\in K$, analogous to the action of Galois on the $\ell$-power torsion of an abelian variety. We…

Number Theory · Mathematics 2021-12-14 Faseeh Ahmad , Robert L. Benedetto , Jennifer Cain , Gregory Carroll , Lily Fang

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

Symbolic Computation · Computer Science 2020-05-06 Tao Zheng

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…

Computational Geometry · Computer Science 2016-03-22 Michael J. Bannister , William E. Devanny , David Eppstein , Michael T. Goodrich

In Proposition I of "Memoire sur les conditions de resolubilite des equations par radicaux", Galois established that any intermediate extension of the splitting field of a polynomial with rational coefficients is the fixed field of its…

Category Theory · Mathematics 2007-05-23 Eduardo J. Dubuc

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

We consider some examples of superintegrable system which were recently isolated through a differential Galois group analysis. The identity of these systems is clarified and the corresponding Poisson algebras derived.

Exactly Solvable and Integrable Systems · Physics 2017-04-05 Allan P. Fordy

In this paper we study the universal lifting spaces of local Galois representations valued in arbitrary reductive group schemes when $\ell \neq p$. In particular, under certain technical conditions applicable to any root datum we construct…

Number Theory · Mathematics 2024-10-08 Jeremy Booher , Sean Cotner , Shiang Tang

The radical solution of polynomials with rational coefficients is a famous solved problem. This paper found that it is a $\mathbb{NP}$ problem. Furthermore, this paper found that arbitrary $ \mathscr{P} \in \mathbb{P}$ shall have a one-way…

Computational Complexity · Computer Science 2024-05-28 Bojin Zheng , Weiwu Wang

This paper offers an approach to deal with parametrized nonlinear strongly coupled thermo-poroelasticity problems. The approach uses the LATIN-PGD method and extends previous work in multiphysics problems. Proper Generalized Decomposition…

Classical Physics · Physics 2025-08-28 Elise Foulatier , David Néron , François Louf , Pierre-Alain Boucard
‹ Prev 1 4 5 6 7 8 10 Next ›