Related papers: A criterion for determining whether multiple shell…

There are two standard approaches to the construction of $t$-designs. The first one is based on permutation group actions on certain base blocks. The second one is based on coding theory. The objective of this paper is to give a spectral…

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

Systems design processes are increasingly reliant on simulation models to inform design decisions. A pervasive issue within the systems engineering community is trusting in the models used to make decisions about complex systems. This work…

Living systems, particularly multicellular systems, often seem hopelessly complex. But recent studies have suggested that beneath this complexity, there may be unifying quantitative principles that we are only now starting to unravel. All…

We study the problem of empirical coordination subject to a fidelity criterion for a general set-up. We prove a result which indicates a strong connection between our framework and the framework of empirical coordination developed in [1].…

Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been…

We indicate a way of distinguishing between structures, for which, two structures are said to be separable.Being separable implies being non-isomorphic. We show that for any first order theory $T$ in a countable language, if it has an…

Let C be an extremal binary doubly even self-dual code of length n and s(C) denote the largest integer t such that the support design of C holds a t-design for some weight. In this paper, we prove s(C) \leq 7.

We try to embed a t-design in a finite commutative group in such a way that the sum of the k points of a block is zero. We can compute the number of blocks of the boolean 2-design having all the non zero vectors of $(Z_2)^n$ as the set of…

This paper defines analysis-suitable T-splines for arbitrary degree (including even and mixed degrees) and arbitrary dimension. We generalize the concept of anchor elements known from the two-dimensional setting, extend existing concepts of…

Multi-component aggregates are being intensively researched in various fields because of their highly tunable properties and wide applications. Due to the complex configurational space of these systems, research would greatly benefit from a…

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…

Cell formation problem is among the first obstacles the designer of cellular production systems must overcome. This paper presents a critical analysis of the various criteria and constraints considered in the literature. The objective is to…

Let $C$ be a two and three-weight ternary code. Furthermore, we assume that $C_\ell$ are $t$-designs for all $\ell$ by the Assmus--Mattson theorem. We show that $t \leq 5$. As a corollary, we provide a new characterization of the (extended)…

We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…

In the present paper we consider design criteria which depend on several designs simultaneously. We formulate equivalence theorems based on moment matrices (if criteria depend on designs via moment matrices) or with respect to the designs…

A fascinating topic of combinatorics is $t$-designs, which have a very long history. The incidence matrix of a $t$-design generates a linear code over GF$(q)$ for any prime power $q$, which is called the linear code of the $t$-design over…

Constacyclic codes over finite fields are of theoretical importance as they are closely related to a number of areas of mathematics such as algebra, algebraic geometry, graph theory, combinatorial designs and number theory. However, the…

A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…

We give a local criterion in terms of a residue current for strong holomorphicity of a meromorphic function on an arbitrary pure-dimensional analytic variety. This generalizes a result by A Tsikh for the case of a reduced complete…