logo site
Institut de Mathématiques de Marseille, UMR 7373
Slogan du site
Descriptif du site
Workshop CENTURI - Cell biology by the Numbers with Rob Phillips
lundi
04
novembre
2019
du lundi 4 novembre 2019
au samedi 9 novembre 2019
horaire Amphithéâtre Herbrand 130-134 (1er étage)

Institut de Mathématiques de Marseille (UMR 7373)
Site Sud - Bâtiment TPR2
Campus de Luminy, Case 907
13288 MARSEILLE Cedex 9

Workshop for biologists

The use of centralized, curated and quantitative data is becoming increasingly important in today’s biology. The course « Cell biology by the numbers » will highlight the key numbers which describe the lives of the cells and the necessary efforts to provide definitive statements about their value. This course, intended for biologists, will provide participants with the appropriate mathematical tools to apprehend and explore the key numbers of cell biology and many key physico-chemical processes. The course will provide key examples about sizes, concentrations, energies and key quantitites that describe the living world, in both an entertaining and surprising fashion. Practical sessions, dedicated to programming (Python), will be organised every afternoon.

Instructors :
- Rob PHILLIPS (Caltech)
- Griffin CHURE (Caltech)

Affiche CENTURI Workshop 2019

info : http://centuri-livingsystems.org/centuri-training-course/

Programme : http://centuri-livingsystems.org/wp-content/uploads/2018/02/CENTURI-workshop-2019-Cell-biology-by-the-numbers-program-.pdf

Organization :
- CENTURI
- Florence Hubert (I2M, AA, Aix-Marseille Université)

COLLOQUE - Nombres Premiers, Déterminisme et Pseudoaléa
lundi
04
novembre
2019
du lundi 4 novembre 2019
au vendredi 8 novembre 2019
horaire CIRM

163 avenue de Luminy
Case 916
13288 MARSEILLE - Cedex 9
France

INTERNATIONAL CONFERENCE

Prime Numbers, Determinism and Pseudorandomness in Memoriam of Christian Mauduit (1959 - 2019)

Les résultats récents de Green et Tao sur l’existence de progressions arithmétiques arbitrairement longues de nombres premiers ont montré la force de l’interaction entre la combinatoire, la théorie des nombres et les systèmes dynamiques. D’autres avancées comme les résultats de Bourgain, Green, Tao, Sarnak et Ziegler sur le principe d’aléa de la fonction de Möbius, la résolution des conjectures de Gelfond concernant la somme des chiffres des nombres premiers et celle des carrés, ainsi que ceux de Golston, Pintz et Yildirim, puis de Zhang et Maynard sur les petits écarts entre les nombres premiers et récemment de Pintz sur l’existence de progressions arithmétiques arbitrairement longues de nombres premiers jumeaux généralisés montrent la vitalité de ces domaines de recherche. La complexité inhérente au passage de la représentation d´un nombre entier dans un système de numération à sa représentation multiplicative (comme un produit de facteurs premiers) est à l’origine de plusieurs problèmes ouverts importants en mathématiques et en informatique. Le colloque sera dédié à l’étude de l’ind´eépendance entre les propriétés multiplicatives des nombres entiers et diverses fonctions ”déterministes”, c’est-à-dire produites par un système dynamique d’entropie nulle ou définies à l’aide d’un algorithme simple. Il s’agit d’une thématique actuellement en plein essor sur le plan international et le colloque permettra de développer les outils récemment mis en place pour étudier les relations entre nombres premiers, suites polynomiales et automates finis, l’étude des propriétés pseudo-aléatoires de certaines suites arithmétiques et la recherche de nombres premiers dans des suites déterministes, en lien avec plusieurs travaux récents de Bourgain, Green, Sarnak, Tao et d’autres auteurs concernant l’orthogonalité de la fonction de Möbius avec des suites déterministes et l’obtention éventuelle de théorèmes des nombres premiers pour ces suites.

