English
Related papers

Related papers: Constructions using Galois Theory

200 papers

The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the…

Commutative Algebra · Mathematics 2020-11-17 Charlotte Hardouin , Andrei Minchenko , Alexey Ovchinnikov

Given a prime $p$, a number field $\K$ and a finite set of places $S$ of $\K$, let $\K_S$ be the maximal pro-$p$ extension of $\K$ unramified outside $S$. Using the Golod-Shafarevich criterion one can often show that $\K_S/\K$ is infinite.…

Number Theory · Mathematics 2019-01-15 Farshid Hajir , Christian Maire , Ravi Ramakrishna

In this work, we show that given a finite p-group G, a number field K having a trivial p-class group Cl K , and a finite set of primes S of K, there exists a finite extension F/K such that the S-split p-Hilbert class field tower L S p (F )…

Number Theory · Mathematics 2025-08-12 Christian Maire , Karim Sankara

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…

Logic in Computer Science · Computer Science 2024-04-24 Thaynara Arielly de Lima , Andréia Borges Avelar , André Luiz Galdino , Mauricio Ayala-Rincón

In this paper, we give a geometrization and a generalization of a lemma of differential Galois theory. This geometrization, in addition of giving a nice insight on this result, offers us the occasion to investigate several points of…

Algebraic Geometry · Mathematics 2010-12-03 Colas Bardavid

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

I show how to construct Monte Carlo algorithms (programs), prove that they are correct and document them. Complicated algorithms are build using a handful of elementary methods. This construction process is transparently illustrated using…

Computational Physics · Physics 2007-05-23 S. Jadach

In [2], an exhaustive construction is achieved for the class of all 4-dimensional unital division algebras over finite fields of odd order, whose left nucleus is not minimal and whose automorphism group contains Klein's four-group. We…

Rings and Algebras · Mathematics 2019-08-20 Ernst Dieterich

A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…

Group Theory · Mathematics 2011-05-11 Vik. S. Kulikov

In the context of a tower of (strongly Birkhoff) Galois structures in the sense of categorical Galois theory, we show that the concept of a higher covering admits a characterisation which is at the same time absolute (with respect to the…

Category Theory · Mathematics 2023-07-26 Fara Renaud , Tim Van der Linden

Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections using proof assistants remains limited to…

Programming Languages · Computer Science 2019-07-10 David Darais , David Van Horn

We introduce a cohomology set for groups defined by algebraic difference equations and show that it classifies torsors under the group action. This allows us to compute all torsors for large classes of groups. We also develop some tools for…

Algebraic Geometry · Mathematics 2016-07-26 Annette Bachmayr , Michael Wibmer

Certain towers of function fields with complete splitting of rational places at each stage are constructed. Also, families oof towers with positive N/g ratios are described.

Number Theory · Mathematics 2007-05-23 Vinay Deolalikar

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

Number Theory · Mathematics 2010-03-23 Bas Edixhoven , Jean-Marc Couveignes , Robin de Jong , Franz Merkl , Johan Bosman

We introduce the concept of a Galois covering of a pointed coalgebra. The theory developed shows that Galois coverings of pointed coalgebras can be concretely expressed by smash coproducts using the coaction of the automorphism group of the…

Representation Theory · Mathematics 2010-06-08 William Chin

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…

Representation Theory · Mathematics 2011-05-23 Jérémy Le Borgne

The notion of geometric construction is introduced. This notion allows to compare incidence configurations in the algebraic and tropical plane. We provide an algorithm such that, given a tropical instance of a geometric construction, it…

Algebraic Geometry · Mathematics 2007-10-10 Luis Felipe Tabera

In this thesis three topics on the model theory of partial differential fields are considered: the generalized Galois theory for partial differential fields, geometric axioms for the theory of partial differentially closed fields, and the…

Logic · Mathematics 2013-09-26 Omar Leon Sanchez

A Hopf Galois structure on a finite field extension $L/K$ is a pair $(H,\mu)$, where $H$ is a finite cocommutative $K$-Hopf algebra and $\mu$ a Hopf action. In this paper we present a program written in the computational algebra system…

Group Theory · Mathematics 2020-02-21 Teresa Crespo , Marta Salguero

We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…

Combinatorics · Mathematics 2014-04-25 Johannes Carmesin , Reinhard Diestel , Matthias Hamann , Fabian Hundertmark