Abstract
An \(\alpha\)-coloring \(\xi\) of a structure \(\mathcal{S}\) is distinguishing if there are no nontrivial automorphisms of \(\mathcal{S}\) respecting \(\xi\). In this note we prove several results illustrating that computing the distinguishing number of a structure can be very hard in general. In contrast, we show that every computable Boolean algebra has a \(0^{\prime\prime}\)-computable distinguishing 2-coloring. We also define the notion of a computabile distinguishing \(2\)-coloring of a separable space; we apply the new definition to separable Banach spaces.
Similar content being viewed by others
Notes
For a finite metric space we also allow the domain to be an initial segment of \(\omega\). We allow \(d(i,j)=0\) in \(X=(\omega,d)\); a standard trick can be used to remove repetitions.
REFERENCES
M. O. Albertson and K. L. Collins, ‘‘Symmetry breaking in graphs,’’ Electron. J. Comb. 3 (1), R18 (1996).
W. Imrich, S. Klavžar, and V. Trofimov, ‘‘Distinguishing infinite graphs,’’ Electron. J. Comb. 14 (1), R36 (2007).
C. Laflamme, L. Nguyen Van Thé, and N. Sauer, ‘‘Distinguishing number of countable homogeneous relational structures,’’ Electron. J. Comb. 17 (1), R20 (2010).
S. M. Smith, T. Tucker, and M. E. Watkins, ‘‘Distinguishability of infinite groups and graphs,’’ Electron. J. Comb. 19 (2), P27 (2012).
E. Estaji, W. Imrich, R. Kalinowski, M. Pilśnyak, and T. Tucker, ‘‘Distinguishing Cartesian products of countable graphs,’’ Discuss. Math., Graph Theory 37, 155–164 (2017).
R. Miller, R. Solomon, and R. M. Steiner, ‘‘On the effectiveness of symmetry breaking,’’ in Language, Life, Limits, Lect. Notes Comput. Sci. 8493, 314–323 (2014).
Yu. L. Ershov and S. S. Goncharov, Constructive Models (Consultants Bureau, New York, 2000).
C. J. Ash and J. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Vol. 144 of Studies in Logic and the Foundations of Mathematics (North-Holland, Amsterdam, 2000).
K. Weihrauch, Computable Analysis, Texts in Theoretical Computer Science, An EATCS Series (Springer, Berlin, 2000).
S. S. Goncharov and J. F. Knight. ‘‘Computable structure and non-structure theorems,’’ Algebra Logic 41, 351–373 (2002).
A. Montalbán, ‘‘Computability theoretic classifications for classes of structures,’’ in Proceedings of the International Congress of Mathematicians, Seoul, 2014 (2014), Vol. 2, pp. 79–101.
R. G. Downey and A. G. Melnikov, ‘‘Computable analysis and classification problems,’’ in Beyond the Horizon of Computability, Lect. Notes Comput. Sci. 12098, 100–111 (2020).
R. Downey and A. Montalbán, ‘‘The isomorphism problem for torsion-free abelian groups is analytic complete,’’ J. Algebra 320, 2291–2300 (2008).
R. Downey, A. G. Melnikov, and K. M. Ng, ‘‘Iterated effective embeddings of abelian p-groups,’’ Int. J. Algebra Comput. 24, 1055–1084 (2014).
N. Bazhenov, M. Harrison-Trainor, I. Kalimullin, A. Melnikov, and K. M. Ng, ‘‘Automatic and polynomial-time algebraic structures,’’ J. Symbol. Logic 84, 1630–1669 (2019).
A. G. Melnikov and K. M. Ng, ‘‘Computable torsion abelian groups,’’ Adv. Math. 325, 864–907 (2018).
N. Bazhenov, ‘‘Autostability spectra for decidable structures,’’ Math. Struct. Comput. Sci. 28, 392–411 (2018).
S. S. Goncharov, Countable Boolean Algebras and Decidability (Consultants Bureau, New York, 1997).
A. Bonato, C. Laflamme, M. Pawliuk, and N. Sauer, ‘‘Distinguishing number of Urysohn metric spaces,’’ arXiv:1811.06023.
M. B. Pour-El and J. I. Richards, Computability in Analysis and Physics (Springer, Berlin, 1989).
A. G. Melnikov and K. M. Ng, ‘‘Computable structures and operations on the space of continuous functions,’’ Fund. Math. 233, 101–141 (2016).
P. Enflo, ‘‘A counterexample to the approximation problem in Banach spaces,’’ Acta Math. 130, 309–317 (1973).
V. Bosserhoff, ‘‘On the effective existence of Schauder bases,’’ J. UCS 15, 1145–1161 (2009).
Funding
Bazhenov was supported by RFBR, project number 20-31-70006. Greenberg was supported by Grant 17-VUW-090 from the Marsden Fund of New Zealand. Melnikov was supported by the Marsden Fund of New Zealand and the Rutherford Discovery Fellowship. Miller was partially supported by grant no. 581896 from the Simons Foundation and by the City University of New York PSC-CUNY Research Award Program. Ng was partially supported by the MOE grant RG23/19.
Author information
Authors and Affiliations
Corresponding authors
Additional information
(Submitted by I. Sh. Kalimullin)
Rights and permissions
About this article
Cite this article
Bazhenov, N., Greenberg, N., Melnikov, A. et al. A Note on Computable Distinguishing Colorings. Lobachevskii J Math 42, 693–700 (2021). https://doi.org/10.1134/S1995080221040053
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080221040053