Related papers: Variants on Digital Covering Maps
We study the group of self-equivalences of a partially postcritically finite branched cover and answer a question of Adam Epstein about contractibility of certain deformation spaces of rational maps.
We describe the relation of $r$-similarity and finite-order invariants on the homotopy set $[S^1,Y]=\pi_1(Y)$.
We study expanding maps and shrinking maps of subvarieties of Grassmann varieties in arbitrary characteristic. The shrinking map was studied independently by Landsberg and Piontkowski in order to characterize Gauss images. To develop their…
A key aspect of the precision of a mobile robots localization is the quality and aptness of the map it is using. A variety of mapping approaches are available that can be employed to create such maps with varying degrees of effort, hardware…
A vertex $v$ in a map $M$ has the face-sequence $(p_1 ^{n_1}. \ldots. p_k^{n_k})$, if there are $n_i$ numbers of $p_i$-gons incident at $v$ in the given cyclic order, for $1 \leq i \leq k$. A map $M$ is called a semi-equivelar map if each…
The topology of digital images has been studied much in recent years, but no attempt has been made to exhaustively catalog the structure of binary images of small numbers of points. We produce enumerations of several classes of digital…
We describe a part of the recent developments in the theory of separately holomorphic mappings between complex analytic spaces. Our description focuses on works using the technique of holomorphic discs.
High-definition (HD) maps offer extensive and accurate environmental information about the driving scene, making them a crucial and essential element for planning within autonomous driving systems. To avoid extensive efforts from manual…
Given a finite ring $A$ which is a free left module over a subring $R$ of $A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace orthogonal bases) and symmetric bases, are defined which in turn are used to define duality…
We describe a general framework to study covariant symmetric broadcasting maps for mixed qubit states. We explicitly derive the optimal N to M superbroadcasting maps, achieving optimal purification of the single-site output copy, in both…
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
We construct sense-preserving univalent harmonic mappings which map the unit disk onto a domain which is convex in the horizontal direction, but with varying dilatation. Also, we obtain minimal surfaces associated with such harmonic…
Biquandles are generalizations of quandles. As well as quandles, biquandles give us many invariants for oriented classical/virtual/surface links. Some invariants derived from biquandles are known to be stronger than those from quandles for…
This paper continues a series discussing flaws in published assertions concerning fixed points in digital images.
We solve a problem on a construction of a separately continuous mapping with the given diagonal, which is the pointwise limit of a sequence of continuous mappings valued in an equiconnected space. We construct an example of a closed-valued…
We study the existence and regularity of invariant graphs for bundle maps (or bundle correspondences with generating bundle maps motivated by ill-posed differential equations) having some relative partial hyperbolicity on non-trivial and…
A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. We consider the cartographic problem to place non-overlapping road labels along…
In this article, we generalize some results in Chan-Yuan [Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 26 (2025), 619--644] to local holomorphic maps between Hermitian manifolds preserving $(p,p)$-forms. In particular, we obtain further rigidity…
Recently, connections have been explored between the complexity of finite problems in graph theory and the complexity of their infinite counterparts. As is shown in our paper (and in independent work of Tirza Hirst and D. Harel from a…
Covering model provides a general framework for granular computing in that overlapping among granules are almost indispensable. For any given covering, both intersection and union of covering blocks containing an element are exploited as…