Centering Koebe polyhedra via Möbius transformations

Autor: Zsolt Lángi

Publikováno v: Groups, Geometry, and Dynamics. 15:197-221

A variant of the Circle Packing Theorem states that the combinatorial class of any convex polyhedron contains elements, called Koebe polyhedra, midscribed to the unit sphere centered at the origin, and that these representatives are unique up to Mobi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c3169b38bd35ea95b5bf42dbb2d1f75b
https://doi.org/10.4171/ggd/596

An Improved Genetic Algorithm Based Solution to Vehicle Routing Problem over OpenMP with Load Consideration

Autor: Siddharth Jaidka, Vidyanshu Jain, Monika Jain, Tushar Sadana, Aashis Kumar, Rahul Saxena

Publikováno v: Advances in Communication, Devices and Networking ISBN: 9789811334498

Vehicle Routing Problem being a combinatorial class of problems has implications in various areas and applications where traditional methods to find a search space either fail or slow down especially in case of real time systems. Using the most popul

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::75ee02d1e323b3682f805749a96fb7aa
https://doi.org/10.1007/978-981-13-3450-4_32

Descent distribution on Catalan words avoiding a pattern of length at most three

Autor: Vincent Vajnovszki, Jean-Luc Baril, Sergey Kirgizov

Publikováno v: Discrete Mathematics
Discrete Mathematics, Elsevier, 2018, 341 (9), pp.2608-2615. ⟨10.1016/j.disc.2018.06.001⟩

Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoidi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ce3a1fee6da301ef2f5f6ed35db1ff6
http://arxiv.org/abs/1803.06706

More Restricted Growth Functions: Gray Codes and Exhaustive Generation

Autor: Ahmad Sabri, Vincent Vajnovszki

Publikováno v: Graphs and Combinatorics
Graphs and Combinatorics, Springer Verlag, 2017, 33 (3), pp.573-582. ⟨10.1007/s00373-017-1774-7⟩
Graphs and Combinatorics, Springer Verlag, 2017, 33 (3), pp.573-582. 〈https://link.springer.com/article/10.1007%2Fs00373-017-1774-7〉. 〈10.1007/s00373-017-1774-7〉

International audience; A Gray code for a combinatorial class is a method for listing the objects in the class so that successive objects differ in some prespecified, small way, typically expressed as a bounded Hamming distance. In a previous work, t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::907586fcb5e75171a6da837199a90b6c
https://hal-univ-bourgogne.archives-ouvertes.fr/hal-01552981

A new combinatorial class of 3-manifold triangulations

Autor: Stephan Tillmann, Feng Luo

Publikováno v: Asian Journal of Mathematics

We define a new combinatorial class of triangulations of closed 3-manifolds, satisfying a weak version of 0-efficiency combined with a weak version of minimality, and study them using twisted squares. As an application, we obtain strong restrictions

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccbf3361c1e3c7db0a1f72e94f5bc4b8
https://hdl.handle.net/21.11116/0000-000C-C2A5-E21.11116/0000-000C-C2A3-0