Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Equitable [[2,10],[6,6]]-partitions of the 12-cube (2012.00038v2)

Published 30 Nov 2020 in math.CO and cs.DM

Abstract: We describe the computer-aided classification of equitable partitions of the $12$-cube with quotient matrix $[[2,10],[6,6]]$, or, equivalently, simple orthogonal arrays OA$(1536,12,2,7)$, or order-$7$ correlation-immune Boolean functions in $12$ variables with $1536$ ones (which completes the classification of unbalanced order-$7$ correlation-immune Boolean functions in $12$ variables). We find that there are $103$ equivalence classes of the considered objects, and there are only two almost-OA$(1536,12,2,8)$ among them. Additionally, we find that there are $40$ equivalence classes of pairs of disjoint simple OA$(1536,12,2,7)$ (equivalently, equitable partitions of the $12$-cube with quotient matrix $[[2,6,4], [6,2,4], [6,6,0]]$) and discuss the existence of a non-simple OA$(1536,12,2,7)$. Keywords: orthogonal arrays, correlation-immune Boolean functions, equitable partitions, perfect colorings, intriguing sets.

Citations (2)

Summary

We haven't generated a summary for this paper yet.