相关论文: On approximability by embeddings of cycles in the …

Recently Paw\l{}ucki showed that compact sets that are definable in some o-minimal structure admit triangulations of class $\mathcal{C}^p$ for each integer $p\geq 1$. In this work, we make use of these new techniques of triangulation to…

We show that if $E$ is a closed convex set in $\mathbb C^n$ $(n>1)$ contained in a closed halfspace $H$ such that $E\cap bH$ is nonempty and bounded, then the concave domain $\Omega = \mathbb C^n\setminus E$ contains images of proper…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

We introduce a spectral embedding algorithm for finding proximal relationships between nodes in signed graphs, where edges can take either positive or negative weights. Adopting a physical perspective, we construct a Hamiltonian which is…

Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…

A polyellipse is a curve in the Euclidean plane all of whose points have the same sum of distances from finitely many given points (focuses). The classical version of Erd\H{o}s-Vincze's theorem states that regular triangles can not be…

We prove that 2-dimensional simplicial complexes whose first homology group is trivial have topological embeddings in 3-space if and only if there are embeddings of their link graphs in the plane that are compatible at the edges and they…

Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good…

This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…

We study the following combinatorial problem. Given a planar graph $G=(V,E)$ and a set of simple cycles $\mathcal C$ in $G$, find a planar embedding $\mathcal E$ of $G$ such that the number of cycles in $\mathcal C$ that bound a face in…

We show, as our main theorem, that if a Lipschitz map from a compact Riemannian manifold $M$ to a connected compact Riemannian manifold $N$, where $\dim M \geq \dim N$, has no singular points on $M$ in the sense of F.H. Clarke, then the map…

In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…

Let $K$ be a closed polydisc or ball in $\C^n$, and let $Y$ be a quasi projective algebraic manifold which is Zariski locally equivalent to $\C^p$, or a complement of an algebraic subvariety of codimension $\ge 2$ in such manifold. If $r$…

We prove that affine maps are uniquely extremal quasiconformal maps on the complement of a well distribute set in the complex plane answering a conjecture from \cite{markovic}. We construct the required Reich sequence using Bergman…

Tree decompositions were developed by Robertson and Seymour. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to…

An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The…

It is known that if a plane graph is graceful (resp. near-graceful), then its semidual is conservative (resp. near-conservative). In this work we prove that the semidual of a plane graph of size $M$ consisting of two nested cycles is…

Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case…

A covering path for a finite set $P$ of points in the plane is a polygonal path such that every point of $P$ lies on a segment of the path. The vertices of the path need not be at points of $P$. A covering path is plane if its segments do…

In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…