Fourier-Reflexive Partitions Induced by Poset Metric
Yang Xu, Haibin Kan, Guangyue Han

TL;DR
This paper characterizes when partitions induced by poset metrics on finite abelian groups are Fourier-reflexive, showing they must be hierarchical and establishing a connection with dual posets and polynomial families.
Contribution
It proves that Fourier-reflexive partitions induced by poset metrics are necessarily hierarchical, confirming a conjecture and providing explicit criteria for hierarchical posets and codeword classification.
Findings
Fourier-reflexive partitions coincide with dual poset partitions for hierarchical posets.
Necessary and sufficient conditions for a poset to be hierarchical.
Explicit criteria for codeword equivalence in hierarchical poset-induced partitions.
Abstract
Let be the cartesian product of a family of finite abelian groups indexed by a finite set . A given poset (i.e., partially ordered set) gives rise to a poset metric on , which further leads to a partition of . We prove that if is Fourier-reflexive, then its dual partition coincides with the partition of induced by , the dual poset of , and moreover, is necessarily hierarchical. This result establishes a conjecture proposed by Gluesing-Luerssen in \cite{4}. We also show that with some other assumptions, is finer than the partition of induced by . In addition, we give some necessary and sufficient…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Combinatorial Mathematics · Algebraic Geometry and Number Theory
