Concept
Minimal polynomial (field theory)
Related publications (33)
K3 surfaces, cyclotomic polynomials and orthogonal groups
Let X be a complex projective K3 surface and let T-X be its transcendental lattice; the characteristic polynomials of isometries of T-X induced by automorphisms of X are powers of cyclotomic polynomials. Which powers of cyclotomic polynomials occur? The ai ...
Springer Int Publ Ag2024The multivariate Serre conjecture ring
It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension
San Diego2023A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM
Thomas Mountford, Michael Cranston
In this paper we use the Riemann zeta distribution to give a new proof of the Erdos-Kac Central Limit Theorem. That is, if zeta(s) = Sigma(n >= 1) (1)(s)(n) , s > 1, then we consider the random variable X-s with P(X-s = n) = (1) (zeta) ( ...
Providence2023Almost cyclic regular semisimple elements in irreducible representations of simple algebraic groups
Let G be a simple linear algebraic group defined over an algebraically closed field of characteristic p ≥ 0 and let φ be a nontrivial p-restricted irreducible representation of G. Let T be a maximal torus of G and s ∈ T . We say that s is Ad-regular if α(s ...
2023Strictly Real Fundamental Theorem Of Algebra Using Polynomial Interlacing
Without resorting to complex numbers or any advanced topological arguments, we show that any real polynomial of degree greater than two always has a real quadratic polynomial factor, which is equivalent to the fundamental theorem of algebra. The proof uses ...
CAMBRIDGE UNIV PRESS2021Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography
The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learning with Errors (RLWE), introducing efficiency improvements with respect to the RLWE counterpart thanks to its multivariate structure. Nevertheless, the rec ...
2021Minimal Polynomials Of Unipotent Elements Of Non-Prime Order In Irreducible Representations Of The Exceptional Algebraic Groups In Some Good Characteristics
In a number of cases the minimal polynomials of the images of unipotent elements of non-prime order in irreducible representations of the exceptional algebraic groups in good characteristics are found. It is proved that if p > 5 for a group of type E-8 and ...
2019Almost tiling of the Boolean lattice with copies of a poset
Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...
ELECTRONIC JOURNAL OF COMBINATORICS2018The strength and dislocation microstructure evolution in superalloy microcrystals
In this work, the evolution of the dislocations microstructure in single crystal two-phase superalloy microcrystals under monotonic loading has been studied using the three-dimensional discrete dislocation dynamics (DDD) method. The DDD framework has been ...
Elsevier2017