Concept

Nombre composé

Publications associées (13)

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 spectral refinement of the Bergelson–Host–Kra decomposition and new multiple ergodic theorems

Florian Karl Richter

We investigate how spectral properties of a measure-preserving system (X, B, mu, T) are reflected in the multiple ergodic averages arising from that system. For certain sequences a :N -> N, we provide natural conditions on the spectrum sigma (T) such that, ...

2019

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over (Z/qZ)(x) which consid ...

SPRINGER HEIDELBERG2018

We prove an asymptotic formula for squarefree numbers in arithmetic progressions, improving previous results by Prachar and Hooley. As a consequence we improve a lower bound of Heath-Brown for the least squarefree number in an arithmetic progression. ...

London Math Soc2017

Method and system for combining video sequences with spatio-temporal alignment

Martin Vetterli, Serge Ayer

Given two video sequences, a composite video sequence can be generated which includes visual elements from each of the given sequences, suitably synchronized and represented in a chosen focal plane. For example, given two video sequences with each showing ...

2010

Method and system for combining video sequences with spatio-temporal alignment

Martin Vetterli, Serge Ayer

2010

Dc bus utilisation in multiphase VSI supplied drives with a composite stator phase number

Drazen Dujic

Multiphase variable-speed drives are typically supplied from a two-level voltage source inverter (VSI). The number of phases of the machine and hence the legs of the inverter can be either a prime or a composite number. Limits of the dc bus utilisation in ...

IEEE2010

Primality Testing

Kamal Tahiri Jouti

Since the discovery of the utility of the numbers, the human being tried to differentiate them. We decide between them according to whether they are even or odd. Or, according to the fact that they are prime or composite. A natural number n >1 is called a ...

2006

, ,

Given two video sequences (IS1, IS2), a composite video sequence can be generated which includes visual elements from each of the given sequences, suitably synchronized and represented in a chosen focal plane (figure 1). For example, given two video sequen ...

2006

Given two video sequences (IS1, IS2), a composite video sequence (15) can be generated which includes visual elements (A, B, 21) from each of the given sequences, suitably synchronized and represented in a chosen focal plane. For example, given two video s ...

2005

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019