Concept

Fonction complètement multiplicative

Publications associées (11)

From trees to barcodes and back again II: Combinatorial and probabilistic aspects of a topological inverse problem

Kathryn Hess Bellwald, Lida Kanari, Adélie Eliane Garin

In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general position, based ...

2024

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

Jana Tabea Cslovjecsek

We prove that for any triangle-free intersection graph of n axis-parallel line segments in the plane, the independence number alpha of this graph is at least alpha n/4+ohm(root n). We complement this with a construction of a graph in this class satisfying ...

Ottawa2023

Finite free convolutions of polynomials

Adam Wade Marcus

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...

SPRINGER HEIDELBERG2022

Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)

Rachid Guerraoui, Sadegh Farhadkhani, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

We study Byzantine collaborative learning, where n nodes seek to collectively learn from each others' local data. The data distribution may vary from one node to another. No node is trusted, and f < n nodes can behave arbitrarily. We prove that collaborati ...

2021

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020

Dynamical generalizations of the Prime Number Theorem and disjointness of additive and multiplicative semigroup actions

Florian Karl Richter

We establish two ergodic theorems which have among their corollaries numerous classical results from multiplicative number theory, including the Prime Number Theorem, a theorem of Pillai-Selberg, a theorem of Erd\H{o}s-Delange, the mean value theorem of Wi ...

2020

A generalization of Kátai's orthogonality criterion with applications

Florian Karl Richter

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of Kátai's orthogonality cri ...

2019

The melanization reaction in Drosophila: More than black or white

Jan Paul Dudzic

The melanization reaction is a rapid and important immune mechanism in arthropods. It results in the production of melanin at the site of injury and around invading microbes. The enzymes responsible for melanogenesis are phenoloxidases (PO), which catalyze ...

EPFL2018

Large Sieve Inequalities for Algebraic Trace Functions

Philippe Michel, Ping Xi

The large sieve inequalities for algebraic trace functions are considered in this article. A fundamental iterative relation is established by classical Fourier analysis, and l-adic Fourier analysis and multiplicative convolutions of sheaves are also requir ...

Oxford Univ Press2017

Cryptographic Hash Functions in Groups and Provable Properties

Juraj Sarinay

We consider several "provably secure" hash functions that compute simple sums in a well chosen group (G,*). Security properties of such functions provably translate in a natural way to computational problems in G that are simple to define and possibly also ...

EPFL2011

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 Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020