Paper solves degenerated circle pattern metric problem in spherical geometry.
problem Existence and rigidity of (degenerated) circle pattern metrics with prescribed total geodesic curvatures.
method Defined prescribed combinatorial Ricci flows and studied their convergence.
result First degenerated result for total geodesic curvatures in spherical background geometry.
Paper proves existence and uniqueness of circle patterns on surfaces with assigned geodesic curvatures.
problem Existence and uniqueness of circle patterns on surfaces with prescribed geodesic curvatures.
method Applied Perron's method and Thurston's algorithm to prove existence and convergence.
result Existence and uniqueness of circle patterns on surfaces with prescribed geodesic curvatures.
New patterns deform Farey triangulation in symmetric space.
problem Deforming Farey triangulation in symmetric space.
method Realized representations of modular group as isometry groups of geodesic patterns in SL3(R)/SO(3). result 2-parameter family of deformations of Farey triangulation.
Self-crossing geodesics on convex surfaces are studied.
problem Understanding patterns of geodesics crossing themselves.
method Analyzing closed geodesics on convex surfaces.
result Self-crossing geodesics exist on convex surfaces.
New method finds ideal circle patterns on spheres.
problem Finding ideal circle patterns on spheres with prescribed curvatures.
method Combinatorial Calabi flow in spherical geometry.
result Existence and convergence of the flow for ideal circle patterns.
Paper resolves spherical curvature flow problem.
problem Existence of ideal circle patterns in spherical background geometry.
method Introduces a combinatorial geodesic curvature flow in spherical background geometry.
result Characterizes sufficient and necessary conditions for flow convergence.
A major breakthrough in the theory of topological algorithms occurred in 1992 when Hyam Rubinstein introduced the idea of an almost normal surface. We explain how almost normal surfaces emerged naturally from the study of geodesics and minimal surfaces. Patterns of stable and unstable geodesics can be used to character…
Formula removes geometric patterns from random hyperbolic surfaces.
problem Conditioning on tangle-free surfaces to avoid rare geometric patterns.
method Developed a Moebius inversion formula to integrate tangle-free surfaces.
result Significantly reduces the number of local topological types of short geodesics.
Geodesic patterns, shears, and Anosov representations of the modular group.
problem Understanding representations of the modular group into Isom(X).
method Analyzing geodesic patterns, shears, and foliations.
result The Barbot component is homeomorphic to R^2 x [0,∞), with interior and boundary properties.
We say that a collection Gamma of geodesics in the hyperbolic plane H^2 is a modular pattern if Gamma is invariant under the modular group PSL_2(Z), if there are only finitely many PSL_2(Z)-equivalence classes of geodesics in Gamma, and if each geodesic in Gamma is stabilized by an infinite order subgroup of PSL_2(Z). …
Unique circle patterns on spheres found for spherical conical metrics.
problem Non-uniqueness in circle packing for spherical metrics.
method Prescribed geodesic total curvature instead of cone angles.
result Unique existence of circle patterns for spherical conical metrics.
We give new examples of closed smooth 4-manifolds which support singular metrics of nonpositive curvature, but no smooth ones, thereby answering affirmatively a question of Gromov. The obstruction comes from patterns of incompressible 2-tori sufficiently complicated to force branching of geodesics for nonpositively cur…
Study efficient geodesics in curve complex using dot graphs.
problem Characterize efficient geodesics in curve complexes.
method Introduced dot graphs to record intersection patterns and used them to prove existence and properties of efficient geodesics.
result The shape of dot graphs for efficient geodesics is contained within a spindle shape region, controlling curve coordinates.
Study infinite combinatorial Ricci flow on spherical surfaces.
problem Investigate infinite combinatorial Ricci flow with spherical background.
method Establish existence and convergence of solution for infinite cellular decompositions.
result Existence and convergence of solution for infinite combinatorial Ricci flow in spherical geometry.
This paper restricts efficient geodesics to non-separating curves.
problem Finding efficient geodesics in the complex of curves.
method Analysis of the dot graph and surgeries.
result Efficient geodesics can be restricted to the non-separating curve complex.
We consider remodeling the planar search patterns, in the presence of the river-type perturbation represented by the weak vector field, basing on the time-optimal paths as Finslerian solutions to the Zermelo navigation problem via Randers metric.
Classifies 3-braids from choreographic motions on Lissajous curves, linking them to mapping classes and geodesics.
problem Classifying 3-braids from choreographic motions on Lissajous curves.
method Parametrization in terms of levels and slopes, using dilatation and geodesic cutting sequences.
result Dilatation of pseudo-Anosov mapping classes increases with level or slope.
We show that a natural class of twistorial maps gives a pattern for apparently different geometric maps, such as, (1,1)-geodesic immersions from (1,2)-symplectic almost Hermitian manifolds and pseudo horizontally conformal submersions with totally geodesic fibres for which the associated almost CR-structure is inte…
The paper studies bifurcations in Lagrangian systems and geodesics.
problem Investigating bifurcations in Lagrangian systems with various boundary conditions.
method Using Morse theory and nullity techniques, the paper establishes conditions for bifurcation in three configurations.
result Unified Morse-theoretic framework connecting geometric focal structure and analytic bifurcation behavior.
New method calculates geodesic distances in Gaussian random field manifolds.
problem Quantifying similarity between random fields in different regimes.
method Numerical method using geodesic distances in Gaussian random field manifolds.
result Estimation of geodesic distances for various initial conditions.
New approach to nematic fields on surfaces, relaxing uniformity to quasi-uniformity.
problem Identifying least distorted nematic fields on generic surfaces.
method Relaxing the notion of uniformity into quasi-uniformity and proving parallel transport by geodesics.
result All quasi-uniform fields are parallel transported by the geodesics of the surface.
Using geodesic currents, we provide a theoretical justification for some of the experimental results regarding the behavior of Whitehead's algorithm on non-minimal inputs, that were obtained by Haralick, Miasnikov and Myasnikov via pattern recognition methods. In particular we prove that the images of "random" elements…
We study the rigidity of polyhedral surfaces using variational principle. The action functionals are derived from the cosine laws. The main focus of this paper is on the cosine law for a non-triangular region bounded by three possibly disjoint geodesics. Several of these cosine laws were first discovered and used by Fe…
The study characterizes slopes for hyperbolic knots and Whitehead doubles.
problem Identifying characterizing slopes for hyperbolic knots and Whitehead doubles.
method Combining JSJ decompositions, geodesic lengths, and volume inequalities.
result Explicit conditions for characterizing slopes and examples of non-characterizing slopes.
A new numerical framework simplifies elastic surface matching and comparison.
problem Challenging problem in surface comparison and matching in computer vision.
method Relaxing the geodesic boundary constraint using a varifold fidelity metric.
result Flexibility to deal with arbitrary topologies and sampling patterns, scalability to large meshes.
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the construction is sufficiently regular and uniform, then the notions of metric, geodesic and…
The study investigates how branch points affect the shape and mechanics of hyperbolic surfaces.
problem Understanding the role of branch points in the shape and mechanics of hyperbolic surfaces.
method Developed a discrete differential geometric (DDG) approach to study deformations of hyperbolic objects with distributed branch points.
result Branch points influence the overall morphology of hyperbolic surfaces without concentrating energy, leading to sub-exponential growth in maximum curvature.
Learning a distance function or metric on a given data manifold is of great importance in machine learning and pattern recognition. Many of the previous works first embed the manifold to Euclidean space and then learn the distance function. However, such a scheme might not faithfully preserve the distance function if t…
Safe Pattern Pruning reduces pattern explosion in predictive pattern mining.
problem Exponential growth of patterns in structured data.
method Safe Pattern Pruning (SPP) method.
result Effective model building in practical data analysis.
Paper analyzes shapes of brain arterial networks using statistical methods.
problem Quantifying and comparing shapes of brain arterial networks.
method Mathematical representation of BAN shapes as elastic shape graphs, development of Riemannian metrics and geometrical tools.
result Age has a clear, quantifiable effect on BAN shapes, with increased variance in shapes as age increases.
BN^2MF identifies unknown exposure patterns in environmental mixtures.
problem Identifying unknown exposure patterns in environmental mixtures.
method Bayesian non-parametric non-negative matrix factorization (BN^2MF) with non-negative continuous priors and a non-parametric sparse prior.
result Estimates patterns of chemical exposures without specifying the number of patterns.
SFM matches flows on statistical manifolds for better discrete generation.
problem Discrete generation on statistical manifolds with strong prior assumptions.
method Statistical Flow Matching (SFM) on manifold of categorical distributions using Fisher information metric.
result SFM achieves higher sampling quality and likelihood than other models.
RestoreAI predicts landmine risk from patterns, improving clearance efficiency.
problem Predicting landmine risk from spatial patterns to enhance clearance efficiency.
method RestoreAI uses landmine patterns for risk prediction, implementing three deminers: linear, curved, and Bayesian.
result RestoreAI significantly boosts clearance efficiency, achieving a 14.37 percentage point increase in cleared landmines per timestep.
Study of knots with generalized Mazur patterns and their invariants.
problem Understanding the invariants and properties of knots with generalized Mazur patterns.
method Computational analysis of τ and ε invariants for n-twisted satellites. result None of the n-twisted patterns from the family act surjectively on the smooth or rational concordance group. We exhibit the first examples of compact orientable hyperbolic manifolds that do not have any spin structure. We show that such manifolds exist in all dimensions n≥4. The core of the argument is the construction of a compact orientable hyperbolic 4-manifold M that contains a surface S of genus 3 with sel…
Two approaches detect EV charging patterns at stations.
problem Identify charging patterns at electric vehicle charging stations.
method Two approaches: rule-based and hierarchical clustering.
result Hierarchical clustering revealed unexpected charging patterns.
Universal learning machine is a theory trying to study machine learning from mathematical point of view. The outside world is reflected inside an universal learning machine according to pattern of incoming data. This is subjective pattern of learning machine. In [2,4], we discussed subjective spatial pattern, and estab…
Study of combinatorial Calabi flow on ideal circle patterns.
problem Finding ideal circle patterns with prescribed curvatures.
method Combinatorial Calabi flow in hyperbolic and Euclidean geometry.
result Flow converges exponentially to ideal circle patterns.
Proves existence of circle patterns on surfaces with cusps.
problem Existence of circle patterns with prescribed angles on surfaces with cusps.
method Introduced combinatorial Ricci and Calabi flows to prove longtime existence and convergence.
result Existence of generalized circle patterns with prescribed angles on surfaces with cusps.
CDPA identifies common and distinctive patterns in high-dimensional datasets.
problem Existing methods fail to capture the common pattern between coefficient matrices of shared latent factors.
method Proposes CDPA, an unsupervised learning method that incorporates both common and distinctive patterns of coefficient matrices.
result CDPA provides better characterization of common and distinctive patterns in high-dimensional datasets.
Study circle patterns on tori, linking symplectic forms and homeomorphisms.
problem Understanding circle patterns on tori and their symplectic properties.
method Investigates the space of circle patterns on closed tori with complex projective structures, embedding it into Teichmüller spaces and analyzing symplectic forms.
result Non-degeneracy of the pulled-back Weil-Petersson symplectic form and homeomorphism between circle patterns and Teichmüller spaces.
FSR efficiently discovers significant patterns with few resampled datasets.
problem Mining significant patterns in transactional data, especially subgroups.
method FSR uses resampling to bound the supremum deviation of quality statistics, providing rigorous guarantees on false discoveries.
result FSR effectively discovers significant subgroups with a small number of resampled datasets.
In this paper we study predictive pattern mining problems where the goal is to construct a predictive model based on a subset of predictive patterns in the database. Our main contribution is to introduce a novel method called safe pattern pruning (SPP) for a class of predictive pattern mining problems. The SPP method a…
TFPS improves time series forecasting by learning pattern-specific experts.
problem Challenges in forecasting time series data with varying patterns across segments.
method Dual-domain encoder, subspace clustering, pattern-specific experts.
result Significantly improved forecasting accuracy, especially in long-term forecasting.
Pattern sampling has been proposed as a potential solution to the infamous pattern explosion. Instead of enumerating all patterns that satisfy the constraints, individual patterns are sampled proportional to a given quality measure. Several sampling algorithms have been proposed, but each of them has its limitations wh…
While Multiple Instance (MI) data are point patterns -- sets or multi-sets of unordered points -- appropriate statistical point pattern models have not been used in MI learning. This article proposes a framework for model-based MI learning using point process theory. Likelihood functions for point pattern data derived …
The paper integrates statistical significance and discriminative power in pattern discovery.
problem Discovering actionable patterns that meet rigorous statistical significance and discriminative power criteria.
method Integrates statistical significance and discriminative power criteria into state-of-the-art algorithms.
result Improves discriminative power and statistical significance of discovered patterns without quality deterioration.
Paper extends circle pattern theory to obtuse angles.
problem Circle patterns with obtuse angles not previously covered.
method Using topological degree theory, extends Koebe-Andreev-Thurston Theorem.
result Generalized Andreev's Theorem for obtuse dihedral angles.