DOI QR코드

DOI QR Code

Cofinite Graphs and Groupoids and their Profinite Completions

  • Acharyya, Amrita (Department of Mathematics and Statistics, University of Toledo, Main Campus) ;
  • Corson, Jon M. (Department of Mathematics, University of Alabama, Tuscaloosa) ;
  • Das, Bikash (Department of Mathematics, University of North Georgia, Gainesville Campus)
  • Received : 2016.02.08
  • Accepted : 2018.04.01
  • Published : 2018.06.23

Abstract

Cofinite graphs and cofinite groupoids are defined in a unified way extending the notion of cofinite group introduced by Hartley. These objects have in common an underlying structure of a directed graph endowed with a certain type of uniform structure, called a cofinite uniformity. Much of the theory of cofinite directed graphs turns out to be completely analogous to that of cofinite groups. For instance, the completion of a directed graph Γ with respect to a cofinite uniformity is a profinite directed graph and the cofinite structures on Γ determine and distinguish all the profinite directed graphs that contain Γ as a dense sub-directed graph. The completion of the underlying directed graph of a cofinite graph or cofinite groupoid is observed to often admit a natural structure of a profinite graph or profinite groupoid, respectively.

Keywords

References

  1. N. Bourbaki, General topology, Elements of Mathematics, Addison-Wesley, Reading Mass., 1966.
  2. B. Hartley, Profinite and residually finite groups, Rocky Mountain J. Math., 7(1977), 193-217. https://doi.org/10.1216/RMJ-1977-7-2-193
  3. J. Kelley, General topology, D. Van Nostrand Company, Inc., Toronto-New York-London, 1955.
  4. L. Ribes, P. Zaleski, Profinite groups, Springer-Verlag, Berlin, 2000.
  5. J.-P. Serre, Trees, Springer Verlag, Berlin, Heidelberg, New York, 1980.
  6. J. R. Stallings, Topology of finite graphs, Invent. Math., 71(1983), 551-565. https://doi.org/10.1007/BF02095993
  7. J. Wilson, Profinite groups, Oxford University Press, Oxford, 1998.