Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

4679341,4001,867 · Jun 202019922001200920172026
48 results for domains bounded by hyperplanes

Study stable capillary hypersurfaces with planar boundaries in half-spaces and domains.

problem Characterize stable capillary hypersurfaces with planar boundaries in bounded domains.
method Analyzes hypersurfaces in half-spaces and domains bounded by hyperplanes, proving conditions for stability and shape.
result Stable hypersurfaces in certain domains are spherical caps or pieces of spheres.

New method constructs asymptotic convex hypersurfaces via equidistant hyperplanes.

problem Constructing asymptotic convex hypersurfaces in hyperbolic space.
method Approximating hypersurface by geodesic graphs over equidistant hyperplanes.
result Existence of complete, strictly locally convex hypersurfaces with prescribed asymptotic boundary.

Simple proof that stable minimal hypersurfaces in R^4 are hyperplanes.

problem Proving stable minimal hypersurfaces in R^4 are hyperplanes.
method Using spectral Ricci curvature bounds and Green kernel estimates.
result Complete, two-sided stable minimal hypersurfaces in R^4 are hyperplanes.

The paper defines Dirichlet domains for Anosov subgroups in Lie groups.

problem Finding finite-sided Dirichlet domains for Anosov subgroups in Lie groups.
method Introducing a sufficient condition for finite-sided Dirichlet domains in semisimple Lie groups for polyhedral Finsler metrics.
result Finitely generated subgroups of semisimple Lie groups can have finite-sided Dirichlet domains under certain conditions.

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

problem Max-Cut problem is NP-hard, and existing methods struggle with generalizability and scalability.
method Training-data-free reinforcement learning approach to hyperplane rounding for Max-Cut optimization.
result Our method consistently achieves better Max-Cut solutions across various graph types.

For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain.

2000-04-01abs ↗pdf ↗

The projection of a compact oriented submanifold M^{n-1} in R^{n+1} on a hyperplane P^{n} can fail to bound any region in P. We call this ``projecting to zero.'' Example: The equatorial S^1 in S^2 projects to zero in any plane containing the x_3-axis. Using currents to make this precise, we show: A lipschitz (homology)…

2002-09-18abs ↗pdf ↗

Grauert constructs complete Kähler metrics on complements of complex analytic sets.

problem Characterizing domains of holomorphy through complete Kähler metrics.
method Computing holomorphic sectional curvatures of metrics on specific domains.
result The metrics exhibit different behaviors on the punctured plane compared to other cases.

The paper establishes a Miyaoka-Yau type inequality for hyperplane arrangements in complex projective space.

problem Finding a lower bound for the total sum of multiplicities of codimension 2 intersection subspaces of a hyperplane arrangement.
method Using a quadratic form defined by the intersection poset of the hyperplane arrangement, and applying the Bogomolov-Gieseker inequality for parabolic bundles.
result The inequality Q(a,,a)0Q(a, \ldots, a) \leq 0 gives a lower bound for the total sum of multiplicities of codimension 2 intersection subspaces of the hyperplane arrangement, with equality conditions provided.

We consider an entire graph SS in RN+1\mathbb R^{N+1} of a continuous real function ff over RN\mathbb R^{N} with N1N\ge 1. Let ΩΩ be an unbounded domain in RN+1\mathbb R^{N+1} with boundary SS. Consider nonlinear diffusion equations of the form tU=Δφ(U)\partial_t U= Δφ(U) containing the heat equation. Let UU be the solution…

2012-02-16abs ↗pdf ↗

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

problem Analyzing the implicit bias of algorithms in machine learning.
method Proves a nonsmooth Kurdyka-Lojasiewicz inequality for margin function.
result The bias of algorithm iterates converges at least as fast as the square-root of the margin convergence rate.

The paper revisits Markowitz's pseudodistance on pseudo-Riemannian manifolds.

problem Characterizing and classifying pseudo-Riemannian manifolds using Markowitz's pseudodistance.
method Review and extension of Markowitz's construction of pseudodistance on pseudo-Riemannian manifolds, with examples and classifications.
result Classification of quasi-homogeneous domains in the Einstein-de Sitter space.

Let A\mathcal{A} be a central hyperplane arrangement in Cn+1\mathbb{C}^{n+1} and Hi,i=1,2,...,dH_i,i=1,2,...,d be the defining equations of the hyperplanes of A\mathcal{A}. Let f=iHif=\prod_i H_i. There is a global Milnor fibration FCn+1AfC,F\hookrightarrow \mathbb{C}^{n+1} \setminus \mathcal{A} \xrightarrow{f} \mathbb{C}^*, where FF is ca…

