English
Related papers

Related papers: Axiomatic Digital Topology

200 papers

Let $\Gamma$ be a locally finite graph, $L$ the normalized Laplacian of $\Gamma$. If $\Gamma$ is uniformy locally finite, i.e. if each vertex has no more than $d$ adjacent vertices, then the matrix of $L$ (with respect to the standard…

Combinatorics · Mathematics 2018-08-14 Vladimir Manuilov

We study properties of Cartesian products of digital images, using a variety of adjacencies that have appeared in the literature.

Geometric Topology · Mathematics 2017-05-23 Laurence Boxer

We consider all compatible topologies of an arbitrary finite-dimensional vector space over a non-trivial valuation field whose metric completion is a locally compact space. We construct the canonical lattice isomorphism between the lattice…

General Topology · Mathematics 2023-12-01 Takanobu Aoyama

This article introduces strongly near proximity, which represents a new kind of proximity called \emph{almost proximity}. A main result in this paper is the introduction of a hit-and-miss topology on ${CL}(X)$, the hyperspace of nonempty…

General Topology · Mathematics 2015-03-10 J. F. Peters , C. Guadagni

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

Geometric Topology · Mathematics 2016-09-07 Alexander Nabutovsky , Shmuel Weinberger

We introduce hierarchical neighbor graphs, a new architecture for connecting ad hoc wireless nodes distributed in a plane. The structure has the flavor of hierarchical clustering and requires only local knowledge and minimal computation at…

Networking and Internet Architecture · Computer Science 2015-09-30 Amitabha Bagchi , Adit Madan , Achal Premi

We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…

Computational Geometry · Computer Science 2020-06-30 Man-Kwun Chiu , Matias Korman , Martin Suderland , Takeshi Tokuyama

Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the turn of the century: protocol complexes, and directed…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-21 Pierre Fraigniaud , Ami Paz

It is well-known that for certain local connectivity assumptions the fundamental groupoid of a topological space can be equipped with a topology making it a topological groupoid. In other words, the fundamental groupoid functor can be…

Algebraic Topology · Mathematics 2018-02-02 David Michael Roberts

Nonlocal crystals are systems with translational symmetry but arbitrary range couplings or interactions between degrees of freedom. We argue that the notion of topology in such systems does not collapse to that in zero dimensions, as one…

Strongly Correlated Electrons · Physics 2025-06-13 Shu Hamanaka , Martina O. Soldini , Tsuneya Yoshida , Titus Neupert

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

Optimization and Control · Mathematics 2025-01-29 Adrian S. Lewis , Adriana Nicolae , Tonghua Tian

In a computational topology of digital images, simplexes are replaced by Delta sets in approximating image object shapes. For simplicity, simplexes and Delta sets are restricted to the Euclidean plane. A planar simplex is either a vertex, a…

Computational Geometry · Computer Science 2017-06-15 M. Z. Ahmad , J. F. Peters

We study homeomorphisms of tiling spaces with finite local complexity (FLC), of which suspensions of $d$-dimensional subshifts are an example, and orbit equivalence of tiling spaces with (possibly) infinite local complexity (ILC). In the…

Dynamical Systems · Mathematics 2018-07-09 Antoine Julien , Lorenzo Sadun

The focus of this article is to define the descriptively approximations in proximal relator spaces. Afterwards, descriptive approximately algebraic structures such as groupoids, semigroups and groups in digital images endowed with…

Group Theory · Mathematics 2017-01-27 Ebubekir İnan

Semantic segmentation has made much progress with increasingly powerful pixel-wise classifiers and incorporating structural priors via Conditional Random Fields (CRF) or Generative Adversarial Networks (GAN). We propose a simpler…

Computer Vision and Pattern Recognition · Computer Science 2018-08-22 Tsung-Wei Ke , Jyh-Jing Hwang , Ziwei Liu , Stella X. Yu

Affinity propagation is one of the most effective unsupervised pattern recognition algorithms for data clustering in high-dimensional feature space. However, the numerous attempts to test its performance for community detection in complex…

Machine Learning · Computer Science 2018-08-30 Carlo Vittorio Cannistraci , Alessandro Muscoloni

We study locally finite varieties (=primitive classes) of linear algebras over finite fields. We do not assume that our algebras are associative or Lie. We are interested in the basic properties of finite algebras in these varieties such…

Rings and Algebras · Mathematics 2026-03-11 Yuri Bahturin , Alexander Olshanskii

In this paper, we present two types of Lefschetz numbers in the topology of digital images. Namely, the simplicial Lefschetz number $L(f)$ and the cubical Lefschetz number $\bar L(f)$. We show that $L(f)$ is a strong homotopy invariant and…

General Topology · Mathematics 2020-04-17 Muhammad Sirajo Abdullahi , Poom Kumam , P. Christopher Staecker

In this paper, we show that every topological group is a strong small loop transfer space at the identity element. This implies that the quasitopological fundamental group of a connected locally path connected topological group is a…

Algebraic Topology · Mathematics 2018-03-05 Hamid Torabi

The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure. However, higher-order relations cannot be losslessly captured by mere graphs and…

Social and Information Networks · Computer Science 2021-11-02 Govind Sharma , Paarth Gupta , M. Narasihma Murty