Zachary Mesyan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zachary Mesyan has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- James D. Mitchell
School of Mathematics and Statistics, University of St Andrews
5 shared publications - Gene Abrams
Department of Mathematics, University of Colorado, Colorado Springs, USA
3 shared publications - Greg Oman
Department of Mathematics, University of Colorado, Colorado Springs, CO 80918, USA
3 shared publications - Roozbeh Hazrat
Centre for Research in Mathematics and Data Science Western Sydney University Sydney Australia
3 shared publications - Alan Loper
Department of Mathematics, The Ohio State University, Newark, United States
2 shared publications - Kulumani. M. Rangaswamy
Department of Mathematics University of Colorado Colorado Springs 80918 Colorado USA
2 shared publications
Latest Publications
- Open Access
Graded Lawson-Stone Duality
The classical Stone duality associates to each Boolean algebra a topological space consisting of ultrafilters. Lawson's generalisation constructs a dual equivalence of categories of Boolean inverse $\land$-semigroups and Hausdorff ample topological groupoids. We further generalise the duality to the graded analogues of those categories, and provide various illustrations.
Open AccessGraded Lawson-Stone Duality
The classical Stone duality associates to each Boolean algebra a topological space consisting of ultrafilters. Lawson's generalisation constructs a dual equivalence of categories of Boolean inverse $\land$-semigroups and Hausdorff ample topological groupoids. We further generalise the duality to the graded analogues of those categories, and provide various illustrations.
- Open Access
- 5 August 2025
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 229 (10)
Maximal commutative subalgebras of Steinberg algebras
- 5 August 2025
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 229 (10)
Open AccessMaximal commutative subalgebras of Steinberg algebras
- Open Access
Maximal Commutative Subalgebras of Steinberg Algebras
We construct large classes of maximal commutative subalgebras in prime Steinberg algebras, generalizing a known result for Leavitt path algebras.
Open AccessMaximal Commutative Subalgebras of Steinberg Algebras
We construct large classes of maximal commutative subalgebras in prime Steinberg algebras, generalizing a known result for Leavitt path algebras.
- 21 May 2025
- Published by Springer Nature in Semigroup Forum
- p. 1-36
Conjugacy and Least Commutative Congruences in Semigroups
- 21 May 2025
- Published by Springer Nature in Semigroup Forum
- p. 1-36
Conjugacy and Least Commutative Congruences in Semigroups
- Open Access
Conjugacy and Least Commutative Congruences in Semigroups
Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and studied in many fields of algebra. This paper is devoted to a natural generalization, defined by $s \sim_s^1 t$ whenever $s=p_1\cdots p_{n}$ and $t=p_{f(1)}\cdots p_{f(n)}$, for some $p_1, \dots, p_n \in S \cup \{1\}$ and permutation $f$ of $\{1, \dots, n\}$, together with its transitive closure $\sim_s$. The relation $\sim_s$ is the congruence generated by either $\sim_p^1$ or $\sim_p$, and is moreover the least commutative congruence on any semigroup. We explore general properties of $\sim_s$, discuss it in the context of groups and rings, compare it to other semigroup conjugacy relations, and fully describe its equivalence classes in free, Rees matrix, graph inverse, and various transformation semigroups.Open AccessConjugacy and Least Commutative Congruences in Semigroups
Given a semigroup $S$ and $s,t \in S$, write $s \sim_p^1 t$ if $s=pr$ and $t=rp$, for some $p,r \in S \cup \{1\}$. This relation, known as "primary conjugacy", along with its transitive closure $\sim_p$, has been extensively used and studied in many fields of algebra. This paper is devoted to a natural generalization, defined by $s \sim_s^1 t$ whenever $s=p_1\cdots p_{n}$ and $t=p_{f(1)}\cdots p_{f(n)}$, for some $p_1, \dots, p_n \in S \cup \{1\}$ and permutation $f$ of $\{1, \dots, n\}$, together with its transitive closure $\sim_s$. The relation $\sim_s$ is the congruence generated by either $\sim_p^1$ or $\sim_p$, and is moreover the least commutative congruence on any semigroup. We explore general properties of $\sim_s$, discuss it in the context of groups and rings, compare it to other semigroup conjugacy relations, and fully describe its equivalence classes in free, Rees matrix, graph inverse, and various transformation semigroups. - Open Access
Unifying some classical results on Artinian rings and modules
In this note, we introduce a very crude but natural notion of measure on the class of left R-modules over a ring R. We use this notion to give short proofs of some classical theorems on (left) Artinian rings and modules, due to Akizuki, Anderson, Hopkins, and Levitzki, as well as of some new results.
Open AccessUnifying some classical results on Artinian rings and modules
In this note, we introduce a very crude but natural notion of measure on the class of left R-modules over a ring R. We use this notion to give short proofs of some classical theorems on (left) Artinian rings and modules, due to Akizuki, Anderson, Hopkins, and Levitzki, as well as of some new results.
- 20 April 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 34 (03) , 371-396
Properties of congruence lattices of graph inverse semigroups
From any directed graph E one can construct the graph inverse semigroup [ ], whose elements, roughly speaking, correspond to paths in E. Wang and Luo showed that the congruence lattice [ ] of [ ] is upper-semimodular for every graph E, but can fail to be lower-semimodular for some E. We provide a simple characterization of the graphs E for which [ ] is lower-semimodular. We also describe those E such that [ ] is atomistic, and characterize the minimal generating sets for [ ] when E is finite and simple.
- 20 April 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 34 (03) , 371-396
Properties of congruence lattices of graph inverse semigroups
From any directed graph E one can construct the graph inverse semigroup [ ], whose elements, roughly speaking, correspond to paths in E. Wang and Luo showed that the congruence lattice [ ] of [ ] is upper-semimodular for every graph E, but can fail to be lower-semimodular for some E. We provide a simple characterization of the graphs E for which [ ] is lower-semimodular. We also describe those E such that [ ] is atomistic, and characterize the minimal generating sets for [ ] when E is finite and simple.
- Open Access
Automatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones
In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff or Polish semigroup topologies; and we formulate a notion of the Zariski topology for monoids. If $M$ is a topological monoid such that every homomorphism from $M$ to a second countable topological monoid $N$ is continuous, then we say that $M$ has \emph{automatic continuity}. We show that many well-known monoids have automatic continuity with respect to a natural semigroup topology, namely: the full transformation monoid $\mathbb{N}^\mathbb{N}$; the full binary relation monoid $B_{\mathbb{N}}$; the partial transformation monoid $P_{\mathbb{N}}$; the symmetric inverse monoid $I_{\mathbb{N}}$; the monoid Inj$(\mathbb{N})$ consisting of the injective functions on $\mathbb{N}$; and the monoid $C(2^{\mathbb{N}})$ of continuous functions on the Cantor set. We show that the pointwise topology on $\mathbb{N}^\mathbb{N}$, and its analogue on $P_{\mathbb{N}}$, are the unique Polish semigroup topologies on these monoids. The compact-open topology is the unique Polish semigroup topology on $C(2^\mathbb{N})$ and $C([0, 1]^\mathbb{N})$. There are at least 3 Polish semigroup topologies on $I_{\mathbb{N}}$, but a unique Polish inverse semigroup topology. There are no Polish semigroup topologies $B_{\mathbb{N}}$ nor on the partitions monoids. At the other extreme, Inj$(\mathbb{N})$ and the monoid Surj$(\mathbb{N})$ of all surjective functions on $\mathbb{N}$ each have infinitely many distinct Polish semigroup topologies. We prove that the Zariski topologies on $\mathbb{N}^\mathbb{N}$, $P_{\mathbb{N}}$, and Inj$(\mathbb{N})$ coincide with the pointwise topology; and we characterise the Zariski topology on $B_{\mathbb{N}}$. In Section 7: clones.Open AccessAutomatic continuity, unique Polish topologies, and Zariski topologies on monoids and clones
In this paper we explore the extent to which the algebraic structure of a monoid $M$ determines the topologies on $M$ that are compatible with its multiplication. Specifically we study the notions of automatic continuity; minimal Hausdorff or Polish semigroup topologies; and we formulate a notion of the Zariski topology for monoids. If $M$ is a topological monoid such that every homomorphism from $M$ to a second countable topological monoid $N$ is continuous, then we say that $M$ has \emph{automatic continuity}. We show that many well-known monoids have automatic continuity with respect to a natural semigroup topology, namely: the full transformation monoid $\mathbb{N}^\mathbb{N}$; the full binary relation monoid $B_{\mathbb{N}}$; the partial transformation monoid $P_{\mathbb{N}}$; the symmetric inverse monoid $I_{\mathbb{N}}$; the monoid Inj$(\mathbb{N})$ consisting of the injective functions on $\mathbb{N}$; and the monoid $C(2^{\mathbb{N}})$ of continuous functions on the Cantor set. We show that the pointwise topology on $\mathbb{N}^\mathbb{N}$, and its analogue on $P_{\mathbb{N}}$, are the unique Polish semigroup topologies on these monoids. The compact-open topology is the unique Polish semigroup topology on $C(2^\mathbb{N})$ and $C([0, 1]^\mathbb{N})$. There are at least 3 Polish semigroup topologies on $I_{\mathbb{N}}$, but a unique Polish inverse semigroup topology. There are no Polish semigroup topologies $B_{\mathbb{N}}$ nor on the partitions monoids. At the other extreme, Inj$(\mathbb{N})$ and the monoid Surj$(\mathbb{N})$ of all surjective functions on $\mathbb{N}$ each have infinitely many distinct Polish semigroup topologies. We prove that the Zariski topologies on $\mathbb{N}^\mathbb{N}$, $P_{\mathbb{N}}$, and Inj$(\mathbb{N})$ coincide with the pointwise topology; and we characterise the Zariski topology on $B_{\mathbb{N}}$. In Section 7: clones. - Open Access
Graded Semigroups
We systematically develop a theory of graded semigroups, that is semigroups S partitioned by groups G, in a manner compatible with the multiplication on S. We define a smash product S#G, and show that when S has local units, the category S#G-Mod of sets admitting an S#G-action is isomorphic to the category S-Gr of graded sets admitting an appropriate S-action. We also show that when S is an inverse semigroup, it is strongly graded if and only if S-Gr is naturally equivalent to S_1-Mod, where S_1 is the partition of S corresponding to the identity element 1 of G. These results are analogous to well-known theorems of Cohen/Montgomery and Dade for graded rings. Moreover, we show that graded Morita equivalence implies Morita equivalence for semigroups with local units, evincing the wealth of information encoded by the grading of a semigroup. We also give a graded Vagner-Preston theorem, provide numerous examples of naturally-occurring graded semigroups, and explore connections between graded semigroups, graded rings, and graded groupoids. In particular, we introduce graded Rees matrix semigroups, and relate them to smash product semigroups. We pay special attention to graded graph inverse semigroups, and characterise those that produce strongly graded Leavitt path algebras.
Open AccessGraded Semigroups
We systematically develop a theory of graded semigroups, that is semigroups S partitioned by groups G, in a manner compatible with the multiplication on S. We define a smash product S#G, and show that when S has local units, the category S#G-Mod of sets admitting an S#G-action is isomorphic to the category S-Gr of graded sets admitting an appropriate S-action. We also show that when S is an inverse semigroup, it is strongly graded if and only if S-Gr is naturally equivalent to S_1-Mod, where S_1 is the partition of S corresponding to the identity element 1 of G. These results are analogous to well-known theorems of Cohen/Montgomery and Dade for graded rings. Moreover, we show that graded Morita equivalence implies Morita equivalence for semigroups with local units, evincing the wealth of information encoded by the grading of a semigroup. We also give a graded Vagner-Preston theorem, provide numerous examples of naturally-occurring graded semigroups, and explore connections between graded semigroups, graded rings, and graded groupoids. In particular, we introduce graded Rees matrix semigroups, and relate them to smash product semigroups. We pay special attention to graded graph inverse semigroups, and characterise those that produce strongly graded Leavitt path algebras.
- 5 October 2022
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 253 (1) , 1-71
Graded semigroups
- 5 October 2022
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 253 (1) , 1-71
Graded semigroups