1.2k citations
- Université Sorbonne Paris NordFR291 papers
- Centre National de la Recherche ScientifiqueFR216 papers
- Sorbonne Paris CitéFR64 papers
- Sorbonne UniversitéFR40 papers
- Université Paris CitéFR34 papers
- Laboratoire de Physique Théorique de la Matière CondenséeFR32 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR20 papers
- Institut national de recherche en sciences et technologies du numériqueFR19 papers
- The Open UniversityGB19 papers
- Institute of Nuclear Physics, Polish Academy of SciencesPL18 papers
- Université Pierre-et-Marie-CurieFR18 papers
- Horia Hulubei National Institute for R and D in Physics and Nuclear EngineeringRO17 papers
26 papers · 1 filter
Another proof of the expansion of the rank three tensor model with tetrahedral interaction
Valentin Bonzom
The rank three tensor model with tetrahedral interaction was shown by Carrozza and Tanasa to admit a expansion, dominated by melonic diagrams, and double tadpoles decorated w…
A linear optimization oracle for zonotope computation
Antoine Deza, Lionel Pournin
A class of counting problems ask for the number of regions of a central hyperplane arrangement. By duality, this is the same as counting the vertices of a zonotope. We give several…
Periodic Pólya Urns, the Density Method, and Asymptotics of Young Tableaux
Cyril Banderier, Philippe Marchal, Michael Wallner
Pólya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule d…
Enumeration of Permutation Classes and Weighted Labelled Independent Sets
Christian Bean, Émile Nadeau, Henning Ulfarsson
In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cells filled with permutations. We consider many cases, where rest…
On the Elementary Affine Lambda-Calculus with and Without Fixed Points
Lê Thành Dũng Nguyen
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexpon…
A localized version of the basic triangle theorem
Gérard Duchamp, Nihar Gargava, Hoang Ngoc Minh +1
In this short note, we give a localized version of the basic triangle theorem, first published in 2011 (see [4]) in order to prove the independence of hyperlogarithms over various…