=Paper=
{{Paper
|id=Vol-2925/preface
|storemode=property
|title=None
|pdfUrl=https://ceur-ws.org/Vol-2925/preface.pdf
|volume=Vol-2925
}}
==None==
https://ceur-ws.org/Vol-2925/preface.pdf
Proceedings
G
L O
A S
2020
First International Conference
“Algebras, graphs and ordered sets”
ALGOS 2020
August 26–28, 2020
Nancy, France
Editors
Miguel Couceiro (Loria)
Pierre Monnin (Loria)
Amedeo Napoli (Loria)
https://algos2020.loria.fr/
2
Preface
Originating in arithmetics and logic, the theory of ordered sets is now a field of combina-
torics that is intimately linked to graph theory, universal algebra and multiple-valued logic,
and that has a wide range of classical applications such as formal calculus, classification,
decision aid and social choice.
This international conference “Algebras, graphs and ordered set” (ALGOS) brought to-
gether specialists in the theory of graphs, relational structures and ordered sets, topics that
are omnipresent in artificial intelligence and in knowledge discovery, and with concrete ap-
plications in biomedical sciences, security, social networks and e-learning systems. One of
the goals of this event was to provide a common ground for mathematicians and computer
scientists to meet, to present their latest results, and to discuss original applications in related
scientific fields. These fruitful exchanges have motivated ongoing multidisciplinary projects.
The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) had a particular
motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this
reason, we particularly welcomed submissions in areas related to Maurice’s many scientific
interests:
• Lattices and ordered sets
• Combinatorics and graph theory
• Set theory and theory of relations
• Universal algebra and multiple valued logic
• Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid
and social choice, security, social networks, web semantics...
The many submissions were subject to a strict reviewing process that resulted in the
selection of 27 contributions. In addition to the contributions appearing in this volume (in
the form of short and long papers), ALGOS 2020 also included
Extended abstracts:
Some remarks on Skula spaces
Robert Bonnet
Permanent and determinant of Toeplitz-Hessenberg matrices with generalized Fi-
bonacci and Lucas entries
Ihab Eddine Djellas, Hacène Belbachir, and Amine Belkhir
Integer sequences and ellipse chains inside a hyperbola
Soumeya M. Tebtoub, Hacène Belbachir, and László Németh
Bis nomial coefficients and s–Lah numbers
Imène Touaibia, Hacène Belbachir, and Miloud Mihoubi
On generalization of bi-periodic r-numbers
N. Rosa Ait-Amrane
From ternary abstract cosets to groups and from medians to semilattices via base-
points: comments on analogies
Stephan Foldes and Gerasimos Meletiou
Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attri-
bution 4.0 International (CC BY 4.0).
3
On the enumeration of p-oligomorphic groups
Justine Falque
Log-concavity and unimodality in arithmetical triangles
Assia F. Tebtoub
Special sessions (dedicated and open problems):
Reconstruction of digraphs up to complementation
Aymen Ben Amira, Jamel Dammak, and Hamza Si Kaddour
Big Ramsey degrees of the universal homogeneous partial order are finite
Jan Hubička
Well quasi ordering and embeddability of relational structures
Maurice Pouzet
On relational structures with polynomial profile
Nicolas M. Thiéry
Recursive construction of the minimal prime digraphs
Mohammad Alzohairi, Moncef Bouaziz, and Youssef Boudabbous
Plenary talks:
The colorful world of rainbow sets
Ron Aharoni
F3 -reconstruction
Youssef Boudabbous and Christian Delhommé
Extremal problems for boolean lattices and their quotients
Dwight Duffus
On logics that make a bridge from the discrete to the continuous
Mirna Džamonja
Graph searches and maximal cliques structure for cocomparability graphs
Michel Habib
Ordering infinities
Joris van der Hoeven
Maurice’s siblings
Claude Laflamme
Applications of order trees in infinite graphs
Max Pitz
Synchronous programming of real-time systems or turning mathematics into trustable
code
Marc Pouzet
Partitioning subgroups of the symmetric group S(U )
Norbert Sauer
Twin-width
Stéphan Thomassé
EPPA & Ramsey
Jaroslav Nešetřil
4
ALGOS 2020 was originally planned to take place on August 26 (Wednesday), 27 (Thurs-
day), 28 (Friday) of 2020, at the Lorraine Research Laboratory in Computer Science and
its Applications (LORIA, UMR 7503). However, due to the covid-19 pandemic, we were
forced to move it fully online... We are truly thankful to IRISA (“Institut de Recherche en
Informatique et Systèmes Aléatoires”) for providing the access to an instance of platform Big
Blue Button for hosting our online event.
On behalf of the organising committee we also wish to express our deepest gratitude to
all members of the scientific committee and to all colleagues and friends of Maurice Pouzet,
that contributed to the reviewing process, to the scientific content to honour Maurice, and
that agreed to participate in this non physical form.
Miguel Couceiro
Pierre Monnin
Amedeo Napoli
5
Organising Committee
Nathalie Bussy (Loria, FR)
Miguel Couceiro (General chair, Loria, FR)
Lucien Haddad (RMC, CA)
Jean-Yves Marion (Loria, FR)
Pierre Monnin (Loria, FR)
Amedeo Napoli (Loria, FR)
Lauréline Nevin (Loria, FR)
Justine Reynaud (Loria, FR)
Michael Rusinowich (Loria, FR)
Hamza Si Kaddour (U. Lyon, FR)
Scientific Committee
Kira Adaricheva (Hofstra U., USA)
Ron Aharoni (Technion, Haifa, IL)
Jorge Almeida (U. Porto, PT)
Karell Bertet (U. Rochelle, FR)
Guillaume Bonfante (U. Lorraine, Loria, FR)
Robert Bonnet (U. Savoie, FR)
Moncef Bouaziz (King Saud U., SA)
Imed Boudabbous (U. Sfax, TN)
Youssef Boudabbous (King Saud U., SA)
Pierre Charbit (U. Paris 7, IRIF, FR)
Christian Delhommé (U. Réunion, FR)
Jimmy Devillet (U. Luxembourg, LU)
Dwight Duffus (Emory U., USA)
Mirna Dzamonja (U. East Anglia, UK)
Stephan Foldes (U. Miskolc, HU)
Michel Grabisch (U. Paris I, FR)
6
Jens Gustedt (Inria, FR)
Frederic Havet (I3S, CNRS/UNSA-INRIA)
Mustapha Kabil (U. Hassan II de Casablanca, MA)
Benoit Larose (Lacim UQAM, CA)
Erkko Lehtonen (U. Nova Lisboa, PT)
Jean-Luc Marichal (U. Luxembourg, LU)
Gerasimos Meletiou (U. Ioannina, GR)
Djamila Oudrar (U.S.T.H.B., DZ)
Maurice Pouzet (U. Lyon & U. Calgary, FR & CA)
Fatiha Saïs (U. Paris Sud, FR)
Luigi Santocanale (U. Aix-Marseille, FR)
Jean-Sébastien Sereni (CNRS, FR)
Nicolas Thiery (U. Paris Sud, FR)
Nicolas Trotignon (ENS Lyon, FR)
Tamás Waldhauser (U. Szeged, HU)
Fred Wehrung (CNRS, FR)
Robert Woodrow (U. Calgary, CA)
Imed Zaguia (RMC, CA)
Nejib Zaguia (U. Ottawa, CA)
7
8
Table of Contents
Preface 3
Short papers 11
Decomposition schemes for symmetric n-ary bands
Jimmy Devillet and Pierre Mathonet . . . . . . . . . . . . . . . . . . . . . . . 13
Linearly definable classes of Boolean functions
Miguel Couceiro and Erkko Lehtonen . . . . . . . . . . . . . . . . . . . . . . . 21
Combinatorial interpretation of bis nomial coefficients and generalized Catalan num-
bers
Hacène Belbachir and Oussama Igueroufa . . . . . . . . . . . . . . . . . . . . 29
Graphs containing finite induced paths of unbounded length
Maurice Pouzet and Imed Zaguia . . . . . . . . . . . . . . . . . . . . . . . . . 37
Monotonic computation rules for nonassociative calculus
Miguel Couceiro and Michel Grabisch . . . . . . . . . . . . . . . . . . . . . . 41
Structures with no finite monomorphic decomposition: application to the profile of
hereditary classes
Djamila Oudrar and Maurice Pouzet . . . . . . . . . . . . . . . . . . . . . . . 49
A note on the Boolean dimension of a graph and other related parameters
Maurice Pouzet, Hamza Si Kaddour, and Bhalchandra D. Thatte . . . . . . . 55
Long papers 61
Bijective proofs for Eulerian numbers in types B and D
Luigi Santocanale . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
Polymorphism-homogeneity and universal algebraic geometry
Endre Tóth and Tamás Waldhauser . . . . . . . . . . . . . . . . . . . . . . . . 77
Termination of graph rewriting systems through language theory
Guillaume Bonfante and Miguel Couceiro . . . . . . . . . . . . . . . . . . . . 87
Inversion number of an oriented graph and related parameters
Jørgen Bang-Jensen, Jonas Costa Ferreira da Silva, and Frédéric Havet . . . . 101
Tackling scalability issues in mining path patterns from knowledge graphs: a pre-
liminary study
Pierre Monnin, Emmanuel Bresso, Miguel Couceiro, Malika Smaïl-Tabbone,
Amedeo Napoli, and Adrien Coulet . . . . . . . . . . . . . . . . . . . . . . . . 123
9