Related papers: Higgledy-piggledy subspaces and uniform subspace d…

We discuss homogeneity and universality issues in the theory of abstract linear spaces, namely, structures with points and lines satisfying natural axioms, as in Euclidean or projective geometry. We show that the two smallest projective…

A completely entangled subspace of a tensor product of Hilbert spaces is a subspace with no non-trivial product vector. K. R. Parthasarathy determined the maximum dimension possible for such a subspace. Here we present a simple explicit…

Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…

A graph $G=(V,E)$ is a support of a hypergraph $H=(V,S)$ if every hyperedge induces a connected subgraph in $G$. Supports are used for certain types of hypergraph visualizations. In this paper we consider visualizing spatial hypergraphs,…

Let $P$ be a set of $n$ points in $\mathbb{R}^d$. In the projective clustering problem, given $k, q$ and norm $\rho \in [1,\infty]$, we have to compute a set $\mathcal{F}$ of $k$ $q$-dimensional flats such that $(\sum_{p\in P}d(p,…

Several learning applications require solving high-dimensional regression problems where the relevant features belong to a small number of (overlapping) groups. For very large datasets and under standard sparsity constraints, hard…

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility…

Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…

We study the {pair correlations between} prime numbers in an interval $M \leq p \leq M + L$ with $M \rightarrow \infty$, $L/M \rightarrow \beta > 0$. By analyzing the \emph{structure factor}, we prove, conditionally on the {Hardy-Littlewood…

A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…

We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…

How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

In this work we study arrangements of $k$-dimensional subspaces $V_1,\ldots,V_n \subset \mathbb{C}^\ell$. Our main result shows that, if every pair $V_{a},V_b$ of subspaces is contained in a dependent triple (a triple $V_{a},V_b,V_c$…

An $(r,M,2\delta;k)_q$ constant--dimension subspace code, $\delta >1$, is a collection $\cal C$ of $(k-1)$--dimensional projective subspaces of ${\rm PG(r-1,q)}$ such that every $(k-\delta)$--dimensional projective subspace of ${\rm…

For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $\mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The…

The log-density method is a powerful algorithmic framework which in recent years has given rise to the best-known approximations for a variety of problems, including Densest-$k$-Subgraph and Bipartite Small Set Vertex Expansion. These…

We study the idea of a composite Higgs in the framework of a five-dimensional AdS theory. We present the minimal model of the Higgs as a pseudo-Goldstone boson in which electroweak symmetry is broken dynamically via top loop effects, all…

Let $\mathbb{F}_{q}$ be a finite field of order $q$, where $q$ is an odd prime power. A quadratic subspace $(W,Q)$ of $(\mathbb{F}_{q}^{n},x_{1}^{2}+x_{2}^{2}+\cdots+x_{n}^{2})$ is called dot$_{k}$-subspace if $Q$ is isometrically…

Inspired by the classical fractional cascading technique, we introduce new techniques to speed up the following type of iterated search in 3D: The input is a graph $\mathbf{G}$ with bounded degree together with a set $H_v$ of 3D hyperplanes…