Reducibility number

DOI10.1016/J.DAM.2007.05.008MaRDI QIDQ2384391zbMATH OpenOpenAlexFDO

Authors B. N. Waphare, V. S. Kharat, N. K. Thakare

Publication date 21 September 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.05.008

Boolean lattices deletable elements in posets distributive lattices lattice of subgroups of a group modular lattices reducibility in lattices reducibility number of a poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Algebraic aspects of posets (06A11) Modular lattices, Desarguesian lattices (06C05) Structure and representation theory of distributive lattices (06D05)

Review text

The reducibility number of a poset \(P\) in a class \(\mathcal{P}\) of posets is defined as the smallest positive integer \(r\) with the property that there exists a non-empty subset \(S\) of \(P\) such that \(\left| S\right| =r\) and \( P\backslash S\in \mathcal{P}.\) In this paper the reducibility numbers for the power set \(2^{n}\) of an \(n\)-set \((n\geq 2)\) with respect to the classes of distributive lattices, modular lattices and Boolean lattices are calculated. Also, it is shown that the reducibility number \(r\) of the lattice of all subgroups of a finite group \(G\) with respect to the class of all distributive lattices is \(1\) if and only if the order of \(G\) has at most two distinct prime divisors; further, if \(r\) is a prime number, then the order of \(G\) is divisible by exactly three distinct primes. The class of pseudo-complemented \(u\)-posets is shown to be reducible. Deletable elements in semidistributive posets are characterized.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Reducibility number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384391)