Order-couniversality of the complete infinitary tree: an application of zero-divisor graphs (Q2153814): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the zero-divisor graph of a commutative ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commutative Boolean monoids, reduced rings, and the compressed zero-divisor graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero-divisor graph of a commutative ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of commutative rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Beck's coloring of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On universal partly ordered sets and classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal partial order represented by means of oriented trees and other simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Infinite Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero divisor graphs of Boolean posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible and bijectively related posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Annihilators in zero-divisor graphs of semilattices and reduced commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complemented zero-divisor graphs and Boolean rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poset graphs and the lattice of graph annihilators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zero-Divisor Graphs Which Are Uniquely Determined By Neighborhoods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The zero-divisor graphs of posets and an application to semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-divisor graphs of Boolean rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of posets using zero-divisor graphs / rank
 
Normal rank

Latest revision as of 14:05, 29 July 2024

scientific article
Language Label Description Also known as
English
Order-couniversality of the complete infinitary tree: an application of zero-divisor graphs
scientific article

    Statements

    Order-couniversality of the complete infinitary tree: an application of zero-divisor graphs (English)
    0 references
    0 references
    13 July 2022
    0 references
    The paper completely classifies \(\mathfrak{S}\)-couniversal posets, where \(\mathfrak{S}\) refers the class of countably infinite bounded partially ordered sets \(P\) (with minimum and maximum elements 0 and 1, respectively) such that \(x\) has infinitely many immediate predecessors and only finitely many upper bounds for every \(x \in P \backslash\{0\}\). The paper includes some natural examples of such posets. For example, consider a poset created by adding 0 to the countable downward-oriented rooted tree \(\mathcal{T}\) such that every node has infinitely many children. The ideal-lattice of the ring of integers \(\mathbb{Z}\) is another illustration. Given a class \(\mathcal{K}\) of partially ordered sets, a poset \(P \in \mathcal{K}\) is said to be \textit{\(\mathcal{K}\)-couniversal} if for every \(Q \in \mathcal{K}\) there exists a bijective poset-homomorphism \(\varphi: P \rightarrow Q ;\) that is, \(\varphi\) is bijective, and if \(x \leq_{P} y\) then \(\varphi(x) \leq_Q \varphi(y)\). Clearly, a \(\mathcal{K}\)-couniversal poset exists only if the members of \(\mathcal{K}\) have equal cardinalities, but the converse can fail. In this paper, the zero-divisor graphs of posets are used to classify \(\mathfrak{S}\)-couniversal posets. By the zero-divisor graph \(\Gamma(P)\) of a poset \(P\), we mean the graph whose vertices are the elements are nonzero zero-divisors of \(P\) such that two distinct vertices \(x\) and \(y\) are adjacent if and only if the lower cone of \(\{x,y\}\) contains only the least element 0. The following is the main result of the paper. {Theorem:} Let \(\mathcal{S}\) be the set of nonempty finite sequences of positive integers under the partial order defined by \(\sigma \leq \tau\) if and only if \(\sigma\) is an extension of \(\tau\), together with least and greatest elements \(\mathbf{0}\) and \(\mathbf{1}\), respectively. If \(P \in \mathfrak{S}\), then \(P\) is \(\mathfrak{S}\)-couniversal if and only if \(Z(P)=P \backslash\{1\}\) and \(\Gamma(\mathcal{S})\) is (isomorphic to) a spanning subgraph of \(\Gamma(P)\).
    0 references
    0 references
    partially ordered set
    0 references
    zero-divisor graph
    0 references
    embedding
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references