Related papers: Improved Strength Four Covering Arrays with Three …

A 3-$(n,4,1)$ packing design consists of an $n$-element set $X$ and a collection of $4$-element subsets of $X$, called {\it blocks}, such that every $3$-element subset of $X$ is contained in at most one block. The packing number of…

This paper proposes an overidentifying restriction test for high-dimensional linear instrumental variable models. The novelty of the proposed test is that it allows the number of covariates and instruments to be larger than the sample size.…

Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with $n$ elements and want to identify $d$ invalid ones among them by performing only $t$ tests ($t \leq n$).…

Despite the success and popularity of oligonucleotide arrays as a high-throughput technique for measuring mRNA expression levels, quantitative calibration studies have until now been limited. The main reason is that suitable data was not…

The malfunction of safety-critical systems may cause damage to people and the environment. Software within those systems is rigorously designed and verified according to domain specific guidance, such as ISO26262 for automotive safety. This…

Augmented designs are typically used in early-stage breeding programs to compare single replicates of test entries by combining them with replicated check varieties. One or two dimensional incomplete blocking can be incorporated in the…

We investigate structural parameterizations of two identification problems: LOCATING-DOMINATING SET and TEST COVER. In the first problem, an input is a graph $G$ on $n$ vertices and an integer $k$, and one asks if there is a subset $S$ of…

Let $(\mathcal{X},\rho)$ be a metric space and $\lambda$ be a Borel measure on this space defined on the $\sigma$-algebra generated by open subsets of $\mathcal{X}$; this measure $\lambda$ defines volumes of Borel subsets of $\mathcal{X}$.…

A PSCA$(v, t, \lambda)$ is a multiset of permutations of the $v$-element alphabet $\{0, \dots, v-1\}$ such that every sequence of $t$ distinct elements of the alphabet appears in the specified order in exactly $\lambda$ permutations. For $v…

Mainstream software applications and tools are the configurable platforms with an enormous number of parameters along with their values. Certain settings and possible interactions between these parameters may harden (or soften) the security…

Threshold graphs are a class of graphs that have many equivalent definitions and have applications in integer programming and set packing problems. A graph is said to have a threshold cover of size $k$ if its edges can be covered using $k$…

In [1], we introduced a family of combinatorial designs, which we call "alphabet reduction pairs of arrays", ARPAs for short. These designs depend on three integer parameters $q, p \leq q, k\leq p$: $q$ is the size of the symbol set $\{0, 1…

We introduce the notion of the { \it strong $(r,p)$ cover} number $\chi^c(G,k,r,p)$ for $k$-uniform hypergraphs $G(V,E)$, where $\chi^c(G,k,r,p)$ denotes the minimum number of $r$-colorings of vertices in $V$ such that each hyperedge in $E$…

Let $G$ be a graph with $n$ vertices and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove…

We consider the notion of a signed magic array, which is an $m \times n$ rectangular array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in each column, filled with a certain set of numbers…

For a graph class $\mathcal G$ and a graph $H$, the four $\mathcal G$-covering numbers of $H$, namely global ${\rm cn}_{g}^{\mathcal{G}}(H)$, union ${\rm cn}_{u}^{\mathcal{G}}(H)$, local ${\rm cn}_{l}^{\mathcal{G}}(H)$, and folded ${\rm…

The poset cover problem seeks a minimum set of partial orders whose linear extensions cover a given set of linear orders. Recognizing its NP-completeness, we devised a non-trivial reduction to the Boolean satisfiability problem using a…

Nested counter systems (NCS) are a generalization of counter systems to higher-order counters. Here, a higher-order counter is allowed to have other (lower-order) counters as elements, instead of just a number. Such systems can be viewed as…

For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…