Computing representation matrices for the action of Frobenius to cohomology groups

04/26/2017
by   Momonari Kudo, et al.
0

This paper is concerned with the computation of representation matrices for the action of Frobenius to the cohomology groups of algebraic varieties. Specifically we shall give an algorithm to compute the matrices for arbitrary algebraic varieties with defining equations over perfect fields of positive characteristic, and estimate its complexity. Moreover, we propose a specific efficient method, which works for complete intersections.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/12/2020

Algorithms in Linear Algebraic Groups

This paper presents some algorithms in linear algebraic groups. These al...
research
12/01/2019

Algebraic Analysis of Rotation Data

We develop algebraic tools for statistical inference from samples of rot...
research
08/08/2019

On Symbolic Approaches for Computing the Matrix Permanent

Counting the number of perfect matchings in bipartite graphs, or equival...
research
09/02/2019

Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties)

The following multi-determinantal algebraic variety plays a central role...
research
06/03/2021

On the Computation of the Algebraic Closure of Finitely Generated Groups of Matrices

We investigate the complexity of computing the Zariski closure of a fini...
research
10/29/2018

Reducing the complexity for class group computations using small defining polynomials

In this paper, we describe an algorithm that efficiently collect relatio...
research
10/07/2022

Parallel Computation of functions of matrices and their action on vectors

We present a novel class of methods to compute functions of matrices or ...

Please sign up or login with your details

Forgot password? Click here to reset