Mathematics > Group Theory
[Submitted on 17 Oct 2014]
Title:Coproduct Cancellation on \textbf{Act}-$S$
View PDFAbstract:The themes of cancellation, internal cancellation, substitution have led to a lot of interesting research in the theory of modules over commutative and noncommutative rings. In this paper, we introduce and study cancellation problem in the theory of acts over monoids. We show that if $A$ is an $S$-act and $A={\dot\bigcup_{i\in I}}A_i$ is the unique decomposition of $A$ into indecomposable subacts $A_i, i\in I$ such that the set $P=\{{\rm Card} [i] \mid i\in I\}$ is finite, then $A$ is cancellable if and only if the equivalence class $[i]=\{j\in I \mid A_i\cong A_j\}$ is finite, for every $i\in I$. Likewise, we prove that every $S$-act is cancellable if and only if it is internally cancellable. Thus, the concepts cancellation and internal cancellation coincide here.
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.