A unified approach to the Galois closure problem

@article{Huang2015AUA,
  title={A unified approach to the Galois closure problem},
  author={Hau-wen Huang and Wen-Ching Winnie Li},
  journal={arXiv: Number Theory},
  year={2015}
}
View PDF on arXiv

References

SHOWING 1-10 OF 10 REFERENCES

The inverse Galois problem and rational points on moduli spaces

We reduce the regular version of the Inverse Galois Problem for any finite group G to finding one rational point on an infinite sequence of algebraic varieties. As a consequence, any finite group G…

The embedding problem over a Hilbertian PAC-field

We show that the absolute Galois group of a countable Hilbertian P(seudo)- A(lgebraically)C(losed) field of characteristic 0 is a free profinite group of countably infinite rank (Theorem A). As a…

Arithmetic Fundamental Groups and Noncommutative Algebra

From number theory to string theory, analyzing algebraic relations in two variables still dominates how we view laws governing relations between quantities. An algebraic relation between two…

A course in computational algebraic number theory

  • H. Cohen
  • Computer Science, Mathematics
    Graduate texts in mathematics
  • 1993
The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.

Zeta Functions of Graphs: A Stroll through the Garden

List of illustrations Preface Part I. A Quick Look at Various Zeta Functions: 1. Riemann's zeta function and other zetas from number theory 2. Ihara's zeta function 3. Selberg's zeta function 4.…

An axiomatic basis for computer programming

In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to…

Modern computer algebra

This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.

On the factorisation of polynomials in a finite number of steps

Spin separation and higher levels of a Modular Tower

Each finite p-perfect group G (p a prime) has a universal central p-extension coming from the p part of its Schur multiplier. Serre gave a Stiefel- Whitney class approach to analyzing spin covers of…

Retractions de graphes

  • PhD thesis, Université de Montréal,
  • 1972