arXiv research

A new reinforcement learning method improves Max-Cut solutions without needing training data.

We show some characterizations of hyperspheres in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$ with intrinsic and extrinsic properties such as the $n$-dimensional area of the sections cut off by hyperplanes, the $(n+1)$-dimensional volume of regions between parallel hyperplanes, and the $n$-dimensional surf…

We study arrangements of $m$ hyperplanes in the $n$-dimensional real projective space, with a special focus on $m=n+3$ and $n=3$ or $n=4$.

We establish some characterizations of elliptic hyperboloids (resp., ellipsoids) in the $(n+1)$-dimensional Euclidean space ${\Bbb E}^{n+1}$, using the $n$-dimensional area of the sections cut off by hyperplanes and the $(n+1)$-dimensional volume of regions between parallel hyperplanes. We also give a few characterizat…

A fast, non-iterative method for missing value imputation using random trees.

The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks such as regression trees because extending the BSP-Tree process to a higher dim…

We compute the Heegaard-Floer link homology of algebraic links in terms of the multivariate Hilbert function of the corresponding plane curve singularities. The main result of the paper identifies four homologies: (a) the Heegaard-Floer link homology of the local embedded link of the germ, (b) the lattice homology asso…

New spaces at infinity identified for Minkowski spacetime.

Survey on hyperplane arrangements and their topology.

Segre varieties' hyperplane sections are unstable under certain conditions.

We extend the theoretical analysis of a recently proposed single subspace learning algorithm, called Dual Principal Component Pursuit (DPCP), to the case where the data are drawn from of a union of hyperplanes. To gain insight into the properties of the $\ell_1$ non-convex problem associated with DPCP, we develop a geo…

Horospheres, hyperspheres, and hyperplanes in hyperbolic spaces are rigid in terms of mean curvature.

The Lefschetz hyperplane section theorem asserts that an affine variety is homotopy equivalent to a space obtained from its generic hyperplane section by attaching some cells. The purpose of this paper is to describe attaching maps of these cells for the complement of a complex hyperplane arrangement defined over real …

We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.

We prove that the hyperplanes parallel to ${\bf e}_{n+1}$ are the unique examples of translating solitons $C^1-$asymptotic to two half-hyperplanes outside a vertical cylinder in $\R^{n+1}$.

We define several homology theories for central hyperplane arrangements, categorifying well-known polynomial invariants including the characteristic polynomial, Poincare polynomial, and Tutte polynomial. We consider basic algebraic properties of such chain complexes, including long-exact sequences associated to deletio…

A theorem divides hyperplanes evenly with a line through the origin.

We compute the cohomology with group ring coefficients of the complement of a finite collection of affine hyperplanes in a finite dimensional complex vector space. It is nonzero in exactly one degree, namely the degree equal to the rank of the hyperplane arrangement.

Two SVM frameworks are introduced for classification problems.

We examine the existence of tangent hyperplanes to subriemannian balls. Strictly abnormal shortest paths are allowed

In this paper we show that an immersed nontrivial translating soliton for mean curvature flow in $\mathbb{R}^{n+1}$($n=2,3)$ is a grim hyperplane if and only if it is mean convex and has weighted total extrinsic curvature of at most quadratic growth. For an embedded translating soliton $Σ$ with nonnegative scalar curva…

Study of first homology group of Milnor fiber boundary for generic hyperplane arrangements in C^3.

Study hyperplanes in abelian groups and their signatures for manifold identification.

Efficiently clusters large datasets using low-density hyperplanes.

We consider a twisted version of the Hurewicz map on the complement of a hyperplane arrangement. The purpose of this paper is to prove surjectivity of the twisted Hurewicz map under some genericity conditions. As a corollary, we also prove that a generic section of the complement of a hyperplane arrangement has non-tri…

We show that certain aspherical manifolds arising from hyperplane arrangements in negatively curved manifolds have relatively hyperbolic fundamental group.

The Sample Compression Conjecture of Littlestone & Warmuth has remained unsolved for over two decades. This paper presents a systematic geometric investigation of the compression of finite maximum concept classes. Simple arrangements of hyperplanes in Hyperbolic space, and Piecewise-Linear hyperplane arrangements, are …

In hyperbolic space, the angle of intersection and distance classify pairs of totally geodesic hyperplanes. A similar algebraic invariant classifies pairs of hyperplanes in the Einstein universe. In dimension 3, symplectic splittings of a 4-dimensional real symplectic vector space model Einstein hyperplanes and the inv…

In this article, we completely determine which log Fano hyperplane arrangements are uniformly K-stable, K-stable, K-polystable, K-semistable or not.

The paper proves a margin inequality for separating hyperplanes, useful for analyzing algorithmic bias.

Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We propose a novel hyperplane classifier for clustering and semi-supervised classificati…

Study Coxeter groups over fusion rings and their geometric realisations.

Upper bounds on fixed points in PWL neural networks with hyperplane analysis.

Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhe…

We use Morse theory to prove that the Lefschetz Hyperplane Theorem holds for compact smooth Deligne-Mumford stacks over the site of complex manifolds. For $Z \subset X$ a hyperplane section, $X$ can be obtained from $Z$ by a sequence of deformation retracts and attachments of high-dimensional finite disc quotients. We …

Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors a…

Paper proves a Cohen-Dimca-Orlik type theorem for Z-local systems of hyperplane arrangements.

Proves a limit on hyperplanes in complex manifolds.

Bordifications of hyperplane arrangements yield complexes with homotopy type of wedges of spheres.

We study torsion properties of the twisted Alexander modules of the affine complement $M$ of a complex essential hyperplane arrangement, as well as those of punctured stratified tubular neighborhoods of complex essential hyperplane arrangements. We investigate divisibility properties between the twisted Alexander polyn…

NeuralCut learns to select cutting planes by looking ahead, outperforming traditional methods.

The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to the complement of the hyperplanes in the central arrangement A_G normal to G. This…

Differentiable cutting-plane layers solve parametric mixed-integer linear optimization problems.

New geometric mechanism solves four envelope problems.

New method constructs asymptotic convex hypersurfaces via equidistant hyperplanes.

NeVI-Cut uses neural networks to efficiently propagate uncertainty without feedback.

We compute the l^2-Betti numbers of the complement of a finite collection of affine hyperplanes in complex space. At most one of the l^2-Betti numbers is non-zero.

Study proves minimality of certain hyperplane intersections in wide cones.