Related papers: A note on Borsuk's problem in Minkowski spaces

In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclidean distance between points up to a bounded relative error.…

The Minkowski problem for electrostatic capacity characterizes measures generated by electrostatic capacity, which is a well-known variant of the Minkowski problem. This problem has been generalized to $L_p$ Minkowski problem for…

Eskenazis, Nayar and Tkocz have shown recently some resilience of Ball's celebrated cube slicing theorem, namely its analogue in $l^n_p$ for large $p$. We show that the complex analogue, i.e. resilience of the polydisc slicing theorem…

A generalization of Lozanovskii's result is proved. Let E be $k$-dimensional subspace of an $n$-dimensional Banach space with unconditional basis. Then there exist $x_1,..,x_k \subset E$ such that $B_E \p \subset \p absconv\{x_1,..,x_k\}$…

We consider a (4+d)-dimensional spacetime broken up into a (4-n)-dimensional Minkowski spacetime (where n goes from 1 to 3) and a compact (n+d)-dimensional manifold. At the present time the n compactification radii are of the order of the…

We show that given a real number $p<1$, a positive integer $n$ and a proper subspace $H$ of $\mathbb{R}^n$, the measure on the Euclidean sphere $\mathbb{S}^{n-1}$, which is concentrated in $H$ and whose restriction to the class of Borel…

We construct a quasiconformal mapping of $n$-dimensional Euclidean space, $n \geq 2$, that simultaneously distorts the Hausdorff dimension of a nearly maximal collection of parallel lines by a given amount. This answers a question of…

Short distance scaling limits of a class of integrable models on two-dimensional Minkowski space are considered in the algebraic framework of quantum field theory. Making use of the wedge-local quantum fields generating these models, it is…

We show that for polytopes P_1, P_2, ..., P_r \subset \R^d, each having n_i \ge d+1 vertices, the Minkowski sum P_1 + P_2 + ... + P_r cannot achieve the maximum of \prod_i n_i vertices if r \ge d. This complements a recent result of Fukuda…

We continue the study by Melo and Winter [arXiv:1712.01763, 2017] on the possible intersection sizes of a $k$-dimensional subspace with the vertices of the $n$-dimensional hypercube in Euclidean space. Melo and Winter conjectured that all…

We show some characterizations of hyperspheres in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$ with intrinsic and extrinsic properties such as the $n$-dimensional area of the sections cut off by hyperplanes, the…

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

We solve Blaschke's problem for hypersurfaces of dimension $n\geq 3$. Namely, we determine all pairs of Euclidean hypersurfaces $f,\tilde{f}\colon M^n\to\R^{n+1}$ that induce conformal metrics on $M^n$ and envelope a common sphere…

We provide a construction of sets of (d/2+1) mutually unbiased bases (MUBs) in dimensions d=4,8 using maximal commuting classes of Pauli operators. We show that these incomplete sets cannot be extended further using the operators of the…

We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the ``$3^d$-conjecture''. It is well-known that the three…

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…

We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…