Related papers: Tight quasi-symmetric designs

Relying on rays, we search for submodules of a module V over a supertropical semiring on which a given anisotropic quadratic form is quasilinear. Rays are classes of a certain equivalence relation on V, that carry a notion of convexity,…

A graph is $n$-existentially closed ($n$-e.c.) if for any disjoint subsets $A$, $B$ of vertices with $|{A \cup B}|=n$, there is a vertex $z \notin A \cup B$ adjacent to every vertex of $A$ and no vertex of $B$. For a block design with block…

In this paper, we show that for all $v\equiv 0,1$ (mod 5) and $v\geq 15$, there exists a super-simple $(v,5,2)$ directed design, also for these parameters there exists a super-simple $(v,5,2)$ directed design such that its smallest defining…

For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…

We give a new proof of a theorem of Kleiner-Leeb: that any quasi-isometrically embedded Euclidean space in a product of symmetric spaces and Euclidean buildings is contained in a metric neighborhood of finitely many flats, as long as the…

We describe structure of quasihomomorphisms from arbitrary groups to discrete groups. We show that all quasihomomorphisms are 'constructible', i.e., are obtained via certain natural operations from homomorphisms to some groups and…

Let $G=(V,E)$ be a directed graph. A $2$-edge-twinless block in $G$ is a maximal vertex set $C^{t}\subseteq V$ with $|C^{t}|>1$ such that for any distinct vertices $v,w \in C^{t}$, and for every edge $e\in E$, the vertices $v,w$ are in the…

A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks. The number of blocks is the covering's {\em size},…

A $(v,k,\lambda)$-covering is a pair $(V, \mathcal{B})$, where $V$ is a $v$-set of points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least…

We propose a procedure of constructing new block designs starting from a given one by looking at the intersections of its blocks with various sets and grouping those sets according to the structure of the intersections. We introduce a…

A block decomposition method is proposed for minimizing a (possibly non-convex) continuously differentiable function subject to one linear equality constraint and simple bounds on the variables. The proposed method iteratively selects a…

We exhibit the first examples of links which are homologically thin but not quasi-alternating. To show that they are not quasi-alternating, we argue that none of their branched double-covers bounds a negative definite 4-manifold with…

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…

Let $\k$ be a characteristic zero PID, $S$ be a $\k$-algebra and $T\subseteq S$ be a full rank subalgebra. Suppose the algebra $T$ is symmetric. It is important to know when $T$ is a {\em maximal symmetric subalgebra} of $S$, i.e. no…

Quasi-polar spaces are sets of points having the same intersection numbers with respect to hyperplanes as classical polar spaces. Non-classical examples of quasi-quadrics have been constructed using a technique called pivoting [5]. We…

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Possible forms of obstructed atomic limits in quasi-one-dimensional systems are studied using line group symmetry. This is accomplished by revisiting the standard theory with an emphasis on its group-theoretical background, synthesizing the…

Quasi-median graphs are a tool commonly used by evolutionary biologists to visualise the evolution of molecular sequences. As with any graph, a quasi-median graph can contain cut vertices, that is, vertices whose removal disconnect the…

It was shown in 1989 by Delandtsheer and Doyen that, for a $2$-design with $v$ points and block size $k$, a block-transitive group of automorphisms can be point-imprimitive (that is, leave invariant a nontrivial partition of the point set)…

We define a triangle design as a partition of the set of lines of a projective space into triangles, where a triangle consists of three pairwise intersecting lines with no common point. A triangle design is balanced if all points are…