English
Related papers

Related papers: Strong Geometry : Knots

200 papers

Using techniques from supergravity and dimensional reduction, we study the full isometry algebra of K\"ahler and quaternionic manifolds with special geometry. These two varieties are related by the so-called c-map, which can be understood…

High Energy Physics - Theory · Physics 2009-10-22 B. de Wit , F. Vanderseypen , A. Van Proeyen

Lada introduced strong homotopy algebras to describe the structures on a deformation retract of an algebra in topological spaces. However, there is no satisfactory general definition of a morphism of strong homotopy (s.h.) algebras. Given a…

Category Theory · Mathematics 2014-09-08 J. P. Pridham

We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…

General Topology · Mathematics 2020-05-22 Volodymyr Kiosak , Aleksandr Savchenko , Mykhailo Zarichnyi

We extend our earlier study of the electroweak interactions of quantum knots to their gravitational and strong interactions. The knots are defined by appropriate quantum groups and are intended to describe all knotted field structures that…

High Energy Physics - Theory · Physics 2007-12-07 Robert J. Finkelstein

We study surface knots in 4-space by using generic planar projections. These projections have fold points and cusps as their singularities and the image of the singular point set divides the plane into several regions. The width (or the…

Geometric Topology · Mathematics 2009-05-22 Yasushi Takeda

Let $X$ be a smooth projective variety of dimension $n\geq 2$. It is shown that a finite configuration of points on $X$ subject to certain geometric conditions possesses rich inner structure. On the mathematical level this inner structure…

Algebraic Geometry · Mathematics 2011-04-08 Igor Reider

Two dimensional large-N chiral models on the square and honeycomb lattices are investigated by a strong coupling analysis. Strong coupling expansion turns out to be predictive for the evaluation of continuum physical quantities, to the…

High Energy Physics - Lattice · Physics 2009-10-28 M. Campostrini , P. Rossi , E. Vicari

The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…

Geometric Topology · Mathematics 2017-05-09 Kyle Chapman

Call a pure Hodge structure geometric if it is contained in the cohomology of a smooth complex projective variety. The main goal is to show that for any set of Hodge numbers (subject to the obvious constraints), there exists a geometric…

Algebraic Geometry · Mathematics 2014-12-05 Donu Arapura

A fundamental task in developmental biology is to identify the mechanisms which drive morphogenesis. In many cases, pattern formation is driven by the positional information determined by both the gradient of maternal factors and hard-wired…

Molecular Networks · Quantitative Biology 2007-05-23 L. Diambra , Luciano da Fontoura Costa

GR can be interpreted as a theory of evolving 3-geometries. A recent such formulation, the 3-space approach of Barbour, Foster and \'{O} Murchadha, also permits the construction of a limited number of other theories of evolving…

General Relativity and Quantum Cosmology · Physics 2009-11-07 Edward Anderson

A recent variation of the classical geodetic problem, the strong geodetic problem, is defined as follows. If $G$ is a graph, then ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that one can assign a fixed geodesic to…

Combinatorics · Mathematics 2017-08-15 Sandi Klavžar , Paul Manuel

A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…

History and Overview · Mathematics 2025-08-19 James Cruickshank , Bill Jackson , Tibor Jordán , Shin-ichi Tanigawa

We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…

Metric Geometry · Mathematics 2023-05-16 Sean Dewar , Derek Kitson

The space of n-sided polygons embedded in three-space consists of a smooth manifold in which points correspond to piecewise linear or ``geometric'' knots, while paths correspond to isotopies which preserve the geometric structure of these…

Geometric Topology · Mathematics 2009-09-25 Jorge Alberto Calvo

We establish a characterization of adequate knots in terms of the degree of their colored Jones polynomial. We show that, assuming the Strong Slope conjecture, our characterization can be reformulated in terms of "Jones slopes" of knots and…

Geometric Topology · Mathematics 2018-07-12 Efstratia Kalfagianni

The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong…

Combinatorics · Mathematics 2018-04-02 Valentin Gledel , Vesna Iršič , Sandi Klavžar

Motivated by the problem of constructing explicit geometric string structures, we give a rigid model for bundle 2-gerbes, and define connective structures thereon. This model is designed to make explicit calculations easier in applications…

Differential Geometry · Mathematics 2025-09-08 David Michael Roberts , Raymond F. Vozzo

In this article we study two "strong" topologies for spaces of smooth functions from a finite-dimensional manifold to a (possibly infinite-dimensional) manifold modeled on a locally convex space. Namely, we construct Whitney type topologies…

General Topology · Mathematics 2018-05-14 Eivind Otto Hjelle , Alexander Schmeding

A strong geodetic set of a graph~$G=(V,E)$ is a vertex set~$S \subseteq V(G)$ in which it is possible to cover all the remaining vertices of~$V(G) \setminus S$ by assigning a unique shortest path between each vertex pair of~$S$. In the…

Computational Complexity · Computer Science 2022-08-04 Carlos V. G. C. Lima , Vinicius F. dos Santos , João H. G. Sousa , Sebastián A. Urrutia