The recent results of Green and Tao on the existence of arbitrarily long arithmetic progressions of prime numbers have showed the strength of the interactions between combinatorics, number theory and dynamical systems. Other advances, like the results of Bourgain, Green, Tao, Sarnak and Ziegler on the randomness principle for the Möbius function, the resolution of the Gelfond conjectures concerning the sum of digits of prime and square numbers, as well as those of Golston, Pintz and Yildirim and then Zhang and Maynard on small gaps between primes, the recent results of Pintz on the existence of arbitrarily long arithmetic progressions of generalized twin prime numbers show the vitality of this domain of research. The difficulty of the transition from the representation of an integer in a number system to its multiplicative representation (as a product of prime factors) is at the source of many important open problems in mathematics and computer science. The conference will be devoted to the study of independence between the multiplicative properties of integers and various ”deterministic” functions, i. e. functions produced by a dynamical system of zero entropy or defined using a simple algorithm. This area is developing very fast at international level and the conference will be an opportunity to help to develop techniques that were recently introduced to study of relations between prime numbers, polynomial sequences and finite automata, the study of the pseudorandom properties of certain arithmetic sequences and the search of prime numbers in deterministic sequences. This goal is related to several recent works by Bourgain, Green, Sarnak, Tao and others concerning the orthogonality of the Möbius function with deterministic sequences and obtaining prime number theorems for these sequences.

Speakers :
- Christoph Aistleitner (Graz University of Technology)
On measures of pseudorandomness for finite binary sequences
- Pierre Arnoux (I2M, Aix-Marseille Université)
Christian Mauduit : 40 ans de popularisation des mathématiques, d’enseignement et de pédagogie
- Valérie Berthé (CNRS Université Paris Diderot)
Symbolic bounded remainder sets
- Pierre-Yves Bienvenu (Université de Lyon)
Density of sets and their sumsets
- Cécile Dartyge (Université de Lorraine)
On ellipsephic integers
- Thierry De La Rue (CNRS Université de Rouen Normandie)
Sarnak conjecture in density
- Anne De Roton (Université de Lorraine)
Fourier analysis as a tool in additive combinatorics : some examples
- Michel Dekking (Delft University of Technology)
Beatty sequences and integers in golden mean base
- Jean-Marc Deshouillers (Bordeaux INP)
Randomness and non-randomness properties of Piatetski-Shapiro sequences modulo m
- Ai Hua Fan (Université de Picardie Jules Verne & CCNU Wuhan)
Growth of L^infty-norm of Generalized Thue-Morse polynomials and Dynamical maximization
- Sébastien Ferenczi (I2M CNRS Marseille)
Christian Mauduit et Gérard Rauzy, grands mathématiciens et bons folâtres
- Katalin Gyarmati (Eötvös Loránd University, Budapest)
Inequalities between correlation measures
- François Hennecart (Université Jean Monnet Saint-Etienne)
Thin sum-product bases in the integers
- ​Teturo Kamae (Osaka City University)
Randomness criterion
- Mariusz Lemanczyk (Nicolaus Copernicus University Torun)
Rigidity in dynamics and Möbius disjointness
- Bruno Martin (Université du Littoral Côte d’Opale, Calais)
On the digits of prime numbers
- Carlos Matheus (CNRS Ecole polytechnique)
Lagrange and Markov spectra and dynamics of horseshoes
- Ali Messaoudi (São Paulo State University)
Shadowing and Stability in p-adic dynamics
- Mohamed Mkaouar (Université de Sfax)
tba
- Carlos Gustavo Moreira (IMPA)
Sequences on finite alphabets : my collaboration with Christian
- Clemens Müllner (Université Claude Bernard Lyon 1)
Subsequences of automatic sequences
- Janos Pintz (Hungarian Academy of Sciences)
On the Linnik-Goldbach problem
- Martine Queffelec (Université de Lille)
Non-normal sets
- Joël Rivat (I2M, Aix-Marseille Université)
Digits of prime numbers
- András Sárközy (Eötvös Loránd University, Budapest)
Working with Christian Mauduit (in memoriam Christian Mauduit)
- Igor Shparlinski (University of New South Wales)
Pseudorandomness of Kloosterman and Salie Sums
- Thomas Stoll (Université de Lorraine, Site de Nancy)
Sur un problème d’Erdös concernant les chiffres de 2^n en base 3 et le lemme de Hensel
- Cathy Swaenepoel ​(Université de Montréal)
Prime numbers with preassigned digits
- Jun-Ichi Tamura (Tsuda College)
Some problems and results around Pentagonal Number Theorem of Euler, and Moonshine
- Gérald Tenenbaum (Université de Lorraine)
Les petites sommes de Gál
- Benjamin Weiss (Einstein Institute of Mathematics)
Christian Mauduit in ergodic theory

Organizing Committee & Scientific Committee :
Comité d’organisation & Comité scientifique :

- Cécile Dartyge (Université de Lorraine)
- Michael Drmota (TU Wien)
- Sébastien Ferenczi (I2M CNRS Marseille)
- Mariusz Lemanczyk (Nicolaus Copernicus University Torun)
- Joël Rivat (I2M, Aix-Marseille Université)

