Concept

Décomposition des idéaux premiers dans les extensions galoisiennes

Publications associées (36)

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

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

Providence2023

Serre-Tate theory for Calabi-Yau varieties

Maciej Emilian Zdanowicz

Classical Serre-Tate theory describes deformations of ordinary abelian varieties. It implies that every such variety has a canonical lift to characteristic zero and equips the base of its universal deformation with a Frobenius lifting and canonical multipl ...

WALTER DE GRUYTER GMBH2021

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Arjen Lenstra, Robert Granger, Thorsten Kleinjung, Benjamin Pierre Charles Wesolowski

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

AMER MATHEMATICAL SOC2021

Remarks on Poincare and interpolation estimates for Truncated Hierarchical B-splines

Annalisa Buffa

This paper should be considered as an addendum to [A. Buffa and C. Giannelli, Adaptive isogeometric methods with hierarchical splines: Error estimator and convergence, Math. Models Methods Appl. Sci. 26 (2016) 1-25] and [A. Buffa and C. Giannelli, Adaptive ...

2021

A new elementary proof of the Prime Number Theorem

Florian Karl Richter

Let

\Omega(n)

denote the number of prime factors of

n

. We show that for any bounded

f\colon\mathbb{N}\to\mathbb{C}

one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a ...

2021

Minimal graphs for 2-factor extension

Dominique de Werra

Let G = (V, E) be a simple loopless finite undirected graph. We say that G is (2-factor) expandable if for any non-edge uv, G + uv has a 2-factor F that contains uv. We are interested in the following: Given a positive integer n = vertical bar V vertical b ...

ELSEVIER2020

Does the Homogeneous City Belong to the Past?

Valentin Daniel Maurice Bourdon

As the case of Paris embodies, a whole culture of the European city has built its identity and organized the collective life of its inhabitants on the idea of homogeneity. The homogeneous city has thus significantly contributed to the collective self-repre ...

2019

Generalized Norm-compatible Systems on Unitary Shimura Varieties

Mohamed Réda Boumasmoud

We define and study in terms of integral IwahoriâHecke algebras a new class of geometric operators acting on the Bruhat-Tits building of connected reductive groups over p-adic fields. These operators, which we call U-operators, generalize the geometric n ...

EPFL2019

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...

2019

Four-Variable Expanders Over The Prime Fields

Adrian Claudiu Valculescu, Van Thang Pham

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

AMER MATHEMATICAL SOC2018

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 new elementary proof of the Prime Number Theorem

Florian Karl Richter

Let

\Omega(n)

denote the number of prime factors of

n

. We show that for any bounded

f\colon\mathbb{N}\to\mathbb{C}

one has [ \frac{1}{N}\sum_{n=1}^N, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1). ] This yields a ...

2021