Related papers: A new look at an old construction: constructing (s…

In the nineties, A.G. Spera introduced a construction principle for divisible designs. Using this method, we get series of divisible designs from finite Laguerre geometries. We show a close connection between some of these divisible designs…

The triplication method for constructing strong starters in $Z_{3m}$ from starters in $Z_{m}$ (say, a starter of order 21 from a starter of order 7) was proposed by the authors in 2025. The method reduced construction of the particular…

With recent advances in both responsive materials and fabrication techniques it is now possible to construct integrated functional structures, composed of both structural and active materials. We investigate the robust design of such…

Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…

Microstructure reconstruction is an important cornerstone to the inverse materials design concept. In this work, a general algorithm is developed to reconstruct a three-dimensional microstructure from given descriptors. Based on…

A residual design ${\cal{D}}_B$ with respect to a block $B$ of a given design $\cal{D}$ is defined to be linearly embeddable over $GF(p)$ if the $p$-ranks of the incidence matrices of ${\cal{D}}_B$ and $\cal{D}$ differ by one. A sufficient…

A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\rho$, quantifying the overlap between the sets within the family, is…

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree…

Given five positive integers $v, m,k,\lambda$ and $t$ where $v \geq k \geq t$ and $v \geq m \geq t,$ a $t$-$(v,k,m,\lambda)$ general covering design is a pair $(X,\mathcal{B})$ where $X$ is a set of $v$ elements (called points) and…

Origami structures enabled by folding and unfolding can create complex 3D shapes. However, even a small 3D shape can have large 2D unfoldings. The huge initial dimension of the 2D flattened structure makes fabrication difficult, and defeats…

Given a two-level regular fractional factorial design of resolution IV, the method of doubling produces another design of resolution IV which doubles both the run size and the number of factors of the initial design. On the other hand, the…

Repetitive Scenario Design (RSD) is a randomized approach to robust design based on iterating two phases: a standard scenario design phase that uses $N$ scenarios (design samples), followed by randomized feasibility phase that uses $N_o$…

Increasing reuse opportunities is a well-known problem for software designers as well as for hardware designers. Nonetheless, current software and hardware engineering practices have embraced different approaches to this problem. Software…

A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…

Over the past three decades, considerable effort has been devoted to the study of software architecture. A major portion of this effort has focused on the originally proposed view of four "C"s---components, connectors, configurations, and…

We give the first example of a mosaic of three combinatorial designs with distinct parameters $2$-$(13,3,1)$, $2$-$(13,4,2)$, and $2$-$(13,6,5)$. Furthermore, we give examples of mosaics of $2$-$(9,3,2)$ designs that are not resolvable,…

Spherical t-designs are Chebyshev-type averaging sets on the d-sphere S^d which are exact for polynomials of degree at most t. This concept was introduced in 1977 by Delsarte, Goethals, and Seidel, who also found the minimum possible size…

Polycube segmentations for 3D models effectively support a wide variety of applications such as seamless texture mapping, spline fitting, structured multi-block grid generation, and hexahedral mesh construction. However, the automated…

In a paper from 1886, Martinetti enumerated small $v_3$-configurations. One of his tools was a construction that permits to produce a $(v+1)_3$-configuration from a $v_3$-configuration. He called configurations that were not constructible…