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.
Thurston's Circle Pattern Theorem studies existence and rigidity of circle patterns of a given combinatorial type and the given non-obtuse exterior intersection angles. Using topological degree theory, variational principle, Teichmuller theory, and Sard's Theorem, this paper generalizes Circle Pattern Theorem to the ca…
Alternating knots follow a pattern theorem, making them rarer than previously thought.
problem Understanding the scarcity of alternating knots.
method Developed a pattern theorem for alternating knots and used it to prove a conjecture about their rarity.
result Alternating knots are rarer than previously believed.
Paper generalizes Andreev's theorem with obtuse angles.
problem Characterizing hyperbolic polyhedra with obtuse angles.
method Established discrete analog of weak solution/regularity theory.
result Generalized Andreev's Theorem to include obtuse angles.
Paper proves how to deform circle patterns with interstices.
problem Deforming circle patterns with interstices.
method Combining combinatorial type, exterior angles, and conformal structures.
result Complete description of circle patterns with interstices.
New proof of graph covering theorem for graphs with fins.
problem Graph covering theorem for graphs with fins.
method New proof using Haar measure.
result Pattern rigidity for free groups with line patterns.
Extends circle pattern theorem to quasi-simplicial triangulations.
problem Characterize circle patterns on quasi-simplicial triangulated surfaces.
method Use finite covering technique to reduce problem to simplicial case, prove characterization by KAT inequalities.
result Curvature image is characterized by KAT inequalities.
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.
In this paper we give two different proofs of Bobenko and Springborn's theorem of circle pattern: there exists a hyperbolic (or Euclidean) circle pattern with proscribed intersection angles and cone angles on a cellular decomposed surface up to isometry (or similarity).
The paper studies circle patterns on surfaces with specific angles and curvature maps.
problem Investigating circle patterns with obtuse angles on surfaces of finite type.
method Characterizing curvature maps and establishing combinatorial Ricci flow conditions.
result Generalizations of circle pattern theorem and a computational method to find patterns.
Graph CNN method improves classification of irregular spatial data like building patterns.
problem Challenges in analyzing irregular spatial data with machine learning.
method Graph Fourier transform and convolution theorem to convert irregular spatial data into a learnable format.
result Significantly improved classification of building patterns compared to other methods.
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.
A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for a given (topological) cell decomposition and given intersection angles of the ci…
A ``hyperideal circle pattern'' in S2 is a finite family of oriented circles, similar to the ``usual'' circle patterns but such that the closed disks bounded by the circles do not cover the whole sphere. Hyperideal circle patterns are directly related to hyperideal hyperbolic polyhedra, and also to circle packings. …
In this paper we initiate a study of the topological group PPQI(G,H) of pattern-preserving quasi-isometries for G a hyperbolic Poincare duality group and H an infinite quasiconvex subgroup of infinite index in G. Suppose ∂G admits a visual metric d with dimH<dimt+2, where dimH is the Hausd…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral surfaces with non-positive curvature. We show that in the case of such surfaces discr…
We prove existence and uniqueness results for patterns of circles with prescribed intersection angles in constant curvature surfaces. Our method is based on two new functionals--one for the Euclidean and one for the hyperbolic case. We show how Colin de Verdi`ere's, Br"agger's and Rivin's functionals can be derived fro…
New method embeds time span into self-attention for better temporal pattern recognition.
problem Capturing temporal patterns in event sequences without recurrent networks.
method Functional time representation learning with Bochner's and Mercer's Theorems.
result Proposed methods outperform baseline models in various continuous-time event sequence prediction tasks.
This paper is the third in a series that researches the Morse Theory, gradient flows, concavity and complexity on smooth compact manifolds with boundary. Employing the local analytic models from \cite{K2}, for \emph{traversally generic flows} on (n+1)-manifolds X, we embark on a detailed and somewhat tedious study …
Slipknots found in random diagrams almost always.
problem The presence of slipknots in random diagrams.
method Developed knotoid diagrams to study slipknots in knot diagrams.
result Almost all knot diagrams are slipknotted.
Uniform diameter bound for reflection group disk patterns.
problem Uniform bounded diameter conjecture for reflection groups.
method Skinning map analysis and discrete extremal width on Coxeter graph.
result Diameter of skinning image is bounded by a constant.
The study computes invariants of satellite knots using bordered Floer homology.
problem Computing invariants of satellite knots with specific patterns.
method Using bordered Floer homology and the immersed curve interpretation of the bordered pairing theorem.
result Satellites with thin fibered companions or specific patterns have thin knot Floer homology.
AI aids in mathematics research and problem-solving.
problem Complex mathematical problems and discoveries.
method Explains AI principles and diverse applications in math.
result AI assists in discovering patterns, proving theorems, and challenging conjectures.
We consider and extend the adversarial agent-based learning approach of Gy{ö}rfi {\it et al} to the situation of zero-cost portfolio selection implemented with a quadratic approximation derived from the mutual fund separation theorems. The algorithm is applied to daily sampled sequential Open-High-Low-Close data and se…
In this paper a new connection between the discrete conformal geometry problem of disk pattern construction and the continuous conformal geometry problem of metric uniformization is presented. In a nutshell, we discuss how to construct disk patterns by optimizing an objective function, which turns out to be intimately …
Random Intersection Chains selects important interactions from categorical features.
problem Heavy computational burden in considering all interactions for categorical features.
method Randomly generates chains of intersections, estimates and selects frequent patterns.
result Selected patterns are the most frequent in the data set.
We study the property of the Fused Lasso Signal Approximator (FLSA) for estimating a blocky signal sequence with additive noise. We transform the FLSA to an ordinary Lasso problem. By studying the property of the design matrix in the transformed Lasso problem, we find that the irrepresentable condition might not hold, …
New criteria for ideal circle patterns on surfaces.
problem Determining when a surface supports ideal circle patterns.
method Introducing a character L(D,Φ) and using combinatorial Ricci flows. result Simpler and more easily verifiable criteria for ideal circle patterns.
Satellite formula connects knot concordance invariants to surgery.
problem Understanding knot concordance invariants.
method Excision theorem for real Floer homotopy types.
result Concordance invariants depend only on zero-framed surgery.
This paper solves nonparametric estimation of continuous DPPs using kernel methods.
problem Estimating continuous Determinantal Point Processes (DPPs) without assuming a parametric form.
method Developed a fixed point algorithm based on a representer theorem for nonnegative functions in RKHS.
result Demonstrated a finite-dimensional problem for nonparametric MLE of continuous DPPs.
The paper proves rigidity and uniformization theorems for infinite circle patterns and convex polyhedra in hyperbolic 3-space.
problem Characterize infinite circle patterns and convex polyhedra in hyperbolic 3-space.
method Extends techniques from previous work to prove rigidity and uniformization theorems for infinite circle patterns and convex polyhedra.
result Establishes existence and rigidity of infinite regular circle patterns and convex trivalent polyhedra.
It is often hypothesized that a crucial role for recurrent connections in the brain is to constrain the set of possible response patterns, thereby shaping the neural code. This implies the existence of neural codes that cannot arise solely from feedforward processing. We set out to find such codes in the context of one…
Plane triangulations remain rigid under discrete conformal changes.
problem Rigidity of acute triangulations under discrete conformal changes.
method Maximum principles, discrete Liouville theorem, extremal lengths, Euclidean to hyperbolic discrete conformality.
result Uniformly acute triangulations are rigid under Luo's discrete conformal change.
A 1-parameter family of Steiner chains has constant curvature moments.
problem Characterize the curvature moments of a 1-parameter family of Steiner chains.
method Proved constant curvature moments for k=3 using Descartes Circle Theorem; extended to spherical and hyperbolic geometries.
result First k-1 moments of curvatures remain constant in a 1-parameter family of Steiner chains.
Diversity or complementarity of experts in ensemble pattern recognition and information processing systems is widely-observed by researchers to be crucial for achieving performance improvement upon fusion. Understanding this link between ensemble diversity and fusion performance is thus an important research question. …
A new PCA method for analyzing point processes.
problem Analyzing variability in replicated point processes.
method Functional Principal Component Analysis (fPCA) on cumulative mass functions.
result Established convergence and introduced principal measures.
Proof of Knot Entropy Conjecture for tube lattice polygons.
problem Proving exponential growth rate of knot polygons equals unknot polygons.
method Upper and lower bounds on polygon counts, braid insertions, and pattern theorems.
result Established the Knot Entropy Conjecture for tube lattice polygons.
New Y-systems for Miquel dynamics are Möbius invariant.
problem Miquel dynamics circle centers are not Möbius invariant.
method Introduced new Y-systems involving only intersection points.
result New Y-systems are Möbius invariant and satisfy the transformation group principle.
In this thesis a connection between the worlds of discrete and continuous conformal geometry is explored. Specifically, a disk pattern production theroem is proved using an energy which measures how ``uniform'' the angle data of a triangulation is, see also math.DG/0002150. Then this energy is averaged over all the Del…
The paper develops finite knot theory using ropelength-filtered Reidemeister graphs.
problem Understanding knot types in bounded ropelength sublevel spaces.
method Study thick representatives in bounded ropelength sublevel spaces through lifted Reidemeister graphs.
result Define characteristic Reidemeister patterns and finite recognition length.
Equivariant cohomology simplifies symplectic manifold integrals with group actions.
problem Complex integrals on symplectic manifolds with Lie group actions.
method Atiyah-Bott Localization Theorem
result Simplifies integrals by revealing hidden structure.
Characterizes infinite ideal polyhedra in hyperbolic 3-space and proves their existence and rigidity.
problem Characterize infinite ideal polyhedra in hyperbolic 3-space.
method Study ideal circle patterns (ICPs) and develop a uniform Ring Lemma via pointed Gromov-Hausdorff convergence.
result Establish existence and rigidity of embedded ICPs and infinite ideal polyhedra (IIP).
Discrete conformal maps on surfaces with vertex decorations are studied.
problem Discrete conformal equivalence for decorated piecewise Euclidean surfaces.
method Intimate relationship between decorated PE-surfaces, canonical tessellations of hyperbolic surfaces, and convex hyperbolic polyhedra; concave variational principle.
result Proof of discrete uniformization theorem for decorated PE-surfaces.
The paper extends algebraic expression for subjective spatial patterns to include temporal patterns.
problem Studying subjective spatial and temporal patterns in machine learning.
method Develops X-form for algebraic expression of subjective spatial patterns and extends it to temporal patterns.
result Established algebraic expressions for both spatial and temporal patterns.
The study identifies unique fluid flow patterns.
problem Understanding incompressible fluid flows with straight streamlines.
method Local differential geometry of line congruences to integrate Euler equations.
result Only specific fluid flows are possible with straight streamlines.
Thin position for knots in the 3-sphere was introduced by Gabai and has been used in a variety of contexts. We conjecture an analogue to a theorem of Schubert and Schultens concerning the bridge number of satellite knots. For a satellite knot K, we use the companion torus T to provide a lower bound for w(K), proving th…
We prove that a 3--dimensional hyperbolic cusp with convex polyhedral boundary is uniquely determined by its Gauss image. Furthermore, any spherical metric on the torus with cone singularities of negative curvature and all closed contractible geodesics of length greater than 2π is the metric of the Gauss image of som…
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.