Related papers: Some necessary conditions for vector space partiti…

We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.

We study Schmidt rank for a vector (i.e., a pure state) and Schmidt number for a mixed state which are entanglement measures. We show that if a subspace of a certain bipartite system contains no vector of Schmidt rank $\leqslant k$, then…

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…

For $n$ and $k$ integers we introduce the notion of some partition of $n$ being able to generate another partition of $n$. We solve the problem of finding the minimum size partition for which the set of partitions this partition can…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

Great progress has been made recently in establishing conditions for separability of a particular class of Werner densities on the tensor product space of $n$ $d$--level systems (qudits). In this brief note we complete the process of…

We systematically study the splitting of vector bundles on a smooth, projective variety, whose restriction to the zero locus of a regular section of an ample vector bundle splits. First, we find ampleness and genericity conditions which…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…

This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ needed to guarantee the existence of an $m$-partition of the points such that the intersection of the $m$…

Pati (Physics Letters A, 2000) derived a sufficient condition for the existence of Schmidt decomposition in tripartite Hilbert spaces. In this paper, we show that the condition is erroneous by demonstrating some counter-examples. Moreover,…

In this paper we provide sufficient conditions that ensure the existence of the solution of some vector equilibrium problems in Hausdorff topological vector spaces ordered by a cone. The conditions that we consider are imposed not on the…

This paper addresses the following questions for a given tree $T$ and integer $d\geq2$: (1) What is the minimum number of degree-$d$ subtrees that partition $E(T)$? (2) What is the minimum number of degree-$d$ subtrees that cover $E(T)$? We…

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Let $D$ and $E$ be subspaces of the tensor product of the finite-dimensional Hilbert spaces $\mathbb{C}^m \otimes \mathbb{C}^n$. We show that the number of product vectors in $D$ with their partial conjugates in $E$ is uniformly bounded…

The paper is devoted to developing subdifferential theory for set-valued mappings taking values in ordered infinite-dimensional spaces. This study is motivated by applications to problems of vector and set optimization with various…

We consider a quantum system with a finite number of distinguishable quantum states, which may be partitioned freely by a number of quantum particles, assumed to be maximally entangled. We show that if we partition the system into a number…

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…