相关论文: Complexity results for CR mappings between spheres

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

We provide a new way of simultaneously parametrizing arbitrary local CR maps from real-analytic generic manifolds $M\subset {\mathbb C}^N$ into spheres ${\mathbb S}^{2N'-1}\subset {\mathbb C}^{N'}$ of any dimension. The parametrization is…

The aim of this paper is to prove that every continuous map from a compact subset of a real algebraic variety into a sphere can be approximated by piecewise-regular maps of class C^k, where k is an arbitrary integer.

In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…

Let $M$ be a connected real-analytic hypersurface in $\C^N$ and $\S$ the unit real sphere in $\C^{N'}$, $N'> N\geq 2$. Assume that $M$ does not contain any complex-analytic hypersurface of $\C^N$ and that there exists at least one strongly…

We compute the minimum number of critical points of a small codimension smooth map between two manifolds. We give as well some partial results for the case of higher codimension when the manifolds are spheres.

A graph database is a digraph whose arcs are labeled with symbols from a fixed alphabet. A regular graph pattern (RGP) is a digraph whose edges are labeled with regular expressions over the alphabet. RGPs model navigational queries for…

We prove the algebraicity of smooth $CR$-mappings between algebraic Cauchy--Riemann manifolds. A generalization of separate algebraicity principle is established.

Hypergraphs require higher-dimensional representations, which makes it more difficult to compute and interpret their spectral properties. This survey article uses the framework of hypermatrices to give an in-depth overview of the spectral…

In this note we study the uniqueness problem for collections of pennies and marbles. More generally, consider a collection of unit $d$-spheres that may touch but not overlap. Given the existence of such a collection, one may analyse the…

We study a map matching problem, the task of finding in an embedded graph a path that has low distance to a given curve in R^2. The Fr\'echet distance is a common measure for this problem. Efficient methods exist to compute the best path…

We provide significant conditions under which we prove the existence of stable open book structures at infinity, i.e. on spheres $S^{m-1}_R$ of large enough radius $R$. We obtain new classes of real polynomial maps $\mathbb R^m \to \mathbb…

In this note, we prove a rigidity result for proper holomorphic maps between unit balls that have many symmetries and which extend to $\mathcal{C}^2$-smooth maps on the boundary.

The main result of this paper is that the identity component of the automorphism group of a compact, connected, strictly pseudoconvex CR manifold is compact unless the manifold is CR equivalent to the standard sphere. In dimensions greater…

The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix C_{nm} of simple digraph and an incidence matrix F of balanced bipartite…

We prove that the following problem is complete for the existential theory of the reals: Given a planar graph and a polygonal region, with some vertices of the graph assigned to points on the boundary of the region, place the remaining…

In this paper we are interested in the fine-grained complexity of deciding whether there is a homomorphism from an input graph $G$ to a fixed graph $H$ (the $H$-Coloring problem). The starting point is that these problems can be viewed as…

We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…