242 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Laboratoire d'Informatique Gaspard-MongeFR130 papers
- Centre National de la Recherche ScientifiqueFR127 papers
- Laboratoire d’Analyse et de Mathématiques AppliquéesFR77 papers
- Pôle de recherche et d'enseignement supérieur Université Paris-EstFR39 papers
- Université Paris-Est CréteilFR26 papers
- École nationale des ponts et chausséesFR20 papers
- Paris-Est SupFR20 papers
- Institut national de recherche en sciences et technologies du numériqueFR18 papers
- Université Gustave EiffelFR16 papers
- Université Paris DiderotFR15 papers
- CERMICSFR10 papers
- Institut de Mathématiques de ToulouseFR10 papers
19 papers · 1 filter
Boundary and Eisenstein Cohomology of
Jitendra Bajpai, Günter Harder, Ivan Horozov +1
In this article, several cohomology spaces associated to the arithmetic groups and with coefficients in any highest weight r…
On the group of a rational maximal bifix code
Jorge Almeida, Alfredo Costa, Revekka Kyriakoglou +1
We give necessary and sufficient conditions for the group of a rational maximal bifix code to be isomorphic with the -group of , when is recurrent and …
Random polytopes obtained by matrices with heavy tailed entries
Olivier Guédon, A. E. Litvak, K. Tatarko
Let be an random matrix with independent entries and such that in each row entries are i.i.d. Assume also that the entries are symmetric, have unit variances, and s…
What is known about Vertex Cover Kernelization?
Michael R. Fellows, Lars Jaffke, Aliz Izabella Király +2
We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovič on the occasion of his 60th birthday. The Vertex Cover problem is…
Interpolating between Optimal Transport and MMD using Sinkhorn Divergences
Jean Feydy, Thibault Séjourné, François-Xavier Vialard +3
Comparing probability distributions is a fundamental problem in data sciences. Simple norms and divergences such as the total variation and the relative entropy only compare densit…
Scattering Networks for Hybrid Representation Learning
Edouard Oyallon, Sergey Zagoruyko, Gabriel Huang +4
Scattering networks are a class of designed Convolutional Neural Networks (CNNs) with fixed weights. We argue they can serve as generic representations for modelling images. In par…
Extremal exponents of random products of conservative diffeomorphisms
Pablo G. Barrientos, Dominique Malicet
We show that for a -open and -dense subset of the set of ergodic iterated function systems of conservative diffeomorphisms of a finite-volume manifold of dimension $d\g…
Finding Short Synchronizing Words for Prefix Codes
Andrew Ryzhikov, Marek Szykuła
We study the problems of finding a shortest synchronizing word and its length for a given prefix code. This is done in two different settings: when the code is defined by an arbitr…
Synchronizing Random Almost-Group Automata
Mikhail V. Berlinkov, Cyril Nicaud
In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permu…
On the coarse geometry of James spaces
Gilles Lancien, Colin Petitjean, Antonín Procházka
In this note we prove that the Kalton interlaced graphs do not equi-coarsely embed into the James space nor into its dual . It is a particular case of a…
Multiple sets exponential concentration and higher order eigenvalues
Nathaël Gozlan, Ronan Herry
On a generic metric measured space, we introduce a notion of improved concentration of measure that takes into account the parallel enlargement of k distinct sets. We show that the…
Bisecting measures with hyperplane arrangements
Alfredo Hubard, Roman Karasev
We show that when is a power of two, any measures in can be bisected by an arrangement of hyperplanes.
Induced Saturation of Graphs
Maria Axenovich, Mónika Csikós
A graph is -saturated for a graph , if does not contain a copy of but adding any new edge to results in such a copy. An -saturated graph on a given number…
The DOZZ Formula from the Path Integral
Antti Kupiainen, Rémi Rhodes, Vincent Vargas
We present a rigorous proof of the Dorn, Otto, Zamolodchikov, Zamolodchikov formula (the DOZZ formula) for the 3 point structure constants of Liouville Conformal Field Theory (LCFT…
Adaptive sampling of large deviations
Grégoire Ferré, Hugo Touchette
We introduce and test an algorithm that adaptively estimates large deviation functions characterizing the fluctuations of additive functionals of Markov processes in the long-time…
Extensions of partial cyclic orders and consecutive coordinate polytopes
Arvind Ayyer, Matthieu Josuat-Vergès, Sanjay Ramassamy
We introduce several classes of polytopes contained in and cut out by inequalities involving sums of consecutive coordinates. We show that the normalized volumes of these…
Slowdown of the surface diffusion during early stages of bacterial colonization
Thomas Vourc'h, Julien Léopoldès, Annick Méjean +3
We study the surface diffusion of the model cyanobacterium Synechocystis sp. PCC during the incipient stages of cell contact with a glass surface in the dilute regime. We ob…
Unbounded Largest Eigenvalue of Large Sample Covariance Matrices: Asymptotics, Fluctuations and Applications
Florence Merlevède, Jamal Najim, Peng Tian
Given a large sample covariance matrix where is a matrix with i.i.d. centered entries, and is a de…
A partial order on Motzkin paths
Wenjie Fang
The Tamari lattice, defined on Catalan objects such as binary trees and Dyck paths, is a well-studied poset in combinatorics. It is thus natural to try to extend it to other famili…