Related papers: Orthogonal main effect plans on blocks of small si…

The Oide effect considers the synchrotron radiation in the final focusing quadrupole and it sets a lower limit on the vertical beam size at the Interaction Point, particularly relevant for high energy linear colliders. The theory of the…

The muon optimizer has picked up much attention as of late as a possible replacement to the seemingly omnipresent Adam optimizer. Recently, care has been taken to document the scaling laws of hyper-parameters under muon such as weight decay…

There is an increasing interest in estimating heterogeneity in causal effects in randomized and observational studies. However, little research has been conducted to understand heterogeneity in an instrumental variables study. In this work,…

We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of $2$-connected components, or blocks. This includes the class of planar graphs. For this, we develop a notion of a…

Massively-parallel graph algorithms have received extensive attention over the past decade, with research focusing on three memory regimes: the superlinear regime, the near-linear regime, and the sublinear regime. The sublinear regime is…

The computational complexity of the Maximum Likelihood decoding algorithm in [1], [2] for orthogonal space-time block codes is smaller than specified.

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength…

We present a method for improving the efficiency and user experience of freeform illumination design with machine learning. By utilizing orthogonal polynomials to interface with artificial neural networks, we are able to generalize…

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…

Let $G$ be a planar $3$-graph (i.e., a planar graph with vertex degree at most three) with $n$ vertices. We present the first $O(n^2)$-time algorithm that computes a planar orthogonal drawing of $G$ with the minimum number of bends in the…

For run sizes that are a multiple of four, the literature offers many two-level designs that are D- and A-optimal for the main-effects model and minimize the aliasing between main effects and interaction effects and among interaction…

Classifying orthogonal arrays is a well known important class of problems that asks for finding all non-isomorphic, non-negative integer solutions to a class of systems of constraints. Solved instances are scarce. We develop two new methods…

Quantum coherence, as a direct manifestation of the quantum superposition principle, is a crucial resource in quantum information processing. Block coherence resource theory generalizes the traditional coherence framework by defining…

Optimal block designs for additive models achieve their efficiency by dividing experimental units among relatively homogenous blocks and allocating treatments equally to blocks. Responses in many modern experiments, however, are drawn from…

The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…

This paper describes a framework for capturing geological structures in a 3D block model and improving its spatial fidelity given new mesh surfaces. Using surfaces that represent geological boundaries, the objectives are to identify areas…

We construct random metric spaces by gluing together an infinite sequence of pointed metric spaces that we call blocks. At each step, we glue the next block to the structure constructed so far by randomly choosing a point on the structure…