Related papers: Perfect sequence covering arrays

Let $n$, $s$, and $k$ be positive integers. We say that a sequence $f_1,\dots,f_s$ of nonnegative integers is satisfying if for any collection of $s$ families $\mathcal F_1,\dots,\mathcal F_s\subseteq [n]^k$ such that $|\mathcal F_i|=f_i$…

What is the length of the shortest sequence $S$ of reals so that the set of consecutive $n$-words in $S$ form a covering code for permutations on $\{1,2, >..., n\}$ of radius $R$ ? (The distance between two $n$-words is the number of…

An increasing sequence $(a_n)$ of positive integers which satisfies $\frac{a_{n+1}}{a_n}>1+\eta$ for some positive $\eta$ is called a lacunary sequence. It has been known for over twenty years that every lacunary sequence is strong sweeping…

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…

Let $H$ be a $k$-uniform hypergraph on $n$ vertices where $n$ is a sufficiently large integer not divisible by $k$. We prove that if the minimum $(k-1)$-degree of $H$ is at least $\lfloor n/k \rfloor$, then $H$ contains a matching with…

An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were…

This work shows several direct and recursive constructions of ordered covering arrays using projection, fusion, column augmentation, derivation, concatenation and cartesian product. Upper bounds on covering codes in NRT spaces are also…

Optimal gap sequences in Shellsort, defined as gap sequences having the minimised maximum number of comparisons for a fixed number of pairwise distinct elements, are found by minimax search in reduced permutational spaces, namely Bad…

Correlation measure of order $k$ is an important measure of randomness in binary sequences. This measure tries to look for dependence between several shifted version of a sequence. We study the relation between the correlation measure of…

We give, for each $k \geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible…

Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…

For positive integers $k,n$, a de Bruijn sequence $B(k,n)$ is a finite sequence of elements drawn from $k$ characters whose subwords of length $n$ are exactly the $k^n$ words of length $n$ on $k$ characters. This paper introduces the…

Recently, motivated by Stanley sequences, Kiss, S\' andor and Yang introduced a new type sequence: a sequence $A$ of nonnegative integers is called an $AP_k$ - covering sequence if there exists an integer $n_0$ such that if $n > n_0$, then…

Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Let f_k(n) denote the length of a shortest k-radius sequence over A. We…

Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the…

For a finite non cyclic group $G$, let $\gamma(G)$ be the smallest integer $k$ such that $G$ contains $k$ proper subgroups $H_1,\dots,H_k$ with the property that every element of $G$ is contained in $H_i^g$ for some $i \in \{1,\dots,k\}$…

A perfect matching in a 3-uniform hypergraph on $n=3k$ vertices is a subset of $\frac{n}{3}$ disjoint edges. We prove that if $H$ is a 3-uniform hypergraph on $n=3k$ vertices such that every vertex belongs to at least ${n-1\choose 2} -…

Let $R(n,k)$ denote the number of permutations of ${1,2,...,n}$ with $k$ alternating runs. In this note we present an explicit formula for the numbers $R(n,k)$.

The paper addresses the problem of defining families of ordered sequences $\{x_i\}_{i\in N}$ of elements of a compact subset $X$ of $R^d$ whose prefixes $X_n=\{x_i\}_{i=1}^{n}$, for all orders $n$, have good space-filling properties as…

Spread spectrum multiple access systems demand minimum possible cross-correlation between the sequences within a set of sequences having good auto-correlation properties. Through a connection between generalised Frank sequences and…