English
Related papers

Related papers: Pairwise balanced designs with prescribed minimum …

200 papers

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

Combinatorics · Mathematics 2010-02-17 Harold N. Ward

In this paper we construct constant dimension space codes with prescribed minimum distance. There is an increased interest in space codes since a paper by Koetter and Kschischang were they gave an application in network coding. There is…

Information Theory · Computer Science 2009-01-13 Axel Kohnert , Sascha Kurz

A set of $k$ orthonormal bases of $\mathbb C^d$ is called mutually unbiased if $|\langle e,f\rangle |^2 = 1/d$ whenever $e$ and $f$ are basis vectors in distinct bases. A natural question is for which pairs $(d,k)$ there exist~$k$ mutually…

Optimization and Control · Mathematics 2024-05-01 Sander Gribling , Sven Polak

We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…

Combinatorics · Mathematics 2025-04-10 Vedran Krčadinac , Lucija Relić

The dispersion of a point set $P\subset[0,1]^d$ is the volume of the largest box with sides parallel to the coordinate axes, which does not intersect $P$. Here, we show a construction of low-dispersion point sets, which can be deduced from…

Computational Complexity · Computer Science 2024-12-20 Mario Ullrich , Jan Vybíral

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. We determine the maximal dimension for an affine subspace of $n$ by $n$ symmetric (or alternating) matrices with entries in $\mathbb{K}$ and with…

Rings and Algebras · Mathematics 2016-04-21 Clément de Seguins Pazzis

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

Rings and Algebras · Mathematics 2015-01-13 Rod Gow

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Combinatorics · Mathematics 2023-03-22 Marco Buratti , Dieter Jungnickel

Let $M(n,d)$ be the maximum size of a permutation array on $n$ symbols with pairwise Hamming distance at least $d$. Some permutation arrays can be constructed using blocks of certain type [2] called product blocks in this paper. We study…

Information Theory · Computer Science 2018-05-17 Sergey Bereg

Linear codes in the projective space $\mathbb{P}_q(n)$, the set of all subspaces of the vector space $\mathbb{F}_q^n$, were first considered by Braun, Etzion and Vardy. The Grassmannian $\mathbb{G}_q(n,k)$ is the collection of all subspaces…

Information Theory · Computer Science 2021-07-23 Pranab Basu

An equilateral dimension of a normed space is a maximal number of pairwise equidistant points of this space. The aim of this paper is to study the equilateral dimension of certain classes of finite dimensional normed spaces. The well-known…

Metric Geometry · Mathematics 2014-11-20 Tomasz Kobos

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…

Information Theory · Computer Science 2021-05-05 Anirban Ghatak , Sumanta Mukherjee

In this article, we investigate collections of `well-spread-out' projective (and linear) subspaces. Projective $k$-subspaces in $\mathsf{PG}(d,\mathbb{F})$ are in `higgledy-piggledy arrangement' if they meet each projective subspace of…

Combinatorics · Mathematics 2014-09-23 Szabolcs L. Fancsali , Péter Sziklai

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

Combinatorics · Mathematics 2023-02-15 Peter Keevash , Ashwin Sah , Mehtaab Sawhney

We make four contributions to the theory of optimal subspace packings and equi-isoclinic subspaces: (1) a new lower bound for block coherence, (2) an exact count of equi-isoclinic subspaces of even dimension $r$ in $\mathbb{R}^{2r+1}$ with…

Information Theory · Computer Science 2025-11-26 Joseph W. Iverson , Kaysie Rose O

The obvious way to construct a GDD (group-divisible design) recursively is to use Wilson's Fundamental Construction for GDDs (WFC). Then a PBD (pairwise balanced design) is often obtained by adding a new point to each group of the GDD.…

Combinatorics · Mathematics 2024-03-27 Douglas R. Stinson

A class of nonlinear models combining a pharmacokinetic compartmental model and a pharmacodynamic Emax model is introduced. The locally D-optimal (LD) design for a four-parameter composed model is found to be a saturated four-point uniform…

Methodology · Statistics 2008-12-18 X. Fang , A. S. Hedayat

The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…

Combinatorics · Mathematics 2025-12-19 Heather Smith Blake , Jędrzej Hodor , Piotr Micek , Michał T. Seweryn , William T. Trotter

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey