Related papers: Euclidean-type algorithm for functions with same o…

Let $P$ and $Q$ be finite point sets of the same cardinality in $\mathbb{R}^2$, each labelled from $1$ to $n$. Two noncrossing geometric graphs $G_P$ and $G_Q$ spanning $P$ and $Q$, respectively, are called compatible if for every face $f$…

We prove that the mapping stack Map(Y,X) of topological stacks X and Y is again a topological stack if Y admits a compact groupoid presentation. If Y admits a locally compact groupoid presentation, we show that Map(Y,X) is a paratopological…

We consider commuting pairs of holomorphic endomorphisms of P^2 with disjoint sequence of iterates. The remaining case to be studied is when their degrees coincide after some number of iterations. We show in this case that they are either…

In this article, we define the l-adic homology for a morphism of schemes satisfying certain finiteness conditions. This homology has these functors similar to the Chow groups: proper push-forward, flat pull-back, base change, cap-product,…

We prove an equivariant version of the classical Menger-Nobeling theorem regarding topological embeddings: Whenever a group $G$ acts on a finite-dimensional compact metric space $X$, a generic continuous equivariant function from $X$ into…

Let $G$ be a connected graph on $n$ vertices and $1 \le k \le n-1$ an integer. The $k$-token graph of $G$ is the graph $F_k(G)$ whose vertices are all the $k$-subsets of vertices of $G$, two of which are adjacent whenever their symmetric…

In physics, Feynman diagrams are used to reason about quantum processes. In the 1980s, it became clear that underlying these diagrams is a powerful analogy between quantum physics and topology: namely, a linear operator behaves very much…

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…

Let $A \in M_{n}(\mathbb{R})$ be an invertible matrix. Consider the semi-direct product $\mathbb{R}^{n} \rtimes \mathbb{Z}$ where $\mathbb{Z}$ acts on $\mathbb{R}^{n}$ by matrix multiplication. Consider a strongly continuous action…

We have proposed a model based upon flocking on a complex network, and then developed two clustering algorithms on the basis of it. In the algorithms, firstly a \textit{k}-nearest neighbor (knn) graph as a weighted and directed graph is…

Gaussian processes are a versatile framework for learning unknown functions in a manner that permits one to utilize prior information about their properties. Although many different Gaussian process models are readily available when the…

We study geodesically convex (g-convex) problems that can be written as a difference of Euclidean convex functions. This structure arises in several optimization problems in statistics and machine learning, e.g., for matrix scaling,…

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

We propose an algorithm to estimate the topology of an embedded metric graph from a well-sampled finite subset of the underlying graph.

Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…

We make use of the complex implicit representation in order to provide a deterministic algorithm for checking whether or not two implicit algebraic curves are related by a similarity, a central question in Pattern Recognition and Computer…

Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…

Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\lambda\in…

Let $C(\mathbf I)$ be the set of all continuous self-maps from ${\mathbf I}=[0,1]$ with the topology of uniformly convergence. A map $f\in C({\mathbf I})$ is called a transitive map if for every pair of non-empty open sets $U,V$ in…