arXiv Analytics

Sign in

arXiv:1907.04208 [math.CO]AbstractReferencesReviewsResources

A Direct Construction of Primitive Formally Dual Pairs Having Subsets with Unequal Sizes

Shuxing Li, Alexander Pott

Published 2019-07-05Version 1

The concept of formal duality was proposed by Cohn, Kumar and Sch\"urmann, which reflects a remarkable symmetry among energy-minimizing periodic configurations. This formal duality was later translated into a purely combinatorial property by Cohn, Kumar, Reiher and Sch\"urmann, where the corresponding combinatorial objects were called formally dual pairs. So far, except the results presented in Li and Pott (arXiv:1810.05433v3), we have little information about primitive formally dual pairs having subsets with unequal sizes. In this paper, we propose a direct construction of primitive formally dual pairs having subsets with unequal sizes in $\mathbb{Z}_2 \times \mathbb{Z}_4^{2m}$, where $m \ge 1$. This construction recovers an infinite family obtained in Li and Pott (arXiv:1810.05433v3), which was derived by employing a recursive approach. Although the resulting infinite family was known before, the idea of the direct construction is new and provides more insights which were not known from the recursive approach.

Comments: arXiv admin note: substantial text overlap with arXiv:1810.05433
Categories: math.CO, math.MG
Related articles: Most relevant | Search more
arXiv:1810.05433 [math.CO] (Published 2018-10-12)
Constructions of Primitive Formally Dual Pairs Having Subsets with Unequal Sizes
arXiv:math/0411315 [math.CO] (Published 2004-11-14, updated 2004-12-14)
Direct construction of code loops
arXiv:2104.03079 [math.CO] (Published 2021-04-07)
A recursive approach for the enumeration of the homomorphisms from a poset $P$ to the chain $C_3$