Related papers: Galois Theory without abstract algebra

In his earlier work, the author introduced a group theory question that arises in the study of iterated Galois groups of post-critically finite quadratic polynomials. In this paper, we prove the first non-trivial results on this question.

This paper is dedicated to the differential Galois theory in the complex analytic context for Lie-Vessiot systems. Those are the natural generaliza- tion of linear systems, and the more general class of differential equations adimitting…

We present an extension of the methods of classical Lie group analysis of differential equations to equations involving generalized functions (in particular: distributions). A suitable framework for such a generalization is provided by…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

The main theorem of Galois theory states that there are no finite group-subgroup pairs with the same invariants. On the other hand, if we consider complex linear reductive groups instead of finite groups, the analogous statement is no…

We develop a Galois theory for difference ring extensions, inspired by Magid's separable Galois theory for ring extensions and by Janelidze's categorical Galois theory. Our difference Galois theorem states that the category of difference…

We propose in this paper a Galois theory of $q$-difference equations where q is a root of unity. This theory is the q difference analogue of the Galois theory of iterative differential equations, that is differential equations over fields…

The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…

For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

There are several variants of the inverse Galois problem which involve restrictions on ramification. In this paper we give sufficient conditions that a given finite group $G$ occurs infinitely often as a Galois group over the rationals…

In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois…

The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal…

We develop Hopf-Galois theory for weak Hopf algebras, and recover analogs of classical results for Hopf algebras. Our methods are based on the recently introduced Galois theory for corings. We focus on the situatation where the weak Hopf…

The author surveys Galois theory of function fields with non-zero caracteristic and its relation to the structure of finite permutation groups and matrix groups.

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…

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…

According to the Abel-Ruffini theorem [1] and Galois theory [2], there is no solution in finite radicals to the general quintic equation. This article takes a different approach and proposes a new method to solve the quintic by iteration of…

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…

The paper presents an algebraic technique for derivation of fast discrete cosine transform (DCT) algorithms. The technique is based on the algebraic signal processing theory (ASP). In ASP a DCT associates with a polynomial algebra…