On the number of frequency hypercubes F^n(4;2,2)

DOI10.1134/S0037446621050165MaRDI QIDQ820504zbMATHOpenAlexFDO

Authors Minjia Shi, Shu-Kai Wang, Xiao-Xiao Li, Denis S. Krotov

Publication date 27 September 2021

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.10887

zbMATH Keywords

Latin hypercubeMDS codefrequency squaretesting setfrequency hypercube

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Other designs, configurations (05B30) Linear codes (general theory) (94B05)

Abstract: A frequency $n$-cube $F^n(4;2,2)$ is an $n$-dimensional $4$-by-...-by-$4$ array filled by $0$s and $1$s such that each line contains exactly two $1$s. We classify the frequency $4$-cubes $F^4(4;2,2)$, find a testing set of size $25$ for $F^3(4;2,2)$, and derive an upper bound on the number of $F^n(4;2,2)$. Additionally, for any $n$ greater than $2$, we construct an $F^n(4;2,2)$ that cannot be refined to a latin hypercube, while each of its sub-$F^{n-1}(4;2,2)$ can. Keywords: frequency hypercube, frequency square, latin hypercube, testing set, MDS code

Recommendations

• A study of frequency cubes
• Equiorthogonal frequency hypercubes: Preliminary theory
• Publication:3475276
• Construction of complete sets of mutually equiorthogonal frequency hypercubes
• scientific article; zbMATH DE number 1558154

Cites work

• scientific article; zbMATH DE number 3950548 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 5228046 (Why is no real title available?)
• A Census of Small Latin Hypercubes
• Classification algorithms for codes and designs
• Frequency squares of orders 7 and 8
• Multidimensional Latin bitrades
• On extensions of partial \(n\)-quasigroups of order 4.
• On the cardinality spectrum and the number of Latin bitrades of order 3
• On the number of \(n\)-ary quasigroups of finite order.
• Practical graph isomorphism. II.
• \(n\)-ary quasigroups of order 4.

Cited in

(1)

• An upper bound on the number of frequency hypercubes

Describes a project that uses

Uses Software

• nauty
• OEIS
• Traces

This page was built for publication: On the number of frequency hypercubes \(F^n(4;2,2) \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820504)