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.
168,657 papers · 148 categories
Trend · papers per month
48 results for “intersection patterns”
Random Intersection Chainsstat.ML
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.
Study detects if a circuit bounds a disc using curve intersections.
problem Determining if a circuit bounds an embedded disc.
method Analyzing the group generated by Dehn twists about curves in a circuit.
result Cycle relation between Dehn twists detects disc-boundability.
Extracts the finest pattern of mutual independence from data.
problem Inferring the finest mutual independence pattern from data.
method Estimate the set of valid patterns of dichotomic independence and use their intersection to infer the finest pattern.
result The method can estimate the finest mutual independence pattern from i.i.d. realizations of a multivariate normal distribution.
Hyperideal circle patternsmath.GT
A ``hyperideal circle pattern'' in 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 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).
A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were studied intensively. Our main result is that intersection patterns of good covers are …
CMC-1 surfaces linked via Möbius transformations between circle patterns.
problem Characterizing and relating CMC-1 surfaces via circle patterns.
method Osculating Möbius transformations between circle patterns induce realizations in hyperbolic space.
result One-to-one correspondence between CMC-1 surfaces under specific conditions.
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.
This paper investigates circle patterns with obtuse exterior intersection angles on surfaces of finite topological type. We characterise the images of the curvature maps and establish several equivalent conditions regarding long time behaviors of Chow-Luo's combinatorial Ricci flows for these patterns. As consequences,…
Origami patterns are classified based on their symmetry groups.
problem Classifying the symmetry groups of origami patterns.
method Iteratively compute intersection points and lines to construct mathematical origami sets, then classify them based on wallpaper groups.
result Determine which wallpaper groups can be constructed from given origami patterns.
This paper proves a deformation circle pattern theorem, which gives a complete description of those circle patterns with interstices in terms of the combinatorial type, the exterior intersections angles and the conformal structures of interstices. As results, the surface version of Rivin's theorem and the approximation…
We consider ``hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyperideal circle patterns are associated to hyperideal hyperbolic polyhedra. We describe the…
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.
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.
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…
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…
We consider circle packings and, more generally, Delaunay circle patterns - arrangements of circles arising from a Delaunay decomposition of a finite set of points - on surfaces equipped with a complex projective structure. Motivated by a conjecture of Kojima, Mizushima and Tan, we prove that the forgetful map sending …
We suggest a new definition for discrete minimal surfaces in terms of sphere packings with orthogonally intersecting circles. These discrete minimal surfaces can be constructed from Schramm's circle patterns. We present a variational principle which allows us to construct discrete analogues of some classical minimal su…
Perron's method and spherical ideal circle patterns with prescribed total geodesic curvaturesmath.GT
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.
It is well-known that intersection of continuous correspondences can lost the continuity property. Lechicki and Spakowski's theorem says that intersection of H-lsc functions remains H-lsc if the intersection is a bounded subset of a normed space and its interior is nonempty. Lechicki and Spakowski pointed to the import…
Milnor's triple linking numbers of a link in the 3-sphere are interpreted geometrically in terms of the pattern of intersections of the Seifert surfaces of the components of the link. This generalizes the well known formula as an algebraic count of triple points when the pairwise linking numbers vanish.
Introduces a new triple coproduct for knots on surfaces, preserving local crossing patterns.
problem Tackles the lack of fine-grained detection in classical cobrackets for local crossing patterns.
method Defines an integer-valued invariant using a coproduct and intersection theory, extending Turaev's cobracket theory.
result Reveals an intrinsic simplicity in the algebraic framework, uniquely determining relations in the word space.
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.
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.
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.
Study circle patterns and polyhedral surfaces in hyperbolic ends, proving manifold properties.
problem Understanding the space of complex projective structures on surfaces with circle patterns.
method Analyzing ideal polyhedral surfaces in hyperbolic ends, proving manifold properties and Lagrangian immersions.
result The space of complex projective structures on surfaces with circle patterns is a manifold of dimension 6g-6.
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of such curves admitting representatives that intersect at most k times. We prove that…
Splittings and C-complexesmath.GR
The intersection pattern of the translates of the limit set of a quasi-convex subgroup of a hyperbolic group can be coded in a natural incidence graph, which suggests connections with the splittings of the ambient group. A similar incidence graph exists for any subgroup of a group. We show that the disconnectedness of …
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 . The core of the argument is the construction of a compact orientable hyperbolic -manifold that contains a surface of genus with sel…
New criteria for ideal circle patterns on surfaces.
problem Determining when a surface supports ideal circle patterns.
method Introducing a character and using combinatorial Ricci flows.
result Simpler and more easily verifiable criteria for ideal circle patterns.
Intelligent Transportation Systems (ITSs) are envisioned to play a critical role in improving traffic flow and reducing congestion, which is a pervasive issue impacting urban areas around the globe. Rapidly advancing vehicular communication and edge cloud computation technologies provide key enablers for smart traffic …
We describe the structure of quasiflats in two-dimensio\-nal Artin groups. We rely on the notion of metric systolicity developed in our previous work. Using this weak form of non-positive curvature and analyzing in details the combinatorics of tilings of the plane we describe precisely the building blocks for quasiflat…
Average teaching complexity for locating target regions among halfspace intersections is Θ(d).
problem Teaching the location of a target region among intersections of halfspaces.
method Novel insights from computational geometry to count convex polytopes and faces.
result Average-case teaching complexity is Θ(d), contrasting with Θ(n) worst-case complexity.
We show that mapping class groups associated to all types of real algebraic curves are virtual duality groups. We also deduce some results about the orbifold homotopy groups of the moduli spaces of real algebraic curves. We achieve these results by defining a new complex associated to a not necessarily orientable surfa…
Discovering and clustering subspaces in high-dimensional data is a fundamental problem of machine learning with a wide range of applications in data mining, computer vision, and pattern recognition. Earlier methods divided the problem into two separate stages of finding the similarity matrix and finding clusters. Simil…
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.
The paper examines how closed curves on surfaces intersect and how this intersection determines the curves.
problem Determining closed curves on surfaces based on their intersections.
method Constructing and studying -equivalent curves, analyzing intersections with other curves.
result Curves are determined by their intersections with all other curves, but non-simple curves require infinitely many intersections to distinguish.
3-manifold triangulation can be reconstructed from its intersection matrix.
problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.
This study uses ARM to analyze pedestrian crashes under different lighting conditions.
problem Identifying crash risk factors under varying lighting conditions.
method Applied Association Rules Mining to Louisiana pedestrian crash data.
result Daylight crashes are associated with children, seniors, and older drivers.
Machine learning classifies complex geometric patterns with high accuracy.
problem Classifying extension degree of dessins d'enfants over the rationals.
method Deep feed-forward neural network trained on machine learning.
result 0.92 accuracy in classification with 0.03 standard error.
We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced 4-polytopes: 4-simplices, "tetrahedral diamonds" and 4-parallelotopes. We propose …
The paper finds diffeomorphic complex intersections with distinct Hodge numbers.
problem Identifying complex intersections with different Hodge numbers.
method Provided three pairs of 3-dimensional and one pair of 5-dimensional complex complete intersections, all diffeomorphic but with different Hodge numbers.
result Diffeomorphic complex intersections can have different Hodge numbers.
New polynomials defined for virtual knots, calculated up to crossing 4.
problem Defining and calculating invariants for virtual knots.
method Intersection number of curves on a closed surface.
result Intersection polynomials calculated up to crossing 4.
In this paper we present the algorithms for calculating the differential geometric properties {t,n,b1,b2,b3,k1,k2,k3,k4} along-with geodesic curvature and geodesic torsion of the transversal intersection curve of four hypersurfaces (given by parametric representation) in Euclidean space R^5. In transversal intersection…
Autonomous vehicles are expected to navigate in complex traffic scenarios with multiple surrounding vehicles. The correlations between road users vary over time, the degree of which, in theory, could be infinitely large, thus posing a great challenge in modeling and predicting the driving environment. In this paper, we…
We generalize the PL intersection product for chains on PL manifolds and for intersection chains on PL stratified pseudomanifolds to products of locally finite chains on non-compact spaces that are natural with respect to restriction to open sets. This is necessary to sheafify the intersection product, an essential ste…
Conditions for curves on a torus with specific pairwise intersections.
problem Finding curves on a torus with prescribed pairwise intersections.
method Necessary and sufficient conditions for curves on a torus with given pairwise intersections.
result Necessary and sufficient conditions for the existence of curves on a torus with specific pairwise intersections.