Home

Concept

Cyclotomic polynomial

Formal sciences
Mathematics
Algebra
Polynomials

About
Privacy
Disclaimer

Graph Chatbot

Related publications (21)

Page 1 of 2

K3 surfaces, cyclotomic polynomials and orthogonal groups

Eva Bayer Fluckiger

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

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

Lattice packings through division algebras

Nihar Prakash Gargava

In this text, we will show the existence of lattice packings in a family of dimensions by employing division algebras. This construction is a generalization of Venkatesh's lattice packing result Venkatesh (Int Math Res Notices 2013(7): 1628-1642, 2013). In ...

SPRINGER HEIDELBERG2023

From Kernel Methods to Neural Networks: A Unifying Variational Formulation

Michaël Unser

The minimization of a data-fidelity term and an additive regularization functional gives rise to a powerful framework for supervised learning. In this paper, we present a unifying regularization functional that depends on an operator L\documentclass[12pt]{ ...

Springer2023

Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography

Juan Ramón Troncoso-Pastoriza

The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learning with Errors (RLWE), introducing efficiency improvements with respect to the RLWE counterpart thanks to its multivariate structure. Nevertheless, the rec ...

2021

Development of a new method to determine the axial void velocity profile in BWRs from measurements of the in-core neutron noise

Mathieu Hursin

Determination of the local void fraction in BWRs from in-core neutron noise measurements requires the knowledge of the axial velocity of the void. The purpose of this paper is to revisit the problem of determining the axial void velocity profile from the t ...

PERGAMON-ELSEVIER SCIENCE LTD2021

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Lars Rohwedder

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

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

Multiquadratic Rings and Walsh-Hadamard Transforms for Oblivious Linear Function Evaluation

Juan Ramón Troncoso-Pastoriza

The Ring Learning with Errors (RLWE) problem has become one of the most widely used cryptographic assumptions for the construction of modern cryptographic primitives. Most of these solutions make use of power-of-two cyclotomic rings mainly due to its simpl ...

IEEE2020

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

Isogeometric Analysis of the electrophysiology in the human heart: Numerical simulation of the bidomain equations on the atria

Alfio Quarteroni, Luca Dede', Luca Pegolotti

We consider Isogeometric Analysis (IGA) for the numerical solution of the electrophysiology of the atria, which in this work is modeled by means of the bidomain equations on thin surfaces. First, we consider the bidomain equations coupled with the Roger-Mc ...

ELSEVIER SCIENCE SA2019

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

Discontinuous Galerkin scheme for the spherical shallow water equations with applications to tsunami modeling and prediction

Jan Sickmann Hesthaven, Boris Bonev

We present a novel high-order discontinuous Galerkin discretization for the spherical shallow water equations, able to handle wetting/drying and non-conforming, curved meshes in a well-balanced manner. This requires a well-balanced discretization, that can ...

2018

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 the discrete logarithm problem in finite fields of fixed characteristic

Thorsten Kleinjung, Robert Granger, Jens Markus Zumbrägel

For~

q

a prime power, the discrete logarithm problem (DLP) in~

\F_{q}

consists in finding, for any

g \in \mathbb{F}_{q}^{\times}

and

h \in \langle g \rangle

, an integer~

x

such that

g^x = h

. We present an algorithm for computing discrete logarithm ...

2018

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Robert Granger

For any positive integers

n\geq 3, r\geq 1

we present formulae for the number of irreducible polynomials of degree

n

over the finite field

\mathbb{F}_{2^r}

where the coefficients of

x^{n-1}

x^{n-2}

and

x^{n-3}

are zero. Our proofs involve coun ...

Elsevier2016

On The Exponent Of Distribution Of The Ternary Divisor Function

Philippe Michel

We show that the exponent of distribution of the ternary divisor function d(3) in arithmetic progressions to prime moduli is at least 1/2 + 1/46, improving results of Friedlander-Iwaniec and Heath-Brown. Furthermore, when averaging over a fixed residue cla ...

London Mathematical Society, Cambridge2015

Multiple signal classification technique for phase estimation from a fringe pattern

Pramod Rastogi, Rajshekhar Gannavarpu

The paper introduces a multiple signal classification technique based method for fringe analysis. In the proposed method, the phase of a fringe pattern is locally approximated as a polynomial. The polynomial phase signal is then transformed to obtain signa ...

Optical Society of America2012

Minimum euclidien des ordres maximaux dans les algèbres centrales à division

Jérôme Chaubert

This work concerns the study of Euclidean minima of maximal orders in central simple algebras. In the first part, we define the concept of ideal lattice in the non-commutative case. Let A be a semi-simple algebra over Q. An ideal lattice over A is a triple ...

EPFL2007

Upper bounds for Euclidean minima of algebraic number fields

Eva Bayer Fluckiger

The aim of this paper is to give new upper bounds for Euclidean minima of algebraic number fields. In particular, to show that Minkowski's conjecture holds for the maximal totally real subfields of cyclotomic fields of prime power conductor. ...

2006