WORKSHOP - Problèmes inverses et domaines associés (7ème édition)
jeudi
07
novembre
2019
du jeudi 7 novembre 2019
au vendredi 8 novembre 2019
horaire FRUMAM

Aix-Marseille Université - Site St Charles
3, place Victor Hugo - case 39
13331 MARSEILLE Cedex 03

WORKSHOP

Inverse Problems and Related Fields ’19

Dans le cadre de notre groupe de travail GOMS.
-

Il s’agit du 7ème workshop (le premier a eu lieu en 2013) portant sur l’analyse des EDPs et plus particulièrement sur celle des problèmes inverses et sur la théorie du contrôle. Il s’adresse à tous les chercheurs intéressés ou curieux et aux jeunes chercheurs en formation (doctorants et postdoctorants).
-

-
Organisateurs :
- Michel Cristofol (I2M, Marseille)
- Éric Soccorsi (CPT, Marseille)
-
Partenaires :

- AMU (FIR)
- FRUMAM
- Centre de Physique Théorique (CPT)
- GDR DYNQUA
- LABEX Archimède
- équipe AA de l’I2M
- Institut de Mathématiques de Marseille (I2M)
- CNRS

-

SITE WEB DU WORKSHOP IP&RF19
Sergey BEREZIN - Central limit theorem for unitary ensembles : speed of convergence
vendredi
08
novembre
2019
11h00 - 12h00
horaire CMI, salle de séminaire R164 (1er étage)

I2M - Château-Gombert
39 rue Frédéric Joliot-Curie
13453 MARSEILLE cedex 13

Sergey BEREZIN (Peter the Great St.Petersburg Polytechnic University)

We are going to discuss certain analogs of the celebrated Szegő theorem which are related to the classical unitary matrix ensembles. This leads to the asymptotic formula for the characteristic function of the corresponding linear statistics. From this formula both the central limit theorem and an estimate of the speed of convergence in it
can be extracted. The analysis is based on the Riemann—Hilbert approach.
This is a joint work with Alexander Bufetov.

Juho ROUSU - Sparse non-linear canonical correlation analysis
vendredi
08
novembre
2019
14h00 - 15h00
horaire CMI, salle de séminaire R164 (1er étage)

I2M - Château-Gombert
39 rue Frédéric Joliot-Curie
13453 MARSEILLE cedex 13

Juho ROUSU (Aalto University, Helsinki)

Canonical correlation analysis (CCA) methods find multivariate relations in two-view data settings. CCA can be seen as a relative of principal component analysis, when the objective is to explain covariance between two views rather than variance within one view. When applying CCA methods, the interest is typically to find the related variables in the two views, and to uncover the relation that couples the variables. In general, it is difficult to achieve these objectives if the underlying multivariate relation is non-linear and the data is high-dimensional. CCA methods in the literature tend to be either non-linear (such as kernel CCA and deep CCA) or sparse (sparse CCA) but not both. In this presentation, I discuss recent progress in learning CCA models where the underlying relations are both non-linear and sparse. Our new gradKCCA method is based on mapping a sparse projection of the data through a non-linear kernel function. From an another angle, we can view the method as solving an ‘optimal preimage’ problem for KCCA. The model is optimized using an alternating projected gradient algorithm. Unlike KCCA, the method does not rely on a kernel matrix, and hence scales up effortless to large datasets. Experimentally, gradKCCA shows competitive predictive performance to KCCA and deep CCA models, while being orders of magnitude faster to optimize.

Reference :
Uurtio, V., Bhadra, S. and Rousu, J., 2019, Large-scale sparse kernel canonical correlation analysis, ICML’2019

Bio
Juho Rousu is a Professor of Computer Science at Aalto University, Finland. Rousu obtained his PhD in 2001 form University of Helsinki, while working at VTT Technical Centre of Finland. In 2003-2005 he was a Marie Curie Fellow at Royal Holloway University of London. In 2005-2011 he held Lecturer and Professor positions at University of Helsinki, before moving to Aalto University in 2012 where he leads a research group on Kernel Methods, Pattern Analysis and Computational Metabolomics (KEPACO). Rousu’s main research interest is in learning with multiple and structured targets, multiple views and ensembles, with methodological emphasis in regularised learning, kernels and sparsity, as well as efficient convex/non-convex optimisation methods. His applications of interest include metabolomics, biomedicine, pharmacology and synthetic biology.

Juho ROUSU