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

Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…

The purpose of this article is to study Lipschitz CR mappings from an $h$-extendible (or semi-regular) hypersurface in $\mbb C^n$. Under various assumptions on the target hypersurface, it is shown that such mappings must be smooth. A…

Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…

Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for…

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

We introduced a new coordinate-free approach to study the Cauchy-Riemann (CR) maps between the real hyperquadrics in the complex projective space. The central theme is based on a notion of orthogonality on the projective space induced by…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up…

Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

Multicriteria Decision Making problems are important both for individuals and groups. Pairwise comparisons have become popular in the theory and practice of preference modelling and quantification. We focus on decision problems where the…

We prove an effective version of a theorem relating curve complex distance to electric distance in hyperbolic 3-manifolds, up to errors that are polynomial in the complexity of the underlying surface. We use this to give an effective proof…

We consider the standard model of i.i.d. bond percolation on $\mathbb Z^d$ of parameter $p$. When $p>p_c$, there exists almost surely a unique infinite cluster $\mathcal C_p$. Using the recent techniques of Cerf and Dembin, we prove that…

We describe an effective method for computing the topological degree of continuous functions $R:S^2 \to S^2$, where $S^2$ is the Riemann sphere. Our approach generalizes the degree formula for rational functions of complex polynomials,…

We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…

Two results (together with their relatively elementary proofs) are presented. The first one presents the upper boundary on the number of spanning trees in a finite planar multigraph, proving that the complexity (the number of spanning…

We prove that if $M$ and $M'$ are algebraic hypersurfaces in $ C^ N$, i.e. both defined by the vanishing of real polynomials, then any sufficiently smooth CR mapping with Jacobian not identically zero extends holomorphically provided the…

CR singularities of real 4-submanifolds in complex 3-space are classified by using local holomorphic coordinate changes to transform the quadratic coefficients of the real analytic defining equation into a normal form. The quadratic…

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…