Kuppusamy Ravindran

Quantitative companion to Constant capture counts and witnessed realization

I study the minimum total weight of two-trace masks needed to realize a prescribed array on the eight-dimensional Boolean cube. The demand is specified separately for each cube point and each four-coordinate support, so the support labels are retained. For the four-support parity...

The two-trace partition number of the Boolean cube: the exact value χ₄ = 6

For d ≥ 1, let Q be the Boolean cube of binary words of length 2d, with coordinates indexed by {0,…,2d−1}. A two-trace mask is a set H ⊆ Q for which each word h can be assigned a d-element coordinate set S(h) such that, whenever h and k are distinct words in H, the coordinates on...