Displaying similar documents to “Self-portraits with Évariste Galois (and the shadow of Camille Jordan)”

Évariste Galois and the social time of mathematics

Caroline Ehrhardt (2011)

Revue d'histoire des mathématiques

Similarity:

The thrust of this article is to offer a new approach to the study of Galois’s . Drawing on methodology developed by social and cultural historians, it contextualizes Galois’s work by situating it in the parisian mathematical milieu of the 1820s and 1830s. By reconstructing the social process whereby a young man became an established mathematician at the time, this article shows that Galois’s trajectory was far from unusual, and most importantly, that he was not treated differently from...

Episturmian morphisms and a Galois theorem on continued fractions

Jacques Justin (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We associate with a word on a finite alphabet an episturmian (or Arnoux-Rauzy) morphism and a palindrome. We study their relations with the similar ones for the reversal of . Then when we deduce, using the Sturmian words that are the fixed points of the two morphisms, a proof of a Galois theorem on purely periodic continued fractions whose periods are the reversal of each other.

Differential equations and algebraic transcendents: french efforts at the creation of a Galois theory of differential equations 1880–1910

Tom Archibald (2011)

Revue d'histoire des mathématiques

Similarity:

A “Galois theory” of differential equations was first proposed by Émile Picard in 1883. Picard, then a young mathematician in the course of making his name, sought an analogue to Galois’s theory of polynomial equations for linear differential equations with rational coefficients. His main results were limited by unnecessary hypotheses, as was shown in 1892 by his student Ernest Vessiot, who both improved Picard’s results and altered his approach, leading Picard to assert that his lay...

Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms

M. Huchard, H. Dicky, H. Leblanc (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure...

On the inverse problem of Galois theory.

Núria Vila (1992)

Publicacions Matemàtiques

Similarity:

The problem of the construction of number fields with Galois group over Q a given finite groups has made considerable progress in the recent years. The aim of this paper is to survey the current state of this problem, giving the most significant methods developed in connection with it.