Saved in:
| Main Authors: | Amis, Karine, Boutillon, Eloi, Boutillon, Emmanuel |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.05097 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025)
by: Sawada, Joe, et al.
Published: (2025)
The tripartite-circle crossing number of graphs with two small partition classes
by: Camacho, Charles, et al.
Published: (2021)
by: Camacho, Charles, et al.
Published: (2021)
Local generation of languages: the monotonic binary sequences
by: Hoyrup, Mathieu
Published: (2026)
by: Hoyrup, Mathieu
Published: (2026)
The formula for the completion time of project networks
by: Castejón-Limas, Manuel, et al.
Published: (2024)
by: Castejón-Limas, Manuel, et al.
Published: (2024)
Extending 1089 attractor to any number of digits and any number of steps
by: Almirantis, Yannis, et al.
Published: (2024)
by: Almirantis, Yannis, et al.
Published: (2024)
Isomorphisms of unit distance graphs of layers
by: Bikeev, Arthur Igorevich
Published: (2025)
by: Bikeev, Arthur Igorevich
Published: (2025)
Minimum length word-representants of graph products
by: Srinivasan, Eshwar, et al.
Published: (2024)
by: Srinivasan, Eshwar, et al.
Published: (2024)
Morse sequences on stacks and flooding sequences
by: Bertrand, Gilles
Published: (2025)
by: Bertrand, Gilles
Published: (2025)
ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)
by: Bonte, Sébastien, et al.
Published: (2025)
An orderly algorithm for generation of Condorcet Domains
by: Zhou, Bei, et al.
Published: (2025)
by: Zhou, Bei, et al.
Published: (2025)
Single machine rescheduling for new orders: properties and complexity results
by: Rener, Elena, et al.
Published: (2023)
by: Rener, Elena, et al.
Published: (2023)
Satisfying sequences for rainbow partite matchings
by: Kupavskii, Andrey, et al.
Published: (2025)
by: Kupavskii, Andrey, et al.
Published: (2025)
Basis sequence reconfiguration in the union of matroids
by: Hanaka, Tesshu, et al.
Published: (2024)
by: Hanaka, Tesshu, et al.
Published: (2024)
Size-varying reversible causal graph dynamics
by: Arrighi, Pablo, et al.
Published: (2018)
by: Arrighi, Pablo, et al.
Published: (2018)
ELECTRE TRI-nB, pseudo-disjunctive: axiomatic and combinatorial results
by: Bouyssou, Denis, et al.
Published: (2024)
by: Bouyssou, Denis, et al.
Published: (2024)
A note on embracing exchange sequences in oriented matroids
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Non-detectable patterns hidden within sequences of bits
by: Allen, David, et al.
Published: (2024)
by: Allen, David, et al.
Published: (2024)
More results on the $z$-chromatic number of graphs
by: Khaleghi, Abbas, et al.
Published: (2023)
by: Khaleghi, Abbas, et al.
Published: (2023)
A new proof of Delahan's induced-universality result
by: Chappelon, Jonathan
Published: (2026)
by: Chappelon, Jonathan
Published: (2026)
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)
by: Kelly, Tom, et al.
Published: (2018)
Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)
by: Sawada, J., et al.
Published: (2023)
Computing gradient vector fields with Morse sequences
by: Bertrand, Gilles, et al.
Published: (2025)
by: Bertrand, Gilles, et al.
Published: (2025)
Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)
by: Hörsch, Florian, et al.
Published: (2024)
Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
by: Pierre, Laurent
Published: (2016)
by: Pierre, Laurent
Published: (2016)
On completely factoring any integer efficiently in a single run of an order finding algorithm
by: Ekerå, Martin
Published: (2020)
by: Ekerå, Martin
Published: (2020)
Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)
by: Gregor, Petr, et al.
Published: (2023)
Automorphism groups of Cayley graphs generated by general transposition sets
by: Gijswijt, Dion, et al.
Published: (2024)
by: Gijswijt, Dion, et al.
Published: (2024)
Erd\H os--Ko--Rado type results for partitions via spread approximations
by: Kupavskii, Andrey
Published: (2023)
by: Kupavskii, Andrey
Published: (2023)
Generalizing Roberts' characterization of unit interval graphs
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
by: Martínez, Virginia Ardévol, et al.
Published: (2024)
Local obstructions in sequences revisited
by: Rosenfeld, Matthieu, et al.
Published: (2025)
by: Rosenfeld, Matthieu, et al.
Published: (2025)
Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
by: Tian, Ting, et al.
Published: (2025)
by: Tian, Ting, et al.
Published: (2025)
The discrete charm of iterated function systems. A computer scientist's perspective on approximation of IFS invariant sets and measures
by: Martyn, Tomasz
Published: (2024)
by: Martyn, Tomasz
Published: (2024)
Automatic question generation for propositional logical equivalences
by: Yang, Yicheng, et al.
Published: (2024)
by: Yang, Yicheng, et al.
Published: (2024)
Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)
by: Rukavicka, Josef
Published: (2024)
Coarse Menger property of quasi-minor excluded graphs and length spaces
by: Liu, Chun-Hung
Published: (2026)
by: Liu, Chun-Hung
Published: (2026)
An effective construction for cut-and-project rhombus tilings with global n-fold rotational symmetry
by: Lutfalla, Victor H.
Published: (2020)
by: Lutfalla, Victor H.
Published: (2020)
Unbounded length minimal synchronizing words for quantum channels over qutrits
by: Kjos-Hanssen, Bjørn, et al.
Published: (2026)
by: Kjos-Hanssen, Bjørn, et al.
Published: (2026)
Heuristics for the Run-length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem
by: Major, Lily, et al.
Published: (2024)
by: Major, Lily, et al.
Published: (2024)
Graph parameters that are coarsely equivalent to path-length
by: Dragan, Feodor F., et al.
Published: (2025)
by: Dragan, Feodor F., et al.
Published: (2025)
Vertex-minor universal graphs for generating entangled quantum subsystems
by: Cautrès, Maxime, et al.
Published: (2024)
by: Cautrès, Maxime, et al.
Published: (2024)
Similar Items
-
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
by: Sawada, Joe, et al.
Published: (2025) -
The tripartite-circle crossing number of graphs with two small partition classes
by: Camacho, Charles, et al.
Published: (2021) -
Local generation of languages: the monotonic binary sequences
by: Hoyrup, Mathieu
Published: (2026) -
The formula for the completion time of project networks
by: Castejón-Limas, Manuel, et al.
Published: (2024) -
Extending 1089 attractor to any number of digits and any number of steps
by: Almirantis, Yannis, et al.
Published: (2024)