Related papers: Strong homotopy of digitally continuous functions
The purpose of this paper is to interpret polynomial invariants of strongly invertible links in terms of Khovanov homology theory. To a divide, that is a proper generic immersion of a finite number of copies of the unit interval and circles…
Many natural combinatorial quantities can be expressed by counting the number of homomorphisms to a fixed relational structure. For example, the number of 3-colorings of an undirected graph $G$ is equal to the number of homomorphisms from…
We study homomorphism problems of signed graphs. A signed graph is an undirected graph where each edge is given a sign, positive or negative. An important concept for signed graphs is the operation of switching at a vertex, which is to…
Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…
A separable, proper morphism of varieties with geometrically connected fibers induces a homotopy exact sequence relating the \'etale fundamental groups of source, target and fiber. Extending work of dos Santos, we prove the existence of an…
In homotopy type theory we can define the join of maps as a binary operation on maps with a common co-domain. This operation is commutative, associative, and the unique map from the empty type into the common codomain is a neutral element.…
Scaling-invariant functions preserve the order of points when the points are scaled by the same positive scalar (with respect to a unique reference point). Composites of strictly monotonic functions with positively homogeneous functions are…
In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…
We show that the classifying space functor $B: Mon \to Top*$ from the category of topological monoids to the category of based spaces is left adjoint to the Moore loop space functor $\Omega': Top*\to Mon$ after we have localized $Mon$ with…
Although it is unambiguously agreed that structure plays a fundamental role in shaping the dynamics of complex systems, this intricate relationship still remains unclear. We investigate a general computational transformation by which we can…
A weak and a strong concept of plurifinely plurisubharmonic and plurifinely holomorphic functions are introduced. Strong will imply weak. The weak concept is studied further. A function f is weakly plurifinely plurisubharmonic if and only…
We define digital $m-$homotopic distance and its higher version. We also mention related notions such as $m-$category in the sense of Lusternik-Schnirelmann and $m-$complexity in topological robotics. Later, we examine the homotopy…
Homotopy comomentum maps are a higher generalization of the notion of moment map introduced to extend the concept of Hamiltonian actions to the framework of multisymplectic geometry. Loosely speaking, higher means passing from considering…
Hyperdimensional (HD) computing is built upon its unique data type referred to as hypervectors. The dimension of these hypervectors is typically in the range of tens of thousands. Proposed to solve cognitive tasks, HD computing aims at…
We express the rational homotopy type of the mapping spaces $\mathrm{Map}^h(\mathsf D_m,\mathsf D_n^{\mathbb Q})$ of the little discs operads in terms of graph complexes. Using known facts about the graph homology this allows us to compute…
Persistence homology is a tool used to measure topological features that are present in data sets and functions. Persistence pairs births and deaths of these features as we iterate through the sublevel sets of the data or function of…
We consider the question of the additivity of strong homology. This entails isolating the set-theoretic content of the higher derived limits of an inverse system indexed by the functions from $\mathbb{N}$ to $\mathbb{N}$. We show that this…
We consider a discrete-time, continuous-state random walk with steps uniformly distributed in a disk of radius of $h$. For a simply connected domain $D$ in the plane, let $\omega_h(0,\cdot;D)$ be the discrete harmonic measure at $0\in D$…
Graph pattern matching is often defined in terms of subgraph isomorphism, an NP-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead. These extensions allow pattern matching to be…
Working in the soft-element (classical) viewpoint, we introduce \emph{soft bitopological groups}: soft groups endowed with two soft topologies such that the induced topologies on the set of soft elements make the soft-element group into a…