Related papers: Super-simple 2-(v; 5; 1) directed designs and thei…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
Strong blocking sets and their counterparts, minimal codes, attracted lots of attention in the last years. Combining the concatenating construction of codes with a geometric insight into the minimality condition, we explicitly provide…
The purpose of this paper is to classify all pairs $(\mathcal{D}, G)$, where $\mathcal{D}$ is a non-trivial $2$-$(v, k, 2)$ design, and $G\leq Aut(\mathcal{D})$ acts transitively on the set of blocks of $\mathcal{D}$ and primitively on the…
In a graph $G$, a set $D\subseteq V(G)$ is called 2-dominating set if each vertex not in $D$ has at least two neighbors in $D$. The 2-domination number $\gamma_2(G)$ is the minimum cardinality of such a set $D$. We give a method for the…
Subspace codes are collections of subspaces of a projective space such that any two subspaces satisfy a pairwise minimum distance criterion. Recent results have shown that it is possible to construct optimal $(5,3)$ subspace codes from…
Some constructions and bounds on the sizes of semiovals contained in the Hermitian curve are given. A construction of an infinite family of 2-blocking sets of the Hermitian curve is also presented.
Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…
In a given graph $G$, a set $S$ of vertices with an assignment of colors is a {\sf defining set of the vertex coloring of $G$}, if there exists a unique extension of the colors of $S$ to a $\Cchi(G)$-coloring of the vertices of $G$. A…
A {\em resolving set} for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\em metric dimension} of $\Gamma$ is the…
Minimal 1-saturating sets in the projective plane $PG(2,q)$ are considered. They correspond to covering codes which can be applied to many branches of combinatorics and information theory, as data compression, compression with distortion,…
We consider deterministic fast-slow dynamical systems of the form \[ x_{k+1}^{(n)} = x_k^{(n)} + n^{-1} A(x_k^{(n)}) + n^{-1/\alpha} B(x_k^{(n)}) v(y_k), \quad y_{k+1} = Ty_k, \] where $\alpha\in(1,2)$ and $x_k^{(n)}\in{\mathbb R}^m$. Here,…
A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V\setminus D$ is a neighbor of some vertex of $D$. The domination number of $G$ is the minimum size of a dominating set of $G$ and it is denoted by…
A dominating set in a directed graph is a set of vertices $S$ such that all the vertices that do not belong to $S$ have an in-neighbour in $S$. A locating set $S$ is a set of vertices such that all the vertices that do not belong to $S$ are…
Let $G=(V,E)$ be a graph. A subset $D$ of $V(G)$ is called a super dominating set if for every $v \in V(G)-D$ there exists an external private neighbour of $v$ with respect to $V(G)-D.$ The minimum cardinality of a super dominating set is…
Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md (u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,u)$\} where $\overrightarrow{d}(u,v)$ denote the length…
It is known that all resolution IV regular $2^{n-m}$ designs of run size $N=2^{n-m}$ where $5N/16<n<N/2$ must be projections of the maximal even design with $N/2$ factors and, therefore, are even designs. This paper derives a general and…
Recently, we demonstrated the existence of heterotic--string solutions in which the observable sector effective field theory just below the string scale reduces to that of the MSSM, with the standard observable gauge group being just…
We display a new integrable perturbation for both N=1 and N=2 superconformal minimal models. These perturbations break supersymmetry explicitly. Their existence was expected on the basis of the classification of integrable perturbations of…
A set of $N$ permutations of $\{1,2,\dots,v\}$ is $(N,v,t)$-suitable if each symbol precedes each subset of $t-1$ others in at least one permutation. The central problems are to determine the smallest $N$ for which such a set exists for…
We prove the following results regarding the linear solvability of networks over various alphabets. For any network, the following are equivalent: (i) vector linear solvability over some finite field, (ii) scalar linear solvability over…