1.4k citations
- Centre National de la Recherche ScientifiqueFR819 papers
- Laboratoire Analyse, Géométrie et ApplicationsFR419 papers
- Laboratoire d'Informatique de Paris-NordFR291 papers
- Sorbonne Paris CitéFR283 papers
- Laboratoire de physique des lasersFR235 papers
- Sorbonne UniversitéFR182 papers
- Université Paris CitéFR178 papers
- Laboratoire des Sciences des Procédés et des MatériauxFR111 papers
- Université Paris-SaclayFR59 papers
- Université Paris-SudFR50 papers
- Université Pierre-et-Marie-CurieFR43 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR37 papers
57 papers · 1 filter
Growing Binary Trees
Olivier Bodini, Antoine Genitrini, Khaydar Nurligareev
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction…
The set of minimal distances of the monoid of plus-minus weighted zero-sum sequences and applications to the characterization problem
Kamil Merito, Oscar Ordaz, Wolfgang Schmid
Recently a systematic investigation of monoids of sequences of plus-minus weighted zero-sum sequences had been started, which is among others motivated by applications to monoids o…
Totally equimodular matrices: decomposition and triangulation
Patrick Chervet, Roland Grappe, Mathieu Vallée
Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between…
Small kissing polytopes
Antoine Deza, Zhongyuan Liu, Lionel Pournin
A lattice -polytope is the convex hull of a set of points in whose coordinates are integers ranging between and . We consider the smallest possible dis…
Optimizing alphabet reduction pairs of arrays
Jean-François Culus, Sophie Toulouse
In our earlier paper, "2 CSPs all are approximable within a constant differential factor" (ISCO 2018, LNCS 10856), we introduced a family of combinatorial designs called 'alphabet…
Progressive and Rushed Dyck Paths
Axel Bacher
We call progressive paths and rushed paths two families of Dyck paths studied by Asinowski and Jelinek, which have the same enumerating sequence (OEIS entry A287709). We present a…