The hereditariness problem for the Černý conjecture

This paper addresses the lifting problem for the Černý conjecture: namely, whether the validity of the conjecture for a quotient automaton can always be transferred (or “lifted”) to the original automaton. Although a complete solution remains open, we show that it is sufficient to verify the Černý conjecture for three specific subclasses of reset automata: radical , simple , and quasi-simple . Our approach relies on establishing a Galois connection between the lattices of congruences and ideals of the transition monoid. This connection not only serves as the main tool in our proofs but also provides a systematic method for computing the radical ideal and for deriving structural insights about these classes. In particular, we show that for every simple or quasi-simple automaton A , the transition monoid M ( A ) possesses a unique ideal covering the minimal ideal of constant (reset) maps; a result of similar flavor holds for the class of radical automata.

Authors

Institutions

Publication Details

Journal
European Journal of Combinatorics
Published
2026-04-14
DOI
https://doi.org/10.1016/j.ejc.2026.104388
Primary Topic
Advanced Differential Equations and Dynamical Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The hereditariness problem for the Černý conjecture

Emanuele Rodaro, Riccardo Venturi
European Journal of Combinatorics
Advanced Differential Equations and Dynamical Systems
article

The hereditariness problem for the Černý conjecture

Emanuele Rodaro, Riccardo Venturi
article en

Abstract

This paper addresses the lifting problem for the Černý conjecture: namely, whether the validity of the conjecture for a quotient automaton can always be transferred (or “lifted”) to the original automaton. Although a complete solution remains open, we show that it is sufficient to verify the Černý conjecture for three specific subclasses of reset automata: radical , simple , and quasi-simple . Our approach relies on establishing a Galois connection between the lattices of congruences and ideals of the transition monoid. This connection not only serves as the main tool in our proofs but also provides a systematic method for computing the radical ideal and for deriving structural insights about these classes. In particular, we show that for every simple or quasi-simple automaton A , the transition monoid M ( A ) possesses a unique ideal covering the minimal ideal of constant (reset) maps; a result of similar flavor holds for the class of radical automata.

European Journal of CombinatoricsVol. 136
Universidade Nova de Lisboa (PT), Politecnico di Milano (IT)
Openalex Percentile: Top 96%
Advanced Differential Equations and Dynamical Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.