← All problems

The Fourier-reflexivity characterization of hierarchical posets

5 years old · traced to

Let P=(Ω,≼P)\boldsymbol{P}=(\Omega,\preccurlyeq_{\boldsymbol{P}}) be a poset, let (Hi∣i∈Ω)(H_i\mid i\in\Omega) be finite abelian groups, and let H=∏i∈ΩHi\boldsymbol{H}=\prod_{i\in\Omega}H_i. For a codeword β∈H\beta\in\boldsymbol{H}, define

supp⁡(β)=i∣i∈Ω, β(i)≠1Hi\operatorname{supp}(\beta)=\\{i\mid i\in\Omega,~\beta_{(i)}\neq1_{H_i}\\}

and

wt⁡P(β)=∣⟨supp⁡(β)⟩P∣.\operatorname{wt}_{\boldsymbol{P}}(\beta)=|\langle\operatorname{supp}(\beta)\rangle_{\boldsymbol{P}}|.

Let Q(H,P)\mathcal{Q}(\boldsymbol{H},\boldsymbol{P}) be the partition of H\boldsymbol{H} whose blocks are the sets of codewords having equal P\boldsymbol{P}-weight. The poset P\boldsymbol{P} is hierarchical if u≼Pvu\preccurlyeq_{\boldsymbol{P}}v whenever u,v∈Ωu,v\in\Omega satisfy len⁡(u)+1⩽len⁡(v)\operatorname{len}(u)+1\leqslant\operatorname{len}(v).

Fourier-reflexivity characterization. If ∣Hi∣⩾2|H_i|\geqslant2 for all i∈Ωi\in\Omega and Q(H,P)\mathcal{Q}(\boldsymbol{H},\boldsymbol{P}) is Fourier-reflexive, then P\boldsymbol{P} is hierarchical.

This conjecture characterizes hierarchical posets through Fourier-reflexivity of their poset-weight partitions. The parser marks it as resolved; the supplied evidence indicates that the result was established in the source's cited literature, so it is recorded as solved.

References
  1. Yang Xu, Haibin Kan and Guangyue Han, “Fourier-Reflexive Partitions Induced by Poset Metric”, arXiv:2107.10401 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.