Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2001.04549

Solution sets of systems of equations over finite lattices and semilattices

Endre Tóth·Tamás Waldhauser
View original source ↗Read source document ↗Export metadata ↓

Abstract

Solution sets of systems of homogeneous linear equations over fields are characterized as being subspaces, i.e., sets that are closed under linear combinations. Our goal is to characterize solution sets of systems of equations over arbitrary finite algebras by a similar closure condition. We show that solution sets are always closed under the centralizer of the clone of term operations of the given algebra; moreover, the centralizer is the only clone that could characterize solution sets. If every centralizer-closed set is the set of all solutions of a system of equations over a finite algebra, then we say that the algebra has Property (SDC). Our main result is the description of finite lattices and semilattices with Property (SDC): we prove that a finite lattice has Property (SDC) if and only if it is a Boolean lattice, and a finite semilattice has Property (SDC) if and only if it is distributive.

Explore related subjects

math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Endre Tóth, Tamás Waldhauser. 2020-07-09. Solution sets of systems of equations over finite lattices and semilattices. https://doi.org/10.1007/s00012-020-0639-8

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

KEEP EXPLORING

Related papers

arXiv2026

Maximal tails,character fibres and induced modules for pullback Kumjian-Pask algebras

Let $f:\N^{k}\to\N^{\ell}$ be a surjective monoid homomorphism and let $Γ$ be a row-finite $\ell$-graph with no sources and finitely many vertices. We give an explicit graded isomorphism from the Kumjian--Pask algebra of the pullback $f^{*}Γ$ onto the tensor product of $\KP_{\K}(Γ)$ and the group algebra of the kernel of the group completion of $f$. When $Γ$ is strongly aperiodic, but need not be cofinal, every maximal tail $T$ and every maximal ideal $\mathfrak m$ of the kernel group algebra determine an explicit primitive ideal and primitive quotient. If, in addition, $\K$ is uncountable and algebraically closed, these ideals exhaust the primitive spectrum. We prove that the resulting parametrisation is a homeomorphism for the product of the maximal-tail and Zariski topologies. Each primitive ideal is realised as the annihilator of a simple module induced from the isotropy of a path which is cofinal in $T$, and the character fibres are algebraic tori. Two examples exhibit, respectively, a single character fibre and the non-Hausdorff gluing of two such fibres.

math.RA↗
arXiv2026

A classification of group gradings on incidence algebras over commutative rings

Let $R$ be a commutative ring with 1, $P$ a locally finite partially ordered set, and $G$ a group. We derive necessary and sufficient conditions for an $R$-algebra isomorphism between the incidence algebra $I(P,R)$ and the group algebra $RG$. Then, for an indecomposable ring $R$, a finite poset $P$ and an arbitrary group $G$, we classify the $G$-gradings of $I(P,R)$ up to graded isomorphism. The classification rests on a complete set of primitive orthogonal homogeneous idempotents. The corner algebras are split group algebras of finite abelian subgroups of $G$, and the off-diagonal Peirce blocks are multiplicity-free sums of bimodules induced from characters of double coset stabilizers. Graded isomorphisms are shown to have a rigid form, and a grading is determined up to graded isomorphism by the poset of idempotents, the corner groups, the types of the atomic bimodules and the structure constants of their multiplication. The data which occur are characterized by polynomial conditions, and over an algebraically closed field of characteristic zero only finitely many graded isomorphism classes share given partial invariants. An example shows that the structure constants cannot be omitted. Some previous results are extended and enhanced, while providing alternative proofs for some known facts.

math.RA↗