scientific article; zbMATH DE number 4093742
A direct product of m copies of a cyclic group of order \(p^ n\) is denoted by \(H(m,p^ n)\) and called a homocyclic p-group of rank m and exponent \(p^ n\). A subgroup of \(H(m,p^ n)\) which is isomorphic to \(H(k,p^ n)\) is called H-subgroup. Now let \(H=H(m,p^ n)\). Let \(k\leq m\). By \(G^{[k]}\) is denoted the set of all H-subgroups of rank k in G. A set \(\Sigma\) of H-subgroups in G is called an antichain if for \(A,B\in \Sigma \Rightarrow A\nleq B\), \(B\nleq A.\) Th.2. Let \(G=H(m,p^ n)\), \(m=2s+\epsilon\), \(\epsilon\in \{0,1\}\); a natural number \(t>s\); \(\Sigma \subseteq G^{[t]}\). We denote \(\Sigma^{[t-1]}=\cup_{B\in \Sigma}B^{[t-1]}\). Then \(| \Sigma^{[t-1]}| \geq | \Sigma |\). If \(| \Sigma^{[t- 1]}| =| \Sigma |\) then \(t=s+1\), \(\epsilon =1\) and \(\Sigma =G^{[s+1]}\). As a corollary we have Th.3. Let \(\Sigma\) be an H- antichain of maximal length in \(G=H(m,p^ n)\); \(m=2s+\epsilon\), \(\epsilon\in \{0,1\}\). Then \(\Sigma =G^{[s]}\) or \(G^{[s+\epsilon]}\).
- On Finite Maximal Antichains in the Homomorphism Order
- Maximal antichains of minimum size
- Maximum antichains in the product of chains
- The finite antichain property in Coxeter groups.
- Maximal antichains under dimension constraints
- On the length of subgroup chains in the symmetric group
- Maximum-sized antichains in minimal posets
- Maximal antichains in a partially ordered set
- Antichains and Finite Sets that Meet all Maximal Chains
- On the size of maximal antichains and the number of pairwise disjoint maximal chains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3820799)