The paper explores uniform perfectness and centers in Morse boundaries.
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.
Trend · papers per month
Constructs constant spacetime mean curvature surfaces for hyperboloidal initial data sets.
Unmanned Aerial Vehicles (UAVs), autonomously-guided aircraft, are widely used for tasks involving surveillance and reconnaissance. A version of the pursuit-evasion problems centered around UAVs and its variants has been extensively studied in recent years due to numerous breakthroughs in AI. We present an approach to …
This paper exhausts curve complexes on non-orientable surfaces.
Probabilistic model for exhaustion in infinite-genus curve complexes.
grangersearch tests causal relationships in time series data.
Let be a compact, connected, nonorientable surface of genus with boundary components. Let be the curve complex of . We prove that if or , then there is an exhaustion of by a sequence of finite rigid sets. This improves the author's result on…
Let be a connected orientable surface of finite topological type. We prove that there is an exhaustion of the curve complex by a sequence of finite rigid sets.
Researchers solved a model of an exhaustible resource with stochastic discoveries.
We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By co…
In this note, we prove an existence result on exhaustion functions adapting the method by L.-F. Tam. Then we apply it to prove short-time existence of Ricci flow and study Yau's uniformization conjecture using similar method as Fei He and Lee-Tam.
Solves action selection for large spaces in RL, achieving near-optimal performance.
State-of-the-art named entity recognition (NER) systems have been improving continuously using neural architectures over the past several years. However, many tasks including NER require large sets of annotated data to achieve such performance. In particular, we focus on NER from clinical notes, which is one of the mos…
We prove that if a smoothly bounded strongly pseudoconvex domain , , admits at least one Monge-Ampère exhaustion smooth up to the boundary (i.e. a plurisubharmonic exhaustion , which is at all points except possibly at the unique minimum poi…
Let be a compact, connected, nonorientable surface of genus with boundary components. Let be the curve complex of . We prove that if and , then there is an exhaustion of by a sequence of finite superrigid sets.
Proposes a taxonomy for economic policies.
The paper studies Kähler metrics from finite Monge-Ampère mass exhaustion functions.
We consider three fundamental classes of compact almost homogeneous manifolds and show that the complements of singular complex orbits in such manifolds are endowed with plurisubharmonic exhaustions satisfying complex homogeneous Monge-Ampère equations. This extends to a new family of mixed type examples various classi…
The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2. Here we show that even M_C exhibits the complexity known for general Morse-Smale f…
Regularity properties of intrinsic objects for a large class of Stein Manifolds, namely of Monge-Ampère exhaustions and Kobayashi distance, is interpreted in terms of modular data. The results lead to a construction of an infinite dimensional family of convex domains with squared Kobayashi distance of prescribed regula…
In this paper, aimed at exploring the fundamental properties of isoperimetric region in -manifold which is asymptotic to Anti-de Sitter-Schwarzschild manifold with scalar curvature , we prove that connected isoperimetric region with cannot slide off to …
By a theorem of Greene and Wu, a noncompact connected Riemannian manifold admits a smooth strictly subharmonic exhaustion function. Demailly provided an elementary proof of this fact. A further simplification of Demailly's proof and some (mostly known) applications are described. Applications include the fact that the …
Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.
For an orientable surface of finite topological type with genus , we construct a finite set of curves whose union of iterated rigid expansions is the curve graph of . The set constructed, and the method of rigid expansion, are closely related to Aramayona and Leiniger's finite rigid set, and in fact a …
Non-exhaustive learning (NEL) is an emerging machine-learning paradigm designed to confront the challenge of non-stationary environments characterized by anon-exhaustive training sets lacking full information about the available classes.Unlike traditional supervised learning that relies on fixed models, NEL utilizes se…
In this paper, we prove that the L^2 Betti numbers of an amenable covering space can be approximated by the average Betti numbers of a regular exhaustion, under some hypotheses. We also prove that some L^2 spectral invariants can be approximated by the corresponding average spectral invariants of a regular exhaustion. …
Generalizes Nakano-positivity to Hilbert space fields.
Center identified in stated skein algebra for quantum traces.
A compact real analytic Riemannian manifold M admits a canonical complexification with plurisubharmonic exhaustion function satisfying the homogeneous complex Monge-Ampere equation, called a Grauert tube. From the point of view of complex analysis, several authors have considered whether a given complex manifold can ar…
The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…
A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected sub-polyhedra. We show that this condition is almost-equivalent to Brick's qsf propert…
Refines geometric center of mass analysis for Einstein field equations.
Constructs uniformly positive scalar curvature metrics on open manifolds
In this paper we study the Sasakian geometry on S^3-bundles over a Riemann surface of genus g>0 with emphasis on extremal Sasaki metrics. We prove the existence of a countably infinite number of inequivalent contact structures on the total space of such bundles that admit 2-dimensional Sasaki cones each with a Sasaki m…
We generalize A. Borbély's condition for the conclusion of the Omori-Yau maximum principle for the Laplace operator on a complete Riemannian manifold to a second-order linear semi-elliptic operator with bounded coefficients and no zeroth order term. Also, we consider a new sufficient condition for the existence of …
Let f:M->M be a partially hyperbolic diffeomorphism such that all of its center leaves are compact. We prove that Sullivan's example of a circle foliation that has arbitrary long leaves cannot be the center foliation of f. This is proved by thorough study of the accessible boundaries of the center-stable and the center…
We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…
Following a purely algebraic procedure, we provide an exhaustive classification of local Weyl-invariant scalar densities in dimension D=8.
Outlier based Robust Principal Component Analysis (RPCA) requires centering of the non-outliers. We show a "bias trick" that automatically centers these non-outliers. Using this bias trick we obtain the first RPCA algorithm that is optimal with respect to centering.
We prove the existence of a center, or continuous selection of a point, in the relative interior of embedded -disks in Riemannian -manifolds. If the center can be made equivariant with respect to the isometries of the manifold, and under mild assumptions the same holds for . By contrast, for…
This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …
The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.
In this study, we investigate the locus of the centers of the Meusnier spheres. Just as focal curve is the locus of the centers of the osculating spheres, we investigate the geometrical interpretation on the locus of the centers of the Meusnier spheres. We proved that if the curve is a principal line, the locus of the …
This article briefly introduced Arthur and Vassilvitshii's work on \textbf{k-means++} algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in…
Interactive framework improves understanding of deep neural networks.
Pattern sampling reduces time series classification complexity.
This paper improves image super-resolution by integrating cross-scale non-local attention.
The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first consider the similarity of elements in the data as the connectivity of nodes in an…