Concept

Polynôme caractéristique

Publications associées (57)

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 Ag2024

Gerstenhaber structure on Hochschild cohomology of the Fomin–Kirillov algebra on 3 generators

The goal of this article is to compute the Gerstenhaber bracket of the Hochschild cohomology of the Fomin–Kirillov algebra on three generators over a field of characteristic different from 2 and 3. This is in part based on a general method we introduce to ...

2022

Unramified F-divided objects and the etale fundamental pro-groupoid in positive characteristic

Giulio Orecchia

Let X /S be a flat algebraic stack of finite presentation. We define a new & eacute;tale fundamental pro-groupoid pi(1)(X /S), generalizing Grothendieck's enlarged & eacute;tale fundamental group from SGA 3 to the relative situation. When S is of equal pos ...

GEOMETRY & TOPOLOGY PUBLICATIONS2022

Generic vanishing in characteristic p > 0 and the geometry of theta divisors

Zsolt Patakfalvi

In this paper, we prove a strengthening of the generic vanishing result in characteristic p > 0 given in Hacon and Patakfalvi (Am J Math 138(4):963-998, 2016). As a consequence of this result, we show that irreducible Theta divisors are strongly F-regular ...

SPRINGER INTERNATIONAL PUBLISHING AG2021

Automorphisms of even unimodular lattices and equivariant Witt groups

Eva Bayer Fluckiger

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 SOC2020

Kinetic Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Puoya Tabaghi

Euclidean distance matrices (EDMs) are a major tool for localization from distances, with applications ranging from protein structure determination to global positioning and manifold learning. They are, however, static objects which serve to localize point ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Electromagnetic Time Reversal Similarity Characteristics and its Application to Locating Faults in Power Networks

Mario Paolone, Farhad Rachidi-Haeri, Zhaoyang Wang, Reza Razzaghi

The existing Electromagnetic Time Reversal (EMTR)-based fault location methods generally leverage the features of the signals simulated in the EMTR reversed-time stage (relative to the direct-time stage wherein a fault occurs and its originated transient s ...

2020

A Novel Method for River Bank Detection from Landsat Satellite Data: A Case Study in the Vietnamese Mekong Delta

Giovanni De Cesare, Sameh Ahmad Kantoush

River bank (RB) erosion is a global issue aecting livelihoods and properties of millions of people. However, it has not received enough attention in the Vietnamese Mekong Delta (VMD), i.e., the world’s third largest delta, compared to salinity intrusion an ...

2020

Minimal Polynomials Of Unipotent Elements Of Non-Prime Order In Irreducible Representations Of The Exceptional Algebraic Groups In Some Good Characteristics

Donna Testerman

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 ...

2019

MATHICSE Technical Report: Block Krylov subspace methods for functions of matrices II: Modified block FOM

Kathryn Dianne Lund

We analyze an expansion of the generalized block Krylov subspace framework of [Electron.\ Trans.\ Numer.\ Anal., 47 (2017), pp. 100-126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and con ...

MATHICSE2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search