Concept
Polynôme minimal d'un endomorphisme
Publications associées (32)
An optimal preconditioned FFT-accelerated finite element solver for homogenization
Till Junge, Ali Falsafi, Martin Ladecký
We generalize and provide a linear algebra-based perspective on a finite element (FE) ho-mogenization scheme, pioneered by Schneider et al. (2017)[1] and Leuschner and Fritzen (2018)[2]. The efficiency of the scheme is based on a preconditioned, well-scale ...
ELSEVIER SCIENCE INC2023The 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 Diego2023Automorphisms of even unimodular lattices and equivariant Witt groups
We characterize the irreducible polynomials that occur as the characteristic polynomial of an automorphism of an even unimodular lattice of a given signature, generalizing a theorem of Gross and McMullen. As part of the proof, we give a general criterion i ...
EUROPEAN MATHEMATICAL SOC2020Minimal 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 ...
2019On compact representations of Voronoi cells of lattices
Matthias Schymura, Christoph Hunkenschröder
In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...
SPRINGER INTERNATIONAL PUBLISHING AG2018