Publications associées à Isometries of quadratic spaces

Publications associées (29)

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

The multivariate Serre conjecture ring

Luc Guyot

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

Academic Press Inc Elsevier Science2023

Linear Complexity Self-Attention With 3rd Order Polynomials

Grigorios Chrysos

Self-attention mechanisms and non-local blocks have become crucial building blocks for state-of-the-art neural architectures thanks to their unparalleled ability in capturing long-range dependencies in the input. However their cost is quadratic with the nu ...

Ieee Computer Soc2023

Hierarchy of quasisymmetries and degeneracies in the CoSi family of chiral crystal materials

Philip Johannes Walter Moll, Yi-Chiang Sun, Chunyu Guo

In materials, certain approximated symmetry operations can exist in a lower-order approximation of the effective model but are good enough to influence the physical responses of the system, and these approximated symmetries were recently dubbed "quasisymme ...

AMER PHYSICAL SOC2023

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

Thomas Mountford

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

Amer Mathematical Soc2023

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022

Strictly Real Fundamental Theorem Of Algebra Using Polynomial Interlacing

Soham Basu

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 PRESS2021

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Mikhail Kapralov, Jakab Tardos

Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applicati ...

ASSOC COMPUTING MACHINERY2021

Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

Friedrich Eisenbrand, Moritz Andreas Venzin, Jana Tabea Cslovjecsek

We consider the problem of solving integer programs of the form min {c^⊺ x : Ax = b, x ∈ ℤ_{⩾ 0}}, where A is a multistage stochastic matrix in the following sense: the primal treedepth of A is bounded by a parameter d, which means that the columns of A ca ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

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

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

,

b \in \Z^m

,

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

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

Charge fluctuations from molecular simulations in the constant-potential ensemble

Sara Bonella, Alessandro Coretti

We revisit the statistical mechanics of charge fluctuations in capacitors. In constant-potential classical molecular simulations, the atomic charges of electrode atoms are treated as additional degrees of freedom which evolve in time so as to satisfy the c ...

2020

Synthetic Studies toward Amanita Phalloides Toxins

Philipp Georg Werner Seeberger

Amatoxins are ribosomally synthesized and post-translationally modified bicyclic octapeptides biosynthesized by the deadly basidiomycete fungus Amanita phalloides. Amongst this group, alpha-amanitin is the most widely known toxin and is currently under inv ...

EPFL2020

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

Coupling non-conforming discretizations of PDEs by spectral approximation of the Lagrange multiplier space

Simone Deparis, Luca Pegolotti

This work focuses on the development of a non-conforming method for the coupling of PDEs based on weakly imposed transmission conditions: the continuity of the global solution is enforced by a finite number of Lagrange multipliers defined over the interfac ...

2019

Four-Variable Expanders Over The Prime Fields

Van Thang Pham, Adrian Claudiu Valculescu, Seyed Hossein Nassajianmojarrad

Let F-p be a prime field of order p > 2, and let A be a set in F-p with very small size in terms of p. In this note, we show that the number of distinct cubic distances determined by points in A x A satisfies vertical bar(A - A)(3) + (A - A)(3 vertical bar ...

American Mathematical Society (AMS)2018

A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems

Fabio Nobile

We present a theoretical analysis of the CORSING (COmpRessed SolvING) method for the numerical approximation of partial differential equations based on compressed sensing. In particular, we show that the best s-term approximation of the weak solution of a ...

2018

Stable high-order randomized cubature formulae in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure μ defined on a domain Γ⊆ℝ^d, in any dimension d. Each cubature formula is conceived to be exact on a given finite dim ...

2022

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