Related papers: Upper Bounds for $s$-Distance Subspaces

We study lower bounds for the Minkowski and Hausdorff dimensions of the algebraic sum E+K of two subsets E and K of d-dimensional Euclidean space.

Recently, the first author together with Jens Marklof studied generalizations of the classical three distance theorem to higher dimensional toral rotations, giving upper bounds in all dimensions for the corresponding numbers of distances…

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle $1/5$ are proved by carefully analyzing pillar decompositions, with the aid of the uniqueness of two-graphs on $276$ vertices. The Neumann…

We overview main topics and ideas in spaces with their scalar curvatures bounded from below, and present a more detailed exposition of several known and some new geometric constraints on Riemannian spaces implied by the lower bounds on…

We consider the problem of deriving upper bounds on the parameters of sum-rank-metric codes, with focus on their dimension and block length. The sum-rank metric is a combination of the Hamming and the rank metric, and most of the available…

We survey a few trace theorems for Sobolev spaces on $N$-dimensional Euclidean domains. We include known results on linear subspaces, in particular hyperspaces, and smooth boundaries, as well as less known results for Lipschitz boundaries,…

The research monograph expounds the foundation of a new theory of parabolic initial-boundary-value problems in scales of generalized anisotropic Sobolev spaces. These scales are calibrated essentially more finely with the help of a function…

This paper uses W. M. Schmidt's idea formulated in 1967 to generalise the classical theory of Diophantine approximation to subspaces of $\mathbb{R}^n$. Given two subspaces of $\mathbb{R}^n$ $A$ and $B$ of respective dimensions $d$ and $e$…

In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…

We use an estimate of Aksoy Yazici, Murphy, Rudnev and Shkredov (2016) on the number of solutions of certain equations involving products and differences of sets in prime finite fields to give an explicit upper bound on trilinear…

For elliptic systems with block structure in the upper half-space and t-independent coefficients, we settle the study of boundary value problems by proving compatible well-posedness of Dirichlet, regularity and Neumann problems in optimal…

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

As a generalization of singular linear spaces, we introduce the concept of t-singular linear spaces, make some anzahl formulas of subspaces, and determine the suborbits of t-singular linear groups.

We show that, for vector spaces in which distance measurement is performed using a gauge, the existence of best coapproximations in $1$-codimensional closed linear subspaces implies in dimensions $\geq 2$ that the gauge is a norm, and in…

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

Given parameters k, l, and d, we give new lower bounds on the dimensions N such that there are maps from R^d to R^N that are k-regular, l-skew embeddings, or k-regular-l-skew embeddings. This extends and sharpens results due to Chisholm…

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…