Related papers: The existence of subspace designs
Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders…
A q-design with parameters t-(v,k,lambda_t)_q is a pair (V, B) of the v-dimensional vector space V over GF(q) and a collection B of k-dimensional subspaces of V, such that each t-dimensional subspace of V is contained in precisely lambda_t…
A framework associating quantum cosmological boundary conditions to minisuperspace hidden symmetries has been introduced in \cite{7}. The scope of the application was, notwithstanding the novelty, restrictive because it lacked a discussion…
A set of lines through the origin is called equiangular if every pair of lines defines the same angle, and the maximum size of an equiangular set of lines in $\mathbb{R}^n$ was studied extensively for the last 70 years. In this paper, we…
It seems to be a common belief that the space in which we live is a space-time manifold of dimension at least four. In the present article we wish to draw attention to a slightly different possibility - a space-time pseudomanifold (or even…
Given an arbitrary spectral space $X$, we endow it with its specialization order $\leq$ and we study the interplay between suprema of subsets of $(X,\leq)$ and the constructible topology. More precisely, we investigate about when the…
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
In this paper we discuss the existence of solutions to vectorial differential inclusions. We investigate sufficient conditions for existence, more flexible than those available in the literature, so that important applications can be fitted…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…
In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are…
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to…
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…
According to modern quantum physics, at the microlevel, the dimension of space-time is at least 11; we only observe 4 dimensions because the others are compactified: the size along each of the other dimensions is much smaller than the…
Some new necessary conditions for the existence of vector space partitions are derived. They are applied to the problem of finding the maximum number of spaces of dimension t in a vector space partition of V(2t,q) that contains m_d spaces…
The covering radius problem is a question in coding theory concerned with finding the minimum radius $r$ such that, given a code that is a subset of an underlying metric space, balls of radius $r$ over its code words cover the entire metric…
One of the challenges of modern engineering, and robotics in particular, is designing complex systems, composed of many subsystems, rigorously and with optimality guarantees. This paper introduces a theory of co-design that describes…