Publication

K3 surfaces, cyclotomic polynomials and orthogonal groups

Publications associées (26)

Markov cubature rules for polynomial processes

Damir Filipovic, Martin Larsson, Sergio Andres Pulido Nino

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rul ...

ELSEVIER2020

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

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

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Arithmetic and geometric structures in cryptography

Benjamin Pierre Charles Wesolowski

We explore a few algebraic and geometric structures, through certain questions posed by modern cryptography. We focus on the cases of discrete logarithms in finite fields of small characteristic, the structure of isogeny graphs of ordinary abelian varietie ...

EPFL2018

Sampling at unknown locations, with an application in surface retrieval

Martin Vetterli, Benjamin Bejar Haro, Adam James Scholefield, Michalina Wanda Pacholska

We consider the problem of sampling at unknown locations. We prove that, in this setting, if we take arbitrarily many samples of a polynomial or real bandlimited signal, it is possible to find another function in the same class, arbitrarily far away from t ...

2017

Distinct distances on regular varieties over finite fields

Van Thang Pham

In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset in a regular variety satisfies vertical bar epsilon vertical bar >> q(d-1/2 + 1/k-1), then Delta(k,F)(epsilon) ...

Elsevier2017

A semi-algebraic version of Zarankiewicz's problem

János Pach

A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...

European Mathematical Soc2017

Short Stickelberger Class Relations and Application to Ideal-SVP

Benjamin Pierre Charles Wesolowski

The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...

Springer International Publishing Ag2017

On irreducible subgroups of simple algebraic groups

Donna Testerman, Claude Marion

Let G be a simple algebraic group over an algebraically closed field K of characteristic p >= 0, let H be a proper closed subgroup of G and let V be a nontrivial irreducible KG-module, which is p-restricted, tensor indecomposable and rational. Assume that ...

Springer Heidelberg2017