A note on computable distinguishing colorings

DOI10.1134/S1995080221040053zbMath1491.03026OpenAlexW3168789240MaRDI QIDQ2030129

Yanyan Li

Publication date: 7 June 2021

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080221040053

zbMATH Keywords

Boolean algebraindex setcomputable structuredistinguishing coloringcomputable Banach space

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishability of infinite groups and graphs
• Distinguishing Cartesian products of countable graphs
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Computable structures and the hyperarithmetical hierarchy
• Computable torsion abelian groups
• Symmetry breaking in graphs
• Computable analysis and classification problems
• Distinguishing infinite graphs
• Distinguishing number of countable homogeneous relational structures
• A counterexample to the approximation problem in Banach spaces
• Computable structures and operations on the space of continuous functions
• Iterated effective embeddings of abelian p-groups
• On the Effectiveness of Symmetry Breaking
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

This page was built for publication: A note on computable distinguishing colorings