Related papers: Constructing Subspace Packings from Other Packings
Any space-filling packing of spheres can be cut by a plane to obtain a space-filling packing of disks. Here, we deal with space-filling packings generated using inversive geometry leading to exactly self-similar fractal packings. First, we…
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…
This review presents recent progress in understanding constraints and consequences of close-packing geometry of filamentous or columnar materials possessing non-trivial textures, focusing in particular on the common motifs of twisted and…
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…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
In this short note we survey theorems and provide conjectures on gluing constructions under lower curvature bounds in smooth and non-smooth context. Focusing on synthetic lower Ricci curvature bounds we consider Riemannian manifolds,…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
We consider estimating a random vector from its noisy projections onto low dimensional subspaces constituting a fusion frame. A fusion frame is a collection of subspaces, for which the sum of the projection operators onto the subspaces is…
We discuss some specializations of the frames of flat orthonormal frame bundles over geometries of indefinite signature, and the resulting symmetries of families of embedded Riemannian or pseudo-Riemannian geometries. The specializations…
We consider principal fibre bundles with a given connection and construct almost complex structures on the total space if the adjoint bundle is isomorphic to the tangent bundle of the base. We derive the integrability condition. If the…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
We study open equivariant projective embeddings of homogeneous spaces such that the complement of the open orbit does not contain divisors. Criterions of existence of such an embedding are considered and finiteness of isomorphism classes of…
One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…
One approach to ease the construction of frames is to first construct local components and then build a global frame from these. In this paper we will show that the study of the relation between a frame and its local components leads to the…
Protein structure is generally conceptualized as the global arrangement or of smaller, local motifs of helices, sheets, and loops. These regular, recurring secondary structural elements have well-understood and standardized definitions in…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
In this paper, we propose a topology optimization (TO) framework where the design is parameterized by a set of convex polygons. Extending feature mapping methods in TO, the representation allows for direct extraction of the geometry. In…
This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…