Related papers: Perpendicular dissections of space
Drawing parallels with hyperplane arrangements, we develop the theory of arrangements of submanifolds. Given a smooth, finite dimensional, real manifold $X$ we consider a finite collection $\mathcal{A}$ of locally flat, codimension-1…
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
Using the Semple bundle construction, we derive an intersection-theoretic formula for the number of simultaneous contacts of specified orders between members of a generic family of degree $d$ plane curves and finitely many fixed curves. The…
We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…
By using a combination of algebraic, geometric, and dynamical techniques, together with input from higher dimensional Diophantine approximation, we give a complete characterization of all linearly repetitive cut and project sets with…
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n…
Noncommutative geometry has seen remarkable applications for high energy physics, viz. the geometrical interpretation of the Standard Model. The question whether it also allows for supersymmetric theories has so far not been answered in a…
Given a real algebraic variety $X$ of dimension $n$, a very ample divisor $D$ on $X$ and a smooth closed hypersurface $\Sigma$ of $\mathbf{R}^n$, we construct real algebraic hypersurfaces in the linear system $|mD|$ whose real locus…
We study relations between reflections in (positive or negative) points in the complex hyperbolic plane. It is easy to see that the reflections in the points q_1,q_2 obtained from p_1,p_2 by moving p_1,p_2 along the geodesic generated by…
The Ham-Sandwich theorem is a well-known result in geometry. It states that any $d$ mass distributions in $\mathbb{R}^d$ can be simultaneously bisected by a hyperplane. The result is tight, that is, there are examples of $d+1$ mass…
In a recent paper by Cook, et al., which introduced the concept of unexpected plane curves, the focus was on understanding the geometry of the curves themselves. Here we expand the definition to hypersurfaces of any dimension and, using…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
We study the log-rank conjecture from the perspective of point-hyperplane incidence geometry. We formulate the following conjecture: Given a point set in $\mathbb{R}^d$ that is covered by constant-sized sets of parallel hyperplanes, there…
In repeated Measure Designs with multiple groups, the primary purpose is to compare different groups in various aspects. For several reasons, the number of measurements and therefore the dimension of the observation vectors can depend on…
We set out an elementary approach to derive Visible Point Identities summed on lattice points of inverted triangle (2D), pyramid (3D), hyperpyramid (4D, 5D and so on) utilizing the greatest common divisor for the nD Visible Point Vectors.…
We introduce the notion of a symmetric basis of a vector space equipped with a quadratic form, and provide a sufficient and necessary condition for the existence to such a basis. Symmetric bases are then used to study Cayley graphs of…
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two…
For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…