Related papers: A complementary design theory for doubling

We improve the existing results of optimal partial profile paired choice designs and provide new designs for situations where the choice set sizes are greater than two. The optimal designs are obtained under the main effects models and the…

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a $t$-design. Till now only a small amount of work on constructing $t$-designs…

We construct $\varepsilon$-approximate unitary $k$-designs on $n$ qubits in circuit depth $O(\log k \log \log n k / \varepsilon)$. The depth is exponentially improved over all known results in all three parameters $n$, $k$, $\varepsilon$.…

Previous work identifying depth-optimal $n$-channel sorting networks for $9\leq n \leq 16$ is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper…

The goal of this paper is to develop methods for the construction of saturated designs that include the mean, main effects and the two-factor interactions of one factor with a subset of the remaining factors. If one factor is interacting…

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

Factorial designs are often used in various industrial and sociological experiments to identify significant factors and factor combinations that may affect the process response. In the statistics literature, several studies have…

In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$, there exists a super-simple $(v,5,2)$ directed design, also for these parameters there exists a super-simple $(v,5,2)$ directed design such that its smallest defining…

A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…

Factorial designs are widely used in agriculture, engineering, and the social sciences to study the causal effects of several factors simultaneously on a response. The objective of such a design is to estimate all factorial effects of…

We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension $n$ and the…

Building large models with parameter sharing accounts for most of the success of deep convolutional neural networks (CNNs). In this paper, we propose doubly convolutional neural networks (DCNNs), which significantly improve the performance…

We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…

In this paper we study optimality aspects of a certain type of designs in a multi-way heterogeneity setting. These are ``duals" of plans orthogonal through the block factor (POTB). Here by the dual of a main effect plan (say $\rho$) we mean…

In high-dimensional classification problems, a commonly used approach is to first project the high-dimensional features into a lower dimensional space, and base the classification on the resulting lower dimensional projections. In this…

In this paper, we study some new factorizations of period-doubling sequences over a $k$-letter alphabet, where $k\geq 2$. First, we define the combinatorial and arithmetic properties of these sequences. Then, we define the kernel words of…

It is conjectured that the dual variety of every smooth nonlinear subvariety of dimension $> \frac{2N}{3}$ in projective $N$-space is a hypersurface, an expectation known as the duality defect conjecture. This would follow from the truth of…

Constant dimension codes (CDCs) are essential for error correction in random network coding. A fundamental problem of CDCs is to determine their maximal possible size for given parameters. Inserting construction and multilevel construction…

Binary self-orthogonal codes and balanced incomplete block designs are two combinatorial configurations that have been much studied because of their wide areas of application. In this paper, we have shown the distribution of (16; 6;…

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoi\v{c}i\'{c} (2003) showed that the limiting set is dense…