Search arXivSearch

arXiv · 2609.16632

The prime spectrum of the talented monoid of a higher-rank graph and applications

Abstract

In this paper, we further investigate the role of the graded Grothendieck group $K_0^{\gr}$ and its positive cone (the talented monoid) as an effective tool for distinguishing structural types of algebras associated to higher-rank $k$-graphs. We study the prime spectrum (the space of all prime $Γ$-order ideals equipped with a Zariski-like topology) of a general commutative $Γ$-monoid and establish that this space is spectral in the sense of Hochster, provided the monoid has the refinement property and every $Γ$-order ideal is finitely generated. As a result we are able to show that the prime spectrum of the talented monoid of a row-finite $k$-graph without sources and with a finite set of vertices is spectral. For any row-finite $k$-graph $Λ$ without sources, one of our main results says that the space of all graded prime ideals of the Kumjian--Pask algebra $\KP(Λ)$ is homeomorphic to both the space of all prime $\mathbb{Z}^k$-order ideals and the space of all prime $\mathbb{Z}^k$-filters of the talented monoid $T_Λ$. Another main result of this paper provides a complete topological description of regular $Γ$-order ideals of a refinement $Γ$-monoid: a $Γ$-order ideal $J$ is regular if and only if the corresponding closed (resp., open) set $V(J)$ (resp., $D(J)$) is regular closed (resp., regular open) in the prime spectrum. As an application of these results, we establish a lattice isomorphism between the lattice of all regular $\mathbb{Z}^k$-order ideals of the talented monoid and the lattice of all regular graded ideals of the Kumjian--Pask algebra via a spectrum-theoretic approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roozbeh Hazrat, Promit Mukherjee. 2026-09-15. The prime spectrum of the talented monoid of a higher-rank graph and applications. https://arxiv.org/abs/2609.16632

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA