Topic
Algebraically closed field
About: Algebraically closed field is a research topic. Over the lifetime, 6180 publications have been published within this topic receiving 80107 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: This paper presents a polynomial-time algorithm to solve the following problem: given a non-zeroPolynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q (X).
Abstract: In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q(X). It is well known that this is equivalent to factoring primitive polynomials feZ(X) into irreducible factors in Z(X). Here we call f~ Z(X) primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. (8). Its running time, measured in bit operations, is O(nl2+n9(log(fD3).
3,513 citations
01 Jan 2003
TL;DR: This chapter discusses computing roadmaps and Connected Components of Algebraic Sets, as well as the "complexity of Basic Algorithms" and "cylindrical Decomposition Algorithm".
Abstract: Algebraically Closed Fields- Real Closed Fields- Semi-Algebraic Sets- Algebra- Decomposition of Semi-Algebraic Sets- Elements of Topology- Quantitative Semi-algebraic Geometry- Complexity of Basic Algorithms- Cauchy Index and Applications- Real Roots- Cylindrical Decomposition Algorithm- Polynomial System Solving- Existential Theory of the Reals- Quantifier Elimination- Computing Roadmaps and Connected Components of Algebraic Sets- Computing Roadmaps and Connected Components of Semi-algebraic Sets
1,407 citations
Book•
01 Jan 1981
TL;DR: A linear algebraic group over an algebraically closed field k is a subgroup of a group GL n (k) of invertible n × n-matrices with entries in k, whose elements are precisely the solutions of a set of polynomial equations in the matrix coordinates as mentioned in this paper.
Abstract: A linear algebraic group over an algebraically closed field k is a subgroup of a group GL n (k) of invertible n × n-matrices with entries in k, whose elements are precisely the solutions of a set of polynomial equations in the matrix coordinates. The present article contains a review of the theory of linear algebraic groups.
1,202 citations
TL;DR: In this article, the irreducible representations of semisimple algebraic groups of characteristic p 0 were studied, in particular the rational representations, and all of the representations of corresponding finite simple groups.
Abstract: Our purpose here is to study the irreducible representations of semisimple algebraic groups of characteristic p 0, in particular the rational representations, and to determine all of the representations of corresponding finite simple groups. (Each algebraic group is assumed to be defined over a universal field which is algebraically closed and of infinite degree of transcendence over the prime field, and all of its representations are assumed to take place on vector spaces over this field.)
880 citations
Book•
01 Jan 1992TL;DR: This book discusses Polynomials GCD Computation, the construction of bases for Polynomial Ideals, and the Risch Integration Algorithm, which automates the process of solving Systems of Equation.
Abstract: Preface. 1. Introduction to Computer Algebra. 2. Algebra of Polynomials, Rational Functions, and Power Series. 3. Normal Forms and Algebraic Representations. 4. Arithmetic of Polynomial, Rational Functions, and Power Series. 5. Homomorphisms and Chinese Remainder Algorithms. 6. Newton's Iteration and the Hensel Construction. 7. Polynomials GCD Computation. 8. Polynomial Factorization. 9. Solving Systems of Equation. 10. Grobner Bases for Polynomial Ideals. 11. Integration of Rational Functions. 12. The Risch Integration Algorithm. Notation. Index.
680 citations