On the maximal cross number of unique factorization indexed multisets

preprint2013arXivOpen access

Abstract

In this paper, we study a conjecture of Gao and Wang concerning a proposed formula K1∗(G)K_1^*(G) for the maximal cross number K1(G)K_1(G) taken over all unique factorization indexed multisets over a given finite abelian group GG. As a corollary of our first main result, we verify the conjecture for abelian groups of the form Cpm⊕Cp,Cpm⊕Cq,Cpm⊕Cq2C_{p^m}\oplus C_p, C_{p^m}\oplus C_q, C_{p^m}\oplus C_q^2, Cpm⊕CrnC_{p^m}\oplus C_r^n where p,qp,q are distinct primes and r∈{2,3}r\in\{2,3\}. In our second main result we verify that K1(G)=K1∗(G)K_1(G) = K_1^*(G) for groups of the form Cr⊕Cpm⊕Cp,CrpmqC_r\oplus C_{p^m}\oplus C_p, C_{rp^mq} and Cr⊕Cp⊕Cq2C_r\oplus C_p \oplus C_q^2 for r∈{2,3}r \in \{2,3\} given some restrictions on pp and qq. We also study general techniques for computing and bounding K1(G)K_1(G), and derive an asymptotic result which shows that K1(G)K_1(G) becomes arbitrarily close to K1∗(G)K_1^*(G) as the smallest prime dividing ∣G∣|G| goes to infinity, given certain conditions on the structure of GG. We also derive some necessary properties of the structure of unique factorization indexed multisets which would hypothetically violate k(S)≤K1∗(G)k(S) \le K_1^*(G).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.