Research
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,695 papers · 148 categories

Trend · papers per month

285583110 · Jun 202019922001200920172026
48 results for digital topology

Incorrect fixed point assertions in digital topology are discussed.

problem Incorrect, incorrectly proven, or trivial fixed point assertions in digital topology.
method Continues earlier work on identifying and critiquing bad fixed point assertions.
result Clarifies the nature and extent of incorrect fixed point assertions in digital topology.

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces. We show that in many cases, researchers using these tools have derived conclusions that are incorrect, trivial, or limited.

2018-08-29abs ↗pdf ↗

Several recent papers in digital topology have sought to obtain fixed point results by mimicking the use of tools from classical topology, such as complete metric spaces and homotopy invariant fixed point theory. We show that in many cases, researchers using these tools have derived conclusions that are incorrect or tr…

2018-06-15abs ↗pdf ↗

In this paper, we show how to construct graph theoretical models of n-dimensional continuous objects and manifolds. These models retain topological properties of their continuous counterparts. An LCL collection of n-cells in Euclidean space is introduced and investigated. If an LCL collection of n-cells is a cover of a…

2017-05-02abs ↗pdf ↗

We give an answer to the question given by T.Y.Kong in his article "Can 3-D Digital Topology be Based on Axiomatically Defined Digital Spaces?" In this article he asks the question, if so called "good pairs" of neighborhood relations can be found on the set Z^n such that the existence of digital manifolds of dimension …

2011-11-13abs ↗pdf ↗

We continue the work of [5] and [3], in which are considered papers in the literature that discuss fixed point assertions in digital topology. We discuss published assertions that are incorrect or incorrectly proven; that are severely limited or reduce to triviality under "usual" conditions; or that we improve upon.

2018-12-10abs ↗pdf ↗

The paper presents a new set of axioms of digital topology, which are easily understandable for application developers. They define a class of locally finite (LF) topological spaces. An important property of LF spaces satisfying the axioms is that the neighborhood relation is antisymmetric and transitive. Therefore any…

2010-10-04abs ↗pdf ↗

We present a way to use Topological Data Analysis (TDA) for machine learning tasks on grayscale images. We apply persistent homology to generate a wide range of topological features using a point cloud obtained from an image, its natural grayscale filtration, and different filtrations defined on the binarized image. We…

2019-10-18abs ↗pdf ↗

We continue the work of [10], studying properties of digital images determined by fixed point invariants. We introduce pointed versions of invariants that were introduced in [10]. We introduce freezing sets and cold sets to show how the existence of a fixed point set for a continuous self-map restricts the map on the c…

2019-04-01abs ↗pdf ↗

In this paper, we study two classes of planar self-similar fractals TεT_\varepsilon with a shifting parameter ε\varepsilon. The first one is a class of self-similar tiles by shifting xx-coordinates of some digits. We give a detailed discussion on the disk-likeness ({\it i.e., the property of being a topological disk}…

2017-01-05abs ↗pdf ↗

This study redefines probability for finite outcomes using axioms and examples.

problem Defining probability for finite outcomes and preserving information.
method Developed three axioms for relative probability functions and provided examples and a system for their composition.
result Proved the topological closure of the relative probability space, preserving information under limits.

We construct an elementary, combinatorial kind of topological quantum field theory, based on curves, surfaces, and orientations. The construction derives from contact invariants in sutured Floer homology and is essentially an elaboration of a TQFT defined by Honda--Kazez--Matic. This topological field theory stores inf…

2012-01-22abs ↗pdf ↗

Let MM be a 3×33\times 3 integer matrix each of whose eigenvalues is greater than 11 in modulus and let DZ3\mathcal{D}\subset\mathbb{Z}^3 be a set with D=detM|\mathcal{D}|=|\det M|, called digit set. The set equation MT=T+DMT = T+\mathcal{D} uniquely defines a nonempty compact set TR3T\subset \mathbb{R}^3. If TT has positive L…

2018-11-16abs ↗pdf ↗

There is a concept in digital topology of a shy map. We define an analogous concept for topological spaces: We say a function is shy if it is continuous and the inverse image of every path-connected subset of its image is path-connected. Some basic properties of such maps are presented. For example, every shy map onto …

2017-05-25abs ↗pdf ↗

Given an integer n2n\geq 2 and a digit set D0,1,...,n12{\mathcal D}\subsetneq {0,1,...,n-1}^2, there is a self-similar set FR2F \subset {\Bbb R}^2 satisfying the set equation: F=(F+D)/nF=(F+{\mathcal D})/n. We call such FF a fractal square. By studying a periodic extension H=F+Z2H= F+ {\mathbb Z}^2, we classify FF into three types accordi…

2012-06-21abs ↗pdf ↗

Self-affine tiles homeomorphic to a ball proven for a specific digit set.

problem Topology of self-affine tiles with collinear digit sets.
method Proving homeomorphism to a ball using integral self-affine tiles with collinear digit sets.
result A large class of integral self-affine tiles with collinear digit sets is homeomorphic to a closed 3-dimensional ball.

The paper uses topological concepts to analyze neural networks, revealing complex structure and dynamics.

problem Understanding the structure and dynamics of deep learning models.
method Topological dynamical systems, index theory, and computational homology.
result Neurons correspond to simplexes in a simplicial complex, and topological invariants can be computed.

We perform topological data analysis on the internal states of convolutional deep neural networks to develop an understanding of the computations that they perform. We apply this understanding to modify the computations so as to (a) speed up computations and (b) improve generalization from one data set of digits to ano…

2018-11-02abs ↗pdf ↗

ISOMORPH creates a digital twin for supply chain logistics, advancing time-series forecasting benchmarks.

problem Lack of public benchmarks for supply chain logistics time-series forecasting.
method Developed a digital twin simulator with interpretable parameters and modular topology, generating datasets and verifying conservation laws.
result Foundation models achieve MASE values exceeding public benchmarks at low-to-moderate horizons, supporting UQ.

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

A new method streamlines digital payment programming using smart contracts.

problem High costs and security challenges in programming smart contracts for digital payments.
method Transforming digital currencies into token streams and using configurable templates to generate specialized smart contracts.
result Reduces payment programming costs and enhances security, self-enforcement, adaptability, and controllability.

New framework explains leading digit patterns without probabilistic assumptions.

problem Explaining leading digit distributions without relying on probabilistic models.
method Shift-invariant functional equation and affine-plus-periodic formulas.
result Unified mathematical foundation for understanding digit distributions.