Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
96 tokens/sec
Gemini 2.5 Pro Premium
48 tokens/sec
GPT-5 Medium
15 tokens/sec
GPT-5 High Premium
23 tokens/sec
GPT-4o
104 tokens/sec
DeepSeek R1 via Azure Premium
77 tokens/sec
GPT OSS 120B via Groq Premium
466 tokens/sec
Kimi K2 via Groq Premium
201 tokens/sec
2000 character limit reached

The covering numbers of rings (2112.01667v2)

Published 3 Dec 2021 in math.RA and math.CO

Abstract: A cover of an associative (not necessarily commutative nor unital) ring $R$ is a collection of proper subrings of $R$ whose set-theoretic union equals $R$. If such a cover exists, then the covering number $\sigma(R)$ of $R$ is the cardinality of a minimal cover, and a ring $R$ is called $\sigma$-elementary if $\sigma(R) < \sigma(R/I)$ for every nonzero two-sided ideal $I$ of $R$. If $R$ is a ring with unity, then we define the unital covering number $\sigma_u(R)$ to be the size of a minimal cover of $R$ by subrings that contain $1_R$ (if such a cover exists), and $R$ is $\sigma_u$-elementary if $\sigma_u(R) < \sigma_u(R/I)$ for every nonzero two-sided ideal of $R$. In this paper, we classify all $\sigma$-elementary unital rings and determine their covering numbers. Building on this classification, we are further able to classify all $\sigma_u$-elementary rings and prove $\sigma_u(R) = \sigma(R)$ for every $\sigma_u$-elementary ring $R$. We also prove that, if $R$ is a ring without unity with a finite cover, then there exists a unital ring $R'$ such that $\sigma(R) = \sigma_u(R')$, which in turn provides a complete list of all integers that are the covering number of a ring. Moreover, if [\mathscr{E}(N) := {m : m \le N, \sigma(R) = m \text{ for some ring } R},] then we show that $|\mathscr{E}(N)| = \Theta(N/\log(N))$, which proves that almost all integers are not covering numbers of a ring.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.