相关论文: Complexity results for CR mappings between spheres
The ``complex Plateau problem'' (or boundary problem) in a complexe manifold X is the problem of characterizing the real submanifolds $\Gamma$ of X which are boundaries of analytic sub-varieties of $X \backslash \Gamma$. Our principal…
We determine all CR maps from the sphere in $\mathbb{C}^3$ into the tube over the future light cone in $\mathbb{C}^4$. This result leads to a complete characterization of proper holomorphic maps from the three-dimensional unit ball into the…
We classify the germs of $\mathcal{C}^\infty$ CR manifolds that admit a smooth CR contraction. We show that such a CR manifold is embedded into $\CC^n$ as a real hypersurface defined by a polynomial defining function consisting of monomials…
For a fixed radius $r$ and a point $o$ in the curve complex of a surface, we define the sphere of radius $r$ to be the induced subgraph on the set of vertices of distance $r$ from $o$. We show that these spheres are almost simply connected…
Here we present a rigidity result in a global (semi-global, homotopy) setting for a restrictive class of polytopes, those that can be inscribed in a unit sphere, with some additional conditions. The proof of the rigidity result for cabled…
Recent research revealed the existence of gaps in the complexity landscape of locally checkable labeling (LCL) problems in the LOCAL model of distributed computing. For example, the deterministic round complexity of any LCL problem on…
For $N \geq 4$ we classify the $(N-3)$-degenerate smooth CR maps of the three-dimensional unit sphere into the $(2N-1)$-dimensional unit sphere. Each of these maps has image being contained in a five-dimensional complex-linear space and is…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
This review describes the diversity of jammed configurations attainable by frictionless convex nonoverlapping (hard) particles in Euclidean spaces and for that purpose it stresses individual-packing geometric analysis. A fundamental feature…
We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…
We study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting game-theoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge…
Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…
Graph Spectral Clustering methods (GSC) allow representing clusters of diverse shapes, densities, etc. However, the results of such algorithms, when applied e.g. to text documents, are hard to explain to the user, especially due to…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
By variational methods, for a kind of Webster scalar curvature problems on the CR sphere with cylindrically symmetric curvature, we construct some multi-peak solutions as the parameter is sufficiently small under certain assumptions. We…
Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open…
In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…
Hard spheres are ubiquitous in condensed matter: they have been used as models for liquids, crystals, colloidal systems, granular systems, and powders. Packings of hard spheres are of even wider interest, as they are related to important…
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently.…
Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, where X, Y are given as finite simplicial complexes, and the…