Related papers: Borsuk's partition problem in four-dimensional $\e…
This note deals with estimating the volume of the set of separable mixed quantum states when the dimension of the state space grows to infinity. This has been studied recently for qubits; here we consider larger particles and conclude that,…
We study the unknown differences between the size of slices and relatively weakly open subsets of the unit ball in Banach spaces. We show that every Banach space containing isomorphic copies of $c_0$ can be equivalently renormed so that…
We say a map f:X \to Y is an \epsilon-embedding if it is continuous and the diameter of the fibres is less than \epsilon. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is…
Given an infinite matrix $M=(m_{nk})$ we study a family of sequence spaces $\ell_M^p$ associated with it. When equipped with a suitable norm $\|\cdot\|_{M,p}$ we prove some basic properties of the Banach spaces of sequences…
We prove that every finite Borel measure $\mu$ in $\mathbb{R}^N$ that is bounded from above by the Hausdorff measure $\mathcal{H}^s$ can be split in countable many parts $\mu\lfloor_{E_k}$ that are bounded from above by the Hausdorff…
We investigate a complex analogue of Spencer's Six Standard Deviations Theorem. Specifically, we propose the following conjecture: for any dimension $n \geq 2$, given vectors $a_1, \ldots, a_n \in \mathbb{C}^n$ satisfying $\|a_i\|_{\infty}…
We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…
For every $n\geq 3,$ we construct an $n$-dimensional Banach space which is isometric to a subspace of $L_{1/2}$ but is not isometric to a subspace of $L_1.$ The isomorphic version of this problem (posed by S. Kwapien in 1969) is still open.…
We investigate the problem of finding the minimum number of pieces necessary for dividing a three-dimensional sphere or a ball and reassembling it to form $n$ congruent copies of the original object, generalising a known result by Raphael…
Based on the notion of thin sets introduced recently by T.~Banakh, Sz.~G\l{}\k{a}b, E.~Jab\l{}o\'nska and J.~Swaczyna we deliver a study of the infinite single-message transmission protocols. Such protocols are associated with a set of…
We consider a variant of the $k$-center clustering problem in $\Re^d$, where the centers can be divided into two subsets, one, the red centers of size $p$, and the other, the blue centers of size $q$, where $p+q=k$, and such that each red…
In this paper, we begin by constructing global linear maps on (n-2)-dimensional subspaces, derived from the local continuity of linear transformations among central sections of a convex body. Using these linear maps, we subsequently…
We present conjectured candidates for the least perimeter partition of a disc into $N \le 10$ regions which take one of two possible areas. We assume that the optimal partition is connected, and therefore enumerate all three-connected…
Based on a result of Makeev, in 2012 Blagojevi\'c and Karasev proposed the following problem: given any positive integers $m$ and $1\leq \ell\leq k$, find the minimum dimension $d=\Delta(m;\ell/k)$ such that for any $m$ mass distributions…
We prove a metric statement about approximation of a $n$-dimensional linear subspace $A$ in $\mathbb{R}^d$ by $n$-dimensional rational subspaces. We consider the problem of finding a rational subspace $B$ of bounded height $H=H(B)$ for…
We investigate the extrinsic geometry of causal sets in $(1+1)$-dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in…
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
We consider the problem of partitioning a two-dimensional flat torus $T^2$ into $m$ sets in order to minimize the maximal diameter of a part. For $m \leqslant 25$ we give numerical estimates for the maximal diameter $d_m(T^2)$ at which the…
Recently, Adiprasito et al. have initiated the study of the so-called no-dimensional Tverberg problem. This problem can be informally stated as follows: Given $n\geq k$, partition an $n$-point set in Euclidean space into $k$ parts such that…
In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…