Related papers: Strong Geometry : Knots
The abstract boundary construction of Scott and Szekeres provides a `boundary' for any n-dimensional, paracompact, connected, Hausdorff, smooth manifold. Singularities may then be defined as objects within this boundary. In a previous paper…
In this work, we define the concept of mixed $G$-monotone mappings defined on a metric space endowed with a graph. Then we obtain sufficient conditions for the existence of coupled fixed points for such mappings when a weak contractivity…
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…
Rigid, hard and soft problems and results in arithmetic geometry are presented. "Soft" and "hard" in our paper are limited to the framework of solutions of quadratic forms over rings of integers of local and global fields, the…
Given a weighted graph $G=(V,E,w)$, a partition of $V$ is $\Delta$-bounded if the diameter of each cluster is bounded by $\Delta$. A distribution over $\Delta$-bounded partitions is a $\beta$-padded decomposition if every ball of radius…
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…
For any Inonu-Wigner contraction of a three dimensional Lie algebra we construct the corresponding contractions of representations. Our method is quite canonical in the sense that in all cases we deal with realizations of the…
Given a connected graph $G$, a vertex $w\in V(G)$ strongly resolves two vertices $u,v\in V(G)$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric…
We present two examples of strongly invertible L-space knots whose surgeries are never the double branched cover of a Khovanov thin link in the 3-sphere. Consequently, these knots provide counterexamples to a conjectural characterization of…
This paper challenges some of the common assumptions underlying the mathematics used to describe the physical world. We start by reviewing many of the assumptions underlying the concepts of real, physical, rigid bodies and the translational…
Random geometric graphs are random graph models defined on metric spaces. Such a model is defined by first sampling points from a metric space and then connecting each pair of sampled points with probability that depends on their distance,…
A vector topology on a vector space over a topological field is a (not necessarily Hausdorff) topology by which the addition and scalar multiplication are continuous. We prove that, if an isomorphism between the lattice of topologies of two…
We present a model, based on symmetry and geometry, for proteins. Using elementary ideas from mathematics and physics, we derive the geometries of discrete helices and sheets. We postulate a compatible solvent-mediated emergent pairwise…
In this paper, we present a deep learning-based framework for solving geometric construction problems through visual reasoning, which is useful for automated geometry theorem proving. Constructible problems in geometry often ask for the…
We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…
Spine spaces can be considered as fragments of a projective Grassmann space. We prove that the structure of lines together with binary coplanarity relation, as well as with binary relation of being in one pencil of lines, is a sufficient…
We develop the notion of a geometric covering of a rigid space X, which yields a much larger class of covering spaces than that studied previously by de Jong. Geometric coverings of X are closed under disjoint unions and are \'etale local…
In this paper, we study the entropy of a hard random geometric graph (RGG), a commonly used model for spatial networks, where the connectivity is governed by the distances between the nodes. Formally, given a connection range $r$, a hard…
In this paper we introduce a notion of Feynman geometry on which quantum field theories could be properly defined. A strong Feynman geometry is a geometry when the vector space of $A_\infty$ structures is finite dimensional. A weak Feynman…
In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…