Concept

Équation de Pell-Fermat

Publications associées (8)

A Local Law for Singular Values from Diophantine Equations

We introduce the

N\times N

random matrices

X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables},

and

d

a fixed integer. We pr ...

2020

Adaptive algorithms for two fluids flows with anisotropic finite elements and order two time discretizations

Samuel Dubuis

This thesis is devoted to the derivation of a posteriori error estimates for the numerical approximation of fluids flows separated by a free surface. Based on these estimates, error indicators are introduced and adaptive algorithms are proposed to solve th ...

EPFL2020

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Pouyan Sepehrdad, Jorge Nakahara

This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respective ...

Springer2010

Irregular primes and Cyclotomic Invariants to Twelve Million

Mohammad Amin Shokrollahi

Computations of irregular primes and associated cyclotomic invariants were extended to all primes up to twelve million using multisectioning/convolution methods and a novel approach which originated in the study of Stickelberger codes (Shokrollahi (1996)). ...

2001

The number field sieve

Arjen Lenstra

The number field sieve is an algorithm to factor integers of the form

r^e-s

for small positive

r

and

s

. The authors present a report on work in progress on this algorithm. They informally describe the algorithm, discuss several implementation related ...

Springer Berlin Heidelberg1993

Factoring by electronic mail

Arjen Lenstra

Describes a distributed implementation of two factoring algorithms, the elliptic curve method (ECM) and the multiple polynomial quadratic sieve algorithm (MPQS). The authors' ECM-implementation on a network of DEC MicroVAX processors has factored several n ...

1990

Methods of measuring axial mixing of solids in liquid/solids fluidized beds

Albert Renken

The use of a fluorescent marker 1,1,4,4-tetraphenyl-1,3-butadiene (I) in detg. the axial mixing in fluidization is studied. I was adsorbed by SiO2 gel (sieve fraction 0.1-0.125 mm). The SiO2 gel of the fluidized bed was a sieve fraction of 0.1-0.15 mm. The ...

1987

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

A Local Law for Singular Values from Diophantine Equations

Marius Christopher Lemm

We introduce the

N\times N

random matrices

X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables},

and

d

a fixed integer. We pr ...

2020