Related papers: Complexity results for CR mappings between spheres

We prove a new classification result for (CR) rational maps from the unit sphere in some ${\mathbb C}^n$ to the unit sphere in ${\mathbb C}^N$. To so so, we work at the level of Hermitian forms, and we introduce ancestors and descendants.

The study of the mapping class group of the plane minus a Cantor set uses a graph of loops, which is an analogous of the curve graph in the study of mapping class groups of compact surfaces. The Gromov boundary of this loop graph can be…

We establish necessary and sufficient conditions for the realization of mapping schemata as post-critically finite polynomials, or more generally, as post-critically finite polynomial maps from a finite union of copies of the complex…

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…

We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs…

We compute the sets of degrees of maps between principal $SU(2)$-bundles over $S^5$, i.e. between any of the manifolds $SU(2)\times S^5$ and $SU(3)$. We show that the Steenrod squares provide the only obstruction to the existence of a…

Representing complex shapes with simple primitives in high accuracy is important for a variety of applications in computer graphics and geometry processing. Existing solutions may produce suboptimal samples or are complex to implement. We…

We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…

We prove a result on the structure of finite proper holomorphic mappings between complex manifolds that are products of hyperbolic Riemann surfaces. While an important special case of our result follows from the ideas developed by Remmert…

We prove that for finitely generated abelian groups $A$ and $B$, the space of $\mathbb{E}_\infty$-ring maps between the spherical groups rings $\mathbb{S}[A] \to \mathbb{S}[B]$ is equivalent to the discrete set of group homomorphisms $A \to…

In a recent paper by Giuliani and Rothman \cite{GR}, the problem of finding a lower bound on the radius $R$ of a charged sphere with mass M and charge Q<M is addressed. Such a bound is referred to as the critical stability radius.…

We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…

This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…

The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…

We consider a class of piecewise smooth one-dimensional maps with critical points and singularities (possibly with infinite derivative). Under mild summability conditions on the growth of the derivative on critical orbits, we prove the…

We introduce the notion of CR quaternionic map and we prove that any such real-analytic map, between CR quaternionic manifolds, is the restriction of a quaternionic map between quaternionic manifolds. As an application, we prove, for…

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

We analyze the critical connectivity of systems of penetrable $d$-dimensional spheres having size distributions in terms of weighed random geometrical graphs, in which vertex coordinates correspond to random positions of the sphere centers…

Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…