相关论文: Hyperplane mass partitions via relative equivarian…
G.W. Mackey's celebrated obstruction theory for projective representations of locally compact groups was remarkably generalized by J. M. G. Fell and R. S. Doran to the wide area of saturated Banach *-algebraic bundles. Analogous obstruction…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
Suppose that $n\neq p^k$ and $n\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\mathfrak S_n$ there exists an $\mathfrak S_n$-equivariant map $X \to…
We study the balanced $k$-way hypergraph partitioning problem, with a special focus on its practical applications to manycore scheduling. Given a hypergraph on $n$ nodes, our goal is to partition the node set into $k$ parts of size at most…
The famous Ham-Sandwich theorem states that any $d$ point sets in $\mathbb{R}^d$ can be simultaneously bisected by a single hyperplane. The $\alpha$-Ham-Sandwich theorem gives a sufficient condition for the existence of biased cuts, i.e.,…
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…
A significant group of problems coming from the realm of Combinatorial Geometry can only be approached through the use of Algebraic Topology. From the first such application to Kneser's problem in 1978 by Lov% \'{a}sz \cite{Lovasz} through…
The focus of this paper is on a thin obstacle problem where the obstacle is defined on the intersection between a hyper-plane $\Gamma$ in $\mathbb{R}^n$ and a periodic perforation $\mathcal{T}_\varepsilon$ of $\mathbb{R}^n$, depending on a…
The purpose of this paper is twofold. In the first part we concentrate on hyperplane sections of algebraic schemes, and present results for determining when Gr\"obner bases pass to the quotient and when they can be lifted. The main…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
In 1967, Gr\"unbaum conjectured that any $d$-dimensional polytope with $d+s\leq 2d$ vertices has at least \[\phi_k(d+s,d) = {d+1 \choose k+1 }+{d \choose k+1 }-{d+1-s \choose k+1 } \] $k$-faces. We prove this conjecture and also…
The Separating Hyperplane theorem is a fundamental result in Convex Geometry with myriad applications. Our first result, Random Separating Hyperplane Theorem (RSH), is a strengthening of this for polytopes. $\rsh$ asserts that if the…
The hyperplane and proper time formalisms are discussed mainly for the spin-half particles in the quantum case. A connection between these covariant Hamiltonian formalisms is established. It is showed that choosing the space-like…
We introduce a conjecture that we call the {\it Two Hyperplane Conjecture}, saying that an isoperimetric surface that divides a convex body in half by volume is trapped between parallel hyperplanes. The conjecture is motivated by an…
Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…
Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…
In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of groups according to some regulations, where the total…
The classic Ham-Sandwich theorem states that for any $d$ measurable sets in $\mathbb{R}^d$, there is a hyperplane that bisects them simultaneously. An extension by B\'ar\'any, Hubard, and Jer\'onimo [DCG 2008] states that if the sets are…
An {\em eight-partition} of a finite set of points (respectively, of a continuous mass distribution) in $\mathbb{R}^3$ consists of three planes that divide the space into $8$ octants, such that each open octant contains at most $1/8$ of the…
In this paper, we prove a result on the bisection of mass assignments by parallel hyperplanes on Euclidean vector bundles. Our methods consist of the development of a novel lifting method to define the configuration space--test map scheme,…