NP-hardness of Deciding Convexity of Quartic Polynomials and
NP-hardness of Deciding Convexity of Quartic Polynomials and

Ch. 7
Ch. 7

1 Introduction - ANU Repository
1 Introduction - ANU Repository

Geometric reductivity at Archimedean places
Geometric reductivity at Archimedean places

The Kazhdan-Lusztig polynomial of a matroid
The Kazhdan-Lusztig polynomial of a matroid

... braid matroid. Polo [Pol99] has shown that any polynomial with non-negative coefficients and constant term 1 appears as a Kazhdan-Lusztig polynomial associated to some symmetric group, while Kazhdan-Lusztig polynomials of matroids are far more restrictive (see Proposition 2.14). The original work of ...
Review of Roots and Zeros
Review of Roots and Zeros

On the Sum of Square Roots of Polynomials and
On the Sum of Square Roots of Polynomials and

MA314 (Part 2) 2012-2013 - School of Mathematics, Statistics
MA314 (Part 2) 2012-2013 - School of Mathematics, Statistics

Number Fields
Number Fields

1 Exponents - Faculty Directory | Berkeley-Haas
1 Exponents - Faculty Directory | Berkeley-Haas

AES S-Boxes in depth
AES S-Boxes in depth

GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD

BERNSTEIN–SATO POLYNOMIALS FOR MAXIMAL MINORS AND SUB–MAXIMAL PFAFFIANS
BERNSTEIN–SATO POLYNOMIALS FOR MAXIMAL MINORS AND SUB–MAXIMAL PFAFFIANS

2 - Kent
2 - Kent

Semidefinite programming relaxations for semialgebraic
Semidefinite programming relaxations for semialgebraic

On separating a fixed point from zero by invariants
On separating a fixed point from zero by invariants

SOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS
SOLVING QUADRATIC EQUATIONS OVER POLYNOMIAL RINGS

Arrays
Arrays

Document
Document

Polynomials
Polynomials

Exercises MAT2200 spring 2013 — Ark 8 Polynomials, Factor
Exercises MAT2200 spring 2013 — Ark 8 Polynomials, Factor

Sol 2 - D-MATH
Sol 2 - D-MATH

... semester or Section 7.7 in Artin). We show that in this ring, multiplication is the usual multiplication mod 15. However, 3 · 5 ≡ 0 mod 15. This is a particular instance of the more general fact that the ring Z/(n) is an integral domain if and only if n is prime. (b) Let I ⊂ R be an ideal. Prove tha ...
Review of definitions for midterm
Review of definitions for midterm

File
File

Algebra II Honors Test Review 6-5 to 6-6
Algebra II Honors Test Review 6-5 to 6-6

Resultant

In mathematics, the resultant of two polynomials is a polynomial expression of their coefficients, which is equal to zero if and only if the polynomials have a common root (possibly in a field extension), or, equivalently, a common factor (over their field of coefficients). In some older texts, the resultant is also called eliminant.The resultant is widely used in number theory, either directly or through the discriminant, which is essentially the resultant of a polynomial and its derivative. The resultant of two polynomials with rational or polynomial coefficients may be computed efficiently on a computer. It is a basic tool of computer algebra, and is a built-in function of most computer algebra systems. It is used, among others, for cylindrical algebraic decomposition, integration of rational functions and drawing of curves defined by a bivariate polynomial equation.The resultant of n homogeneous polynomials in n variables or multivariate resultant, sometimes called Macaulay's resultant, is a generalization of the usual resultant introduced by Macaulay. It is, with Gröbner bases, one of the main tools of effective elimination theory (elimination theory on computers).