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…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “pattern theory”
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.
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 …
A novel framework infers causal direction from symbolic sequences using pattern entropy.
problem Challenges in discovering causal direction from temporal symbolic data.
method Dictionary Based Pattern Entropy () framework integrating AIT and Shannon Information Theory.
result Minimizing pattern level uncertainty yields a robust framework for causal discovery.
Paper develops new patterns for unique matrix completions.
problem Developing unique completions for non-random matrix patterns.
method Formulated low-rank matrix completion using Plucker coordinates.
result Provides two families of patterns for any rank.
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.
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 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 -twisted satellites.
result None of the -twisted patterns from the family act surjectively on the smooth or rational concordance group.
Study finds cryptocurrency market diversity patterns inconsistent with neutral models.
problem Cryptocurrency market diversity patterns not consistent with neutral models.
method Analysis borrowing methods from ecology, focusing on diversity patterns and community structure.
result Cryptocurrency market diversity patterns not consistent with neutral models, suggesting strong interactions between species.
This paper formalizes a latent variable inference problem we call {\em supervised pattern discovery}, the goal of which is to find sets of observations that belong to a single ``pattern.'' We discuss two versions of the problem and prove uniform risk bounds for both. In the first version, collections of patterns can be…
Survey on discrete minimal surfaces and their properties.
problem Discretizing minimal surfaces in Euclidean space.
method Polyhedral surfaces with parallel face offsets and circle patterns.
result All simply connected discrete minimal surfaces can be constructed from circle patterns.
Develops a multi-class classifier using quantum detection theory.
problem Improving multi-class classification models in machine learning.
method Inspired by quantum detection theory, develops a multi-class classifier.
result Demonstrates improved effectiveness of multi-class classification models.
Taxonomy for ML in simulations, covering patterns and algorithms.
problem Enhancing simulations using machine learning.
method Presentation of eight patterns and three algorithmic areas.
result Catalog of activities and patterns for ML integration in simulations.
Study satellite knots using bordered Floer theory, proving non-thinness and calculating genus.
problem Properties of twisted Mazur pattern satellite knots.
method Use bordered Floer theory to analyze knots and calculate genus.
result Prove non-thinness of and calculate 3-genus in terms of and .
Study uses neural processes to predict and classify crack patterns in moving disks.
problem Predicting and classifying crack patterns in moving disks.
method Peridynamic theory, Convolutional Neural Networks (CNNs), and Neural Processes.
result Neural Processes provide accurate predictions even with missing or insufficient data.
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…
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…
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.
Signatures of covering linksmath.GT
The theory of signature invariants of links in rational homology spheres is applied to covering links of homology boundary links. From patterns and Seifert matrices of homology boundary links, an explicit formula is derived to compute signature invariants of their covering links. Using the formula, we produce fused bou…
Complex Chern-Simons theory reveals peacock patterns in perturbative series.
problem Understanding the structure of partition functions in complex Chern-Simons theory.
method Analyzing the partition function as a holomorphic function and using resurgence theory.
result Perturbative series are resurgent, with trans-series involving non-perturbative variables.
This paper reviews methods for feature selection and extraction in pattern analysis.
problem Complex raw data require feature selection or extraction for better discrimination or representation.
method Reviews different methods of feature selection and extraction.
result Compares various methods of feature selection and extraction.
The paper studies the combinatorial p-th Calabi flow for finite and infinite circle patterns.
problem Establishing convergence and long-time existence of the combinatorial p-th Calabi flow.
method Combinatorial p-th Calabi flow for finite and infinite ideal circle patterns.
result Sharp criterion for convergence in finite case and long-time existence in infinite case for .
New knots not slice in rational 4-balls found.
problem Identifying knots not slice in rational homology 4-balls.
method Using generalized Mazur patterns and immersed Heegaard Floer homology.
result Infinitely many examples of pattern knots P not slice in any rational homology 4-ball.
Two discretizations, linear and nonlinear, of basic notions of the complex analysis are considered. The underlying lattice is an arbitrary quasicrystallic rhombic tiling of a plane. The linear theory is based on the discrete Cauchy-Riemann equations, the nonlinear one is based on the notion of circle patterns. We clari…
We analyze computational limits of modern Hopfield models based on pattern norms.
problem Understanding the efficiency of modern Hopfield models from a fine-grained complexity perspective.
method Fine-grained complexity analysis and upper bound criterion for pattern norms.
result Below a specific norm threshold, efficient variants of modern Hopfield models exist.
Reconstructing network connectivity from the collective dynamics of a system typically requires access to its complete continuous-time evolution although these are often experimentally inaccessible. Here we propose a theory for revealing physical connectivity of networked systems only from the event time series their i…
Neural networks can detect weak patterns hidden in noise.
problem Detecting weak patterns in noisy data.
method Developed a three-layer Sejnowski machine with redundant representation, showing patterns can be stored and retrieved efficiently.
result Neural networks can retrieve information with intensity O(1) even in the presence of noise O(\sqrt{N}) in the large N limit.
This paper reviews three types of probabilistic models: discriminative, descriptive, and generative.
problem None explicitly stated, but the review aims to unify these models under a common framework.
method Review and comparison of discriminative, descriptive, and generative models.
result Unified framework for understanding discriminative, descriptive, and generative models.
This paper presents relevant modern mathematical formulations for (classical) gauge field theories, namely, ordinary differential geometry, noncommutative geometry, and transitive Lie algebroids. They provide rigorous frameworks to describe Yang-Mills-Higgs theories or gravitation theories, and each of them improves th…
A novel method classifies wafer defects using topological data analysis.
problem Classifying defect patterns on semiconductor wafers for maintenance and yield management.
method Representing defect patterns as vectors using topological features from persistent homology.
result The method outperforms CNN in accuracy and efficiency, especially with limited data.
Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elemen…
Cryptocurrency patterns stable across market caps, validated by microstructure theory.
problem Stable patterns in cryptocurrency microstructure across different market caps.
method Unified CatBoost modeling pipeline with time-series cross validation, validated by backtests.
result Feature rankings and partial effects are stable across assets despite heterogeneous liquidity and volatility.
New geometric theory explains nonuniform origami responses.
problem Understanding nonuniform responses in origami sheets.
method Purely geometric continuum theory capturing nonuniform, nonlinear response.
result Three modes govern nonuniform response, varying smoothly across the sheet.
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.
Quantum-enhanced barcode decoding and pattern recognition outperforms classical methods.
problem Improving barcode decoding and pattern recognition using quantum entanglement.
method Quantum hypothesis testing applied to barcode decoding and pattern recognition using entangled quantum sources and measurements.
result Quantum-enhanced methods outperform classical coherent-state strategies for barcode data decoding and classification.
New discrete cmc surfaces defined from sphere packings and combinatorics.
problem Creating constant mean curvature surfaces from discrete data.
method Discrete cmc surfaces defined via sphere packings and combinatorial patterns.
result Construction of discrete cmc surfaces from orthogonal ring patterns.
Detects outliers in continuous-time event sequences, including unexpected absences and occurrences.
problem Identifying unexpected events in event sequences that may indicate abnormal situations.
method Developed methods based on Bayesian decision theory and hypothesis testing for context-aware outlier detection.
result Effective methods for detecting outliers in both synthetic and real-world data.
New guarantees for matrix completion from any deterministic sampling patterns.
problem Proving guarantees for low-rank matrix completion from non-random sampling schemes.
method Introduced a graph with observed entries as edges to analyze the performance of constrained nuclear norm minimization algorithm.
result The algorithm can successfully complete the matrix if the observation graph is well-connected and has similar node degrees.
Nature's forms are frilly, flexible, and functionalcond-mat.soft
Novel defects in hyperbolic sheets explain complex wrinkling patterns in nature.
problem Understanding complex wrinkling patterns in thin elastic hyperbolic surfaces.
method Non-Euclidean plate theory and investigation of branch points.
result Branch points are natural defects in hyperbolic sheets, influencing their morphology robustly.
Khovanov homology of a link and chromatic graph homology are known to be isomorphic in a range of homological gradings that depend on the girth of a graph. We discuss patterns shared by these two homology theories. In particular, we improve the bounds for the homological span of chromatic homology by Helme-Guizon, Przy…
New approach links 2D fluid dynamics to matrix theory.
problem Understanding swirling patterns in 2D fluids.
method Matrix hydrodynamics linking 2D fluid dynamics to matrix theory.
result Established connections between 2D hydrodynamics and matrix Lie theory.
BCIQT model improves ML prediction effectiveness using quantum theory.
problem Improving prediction effectiveness in machine learning models.
method Proposes Binary Classifier Inspired by Quantum Theory (BCIQT) model.
result BCIQT model outperforms state-of-the-art models in recall.
The study improves the perceptron's storage capacity by optimizing variable selection.
problem Distinguishing genuine structure from random correlations in high-dimensional data.
method Replica method from statistical mechanics for optimal variable selection.
result Optimal variable selection can surpass the Cover--Gardner bound for pattern classification.
Bayesian theory explains abrupt emergence of copy subcircuit in attention.
problem Understanding the abrupt emergence of the copy subcircuit in attention during training.
method Deriving a closed-form posterior over the attention matrix and reducing it to a low-dimensional order parameter space.
result Derive a phase transition in the amount of training data.
Deep learning quantifies butterfly phenotypes, validating evolutionary theory.
problem Capturing comprehensive phenotypic information of butterflies.
method Deep convolutional triplet network for phenotypic distance calculation.
result Euclidean phenotypic distances support classical mimicry theory.
Satellite knots have a higher trunk number than their base knots.
problem Understanding the relationship between satellite knots and their base knots.
method Using the Thurston norm and properties of satellite patterns.
result The trunk number of satellite knots is strictly greater than the product of the Thurston norm and the trunk number of their base knots.
Study of embeddings avoiding certain tangent patterns using polynomial spaces.
problem Classifying embeddings avoiding specific tangent patterns.
method Introduce equivalence relation (quasitopy) and use spaces of polynomials as Grassmannians.
result Quasitopy classes of Θ-constrained embeddings stabilize as degree increases.
The paper proves neural networks with ReLU and softmax can approximate any function.
problem Approximating functions and class labels in neural networks.
method Extended universal approximator theory to neural networks with ReLU and softmax.
result Neural networks with ReLU and softmax can approximate any function and class labels.