2000 character limit reached
Maximal $d$-spectra via Priestley duality
Published 13 Jan 2025 in math.GN | (2501.07673v1)
Abstract: We use Priestley duality as a new tool to study maximal $d$-spectra of arithmetic frames, both with and without units. We pay special attention to when the maximal $d$-spectrum is compact or Hausdorff. Various necessary and sufficient conditions are given, including a construction of an arithmetic frame with a unit whose maximal $d$-spectrum is not Hausdorff, thus resolving an open problem in the literature.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.