2015-10-13abs ↗pdf ↗

Let ΣΣ be a compact immersed stable capillary hypersurface in a wedge bounded by two hyperplanes in Rn+1\mathbb R^{n+1}. Suppose that ΣΣ meets those two hyperplanes in constant contact angles and is disjoint from the edge of the wedge. It is proved that if Σ\partial Σ is embedded for n=2n=2, or if Σ\partialΣ is convex…

2014-05-21abs ↗pdf ↗

Self-shrinkers are hypersurfaces that shrink homothetically under mean curvature flow; these solitons model the singularities of the flow. It it presently known that an entire self-shrinking graph must be a hyperplane. In this paper we show that the hyperplane is rigid in an even stronger sense, namely: For $2 \leq n \…

2015-10-20abs ↗pdf ↗

The paper introduces explainable kk-means with axis-parallel hyperplanes for dd-dimensional data.

problem Creating explainable clustering with axis-parallel hyperplanes for complex data.
method An efficient algorithm that finds an explainable clustering with a near-optimal cost function.
result The algorithm achieves a near-optimal kk-means cost of k12/dpolylog(k)k^{1 - 2/d}\,\mathrm{polylog}(k) for dd-dimensional data.

Segre varieties' hyperplane sections are unstable under certain conditions.

problem Stability of hyperplane sections of Segre varieties under different conditions.
method Proving instability with respect to any polarization for non-smooth or meqnm eq n cases.
result Normal hyperplane sections of Segre varieties are K-unstable under specified conditions.

The paper generalizes a rigidity theorem for hypersurfaces with constant weighted mean curvature.

problem Classifying hypersurfaces with constant weighted mean curvature.
method Using polynomial volume growth and specific curvature conditions, the authors prove rigidity theorems.
result Hypersurfaces with constant weighted mean curvature must be either a hyperplane or a generalized cylinder under certain conditions.

A translating soliton is a hypersurface MM in Rn+1\mathbb{R}^{n+1} such that the family Mt=Mten+1M_t= M- t \,\mathbf{e}_{n+1} is a mean curvature flow, i.e., such that normal component of the velocity at each point is equal to the mean curvature at that point H=en+1.\mathbf{H}=\mathbf{e}_{n+1}^{\perp}. In this paper we obtain a cha…

2018-02-23abs ↗pdf ↗

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 1\ell_1 non-convex problem associated with DPCP, we develop a geo…

2017-06-06abs ↗pdf ↗

Crowdsourcing is an effective tool for human-powered computation on many tasks challenging for computers. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectation) of hyperplane binary labeling rules under the Dawid-Skene crowdsourcing model. The bounds can be appl…

2013-07-10abs ↗pdf ↗

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 …

2005-07-15abs ↗pdf ↗

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…

2012-05-12abs ↗pdf ↗

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

2012-08-27abs ↗pdf ↗

This paper explores how enforcing equivariance constraints limits neural network expressivity and proposes compensatory model size increases.

problem The impact of enforcing equivariance constraints on the expressive power of neural networks.
method Examined 2-layer ReLU networks, analyzed boundary hyperplanes and channel vectors, and constructed upper bounds on model size required for compensation.
result Enforcing equivariance constraints reduces the expressive power of neural networks, but this can be compensated by increasing model size.

A celebrated conjecture due to De Giorgi states that any bounded solution of the equation Δu+(1u2)u=0inRNΔu + (1-u^2) u = 0 \hbox{in} \R^N with $\pp_{y_N}u >0$ must be such that its level sets $\{u=\la\}$ are all hyperplanes, {\em \bf at least} for dimension N8N\le 8. A counterexample for N9N\ge 9 has long been believed to exist. …

2008-06-19abs ↗pdf ↗

In this paper we show that an immersed nontrivial translating soliton for mean curvature flow in Rn+1\mathbb{R}^{n+1}(n=2,3)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…

2016-09-28abs ↗pdf ↗

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

problem Computing the first homology group of the Milnor fiber boundary for generic hyperplane arrangements.
method Analyzing the Milnor fiber boundary for hyperplane arrangements in C^3.
result Affirmative answer to the conjecture of Suciu and example of arrangements with non-trivial torsion.

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

problem Identifying manifolds based on their homology groups and coordinate hyperplanes.
method Investigates isomorphisms preserving coordinate hyperplanes in products of cyclic groups.
result Recovering coordinate hyperplanes from their union and applying to manifold identification.