English
Related papers

Related papers: Uniquely presented finitely generated commutative …

200 papers

We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…

Logic in Computer Science · Computer Science 2015-07-29 Bas Luttik

A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…

Group Theory · Mathematics 2014-10-29 Eloisa Detomi , Andrea Lucchini , Colva M. Roney-Dougal

We study the existence of uncountable first-order structures that are homogeneous with respect to their finitely generated substructures. In many classical cases this is either well-known or follows from general facts, for example, if the…

Logic · Mathematics 2025-10-21 Adam Bartoš , Wiesław Kubiś

Let $G$ be a finite solvable group. Then $G$ always has a useful presentation, which we call a "long presentation". Using a "long presentation" of $G$, we present an inductive method of constructing the irreducible representations of $G$…

Representation Theory · Mathematics 2018-10-11 Ravi S. Kulkarni , Soham Swadhin Pradhan

A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…

Commutative Algebra · Mathematics 2025-01-08 Jiya Dani , Felix Gotti , Leo Hong , Bangzheng Li , Shimon Schlessinger

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

Group Theory · Mathematics 2025-01-30 Gideon Amir , Guy Blachar , Subhajit Ghosh , Uzi Vishne

In this note we look at presentations of subgroups of finitely presented groups with infinite cyclic quotients. We prove that if $H$ is a finitely generated normal subgroup of a finitely presented group $G$ with $G/H$ cyclic, then $H$ has…

Group Theory · Mathematics 2011-12-09 Mustafa Gokhan Benli

In this paper, we classify finite categories with two objects such that one of the endomorphism monoids is a group. We prove that having a group on one side affects the structure of the other endomorphism monoid, and we prove that it is…

Category Theory · Mathematics 2022-10-04 Najwa Ghannoum , Carlos Simpson

The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.

Group Theory · Mathematics 2025-07-14 Rosa Cascella

Let $G$ be a finitely generated group. We prove that the $n$-fold tensor product $G^{\otimes n}$ is finite (resp. polycyclic) if and only $G$ is finite (resp. polycyclic). Further, assuming that $G$ is finitely presented, we show that…

Group Theory · Mathematics 2025-10-28 R. Bastos , G. Ortega

The set of all cancellable elements of the lattice of semigroup varieties has recently been shown to be countably infinite. But the description of all cancellable elements of the lattice $\mathbb{MON}$ of monoid varieties remains unknown.…

Group Theory · Mathematics 2021-10-14 Sergey V. Gusev , Edmond W. H. Lee

We show that every unitarizable fusion category, and more generally every semisimple C*-tensor category, admits a unique unitary structure. Our proof is based on a categorified polar decomposition theorem for monoidal equivalences between…

Quantum Algebra · Mathematics 2023-01-13 David Reutter

An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.

Group Theory · Mathematics 2018-01-30 Alice C. Niemeyer

The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of…

Rings and Algebras · Mathematics 2011-11-10 Inge Bethke , Piet Rodenburg

In a previous paper, we defined a higher dimensional analog of Thompson's group V, and proved that it is simple, infinite, finitely generated, and not isomorphic to any of the known Thompson groups. There are other Thompson groups that are…

Group Theory · Mathematics 2013-09-04 Matthew G. Brin

For a Grothendieck category having a noetherian generator, we prove that there are only finitely many minimal atoms. This is a noncommutative analogue of the fact that every noetherian scheme has only finitely many irreducible components.…

Representation Theory · Mathematics 2019-05-28 Ryo Kanda

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

Dynamical Systems · Mathematics 2015-09-01 Tullio Ceccherini-Silberstein , Michel Coornaert

In this article, we introduce the singular twin monoid and its corresponding group, constructed from both algebraic and topological perspectives. We then classify all complex homogeneous $2$-local representations of this constructed group.…

Representation Theory · Mathematics 2026-02-05 Mohamad N. Nasser , Nafaa Chbili

A monoid structure on families of representations of a quiver is introduced by taking extensions of representations in families, i.e. subvarieties of the varieties of representations. The study of this monoid leads to interesting…

Rings and Algebras · Mathematics 2007-05-23 Markus Reineke

A given monoid usually admits many presentations by generators and relations and the notion of Tietze equivalence characterizes when two presentations describe the same monoid: it is the case when one can transform one presentation into the…

Logic in Computer Science · Computer Science 2021-10-15 Simon Henry , Samuel Mimram