Related papers: Complexity results for CR mappings between spheres
An accurate assessment of a model's complexity is crucial for topics such as interpretation, generalization, and model selection. However, most existing complexity measures either rely on heuristic assumptions or are computationally…
We prove the following finite jet determination result for CR mappings: Given a smooth generic submanifold M of C^N, N >= 2, which is essentially finite and of finite type at each of its points, for every point p on M there exists an…
We prove here new results about transversality and related geometric properties of a holomorphic, formal, or CR mapping, sending one generic submanifold of $\bC^N$ into another. One of our main results is that a finite mapping is…
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of…
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…
Cross-ratio degrees count configurations of points $z_1,\ldots, z_n \in \mathbb{P}^1$ satisfying $n - 3$ cross-ratio constraints, up to isomorphism. These numbers arise in multiple contexts in algebraic and tropical geometry, and may be…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
We study the two-player communication problem of determining whether two vertices $x, y$ are nearby in a graph $G$, with the goal of determining the graph structures that allow the problem to be solved with a constant-cost randomized…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…
Ozkan et al. conjectured that any packing of $n$ spheres with generic radii will be stress-free, and hence will have at most $3n-6$ contacts. In this paper we prove that this conjecture is true for any sphere packing with contact graph of…
The causal graph of a planning instance is an important tool for planning both in practice and in theory. The theoretical studies of causal graphs have largely analysed the computational complexity of planning for instances where the causal…
We introduce orthogonal ring patterns in the 2-sphere and in the hyperbolic plane, consisting of pairs of concentric circles, which generalize circle patterns. We show that their radii are described by a discrete integrable system. This is…
Let $M\subset \mathbb C^n$ be a real analytic hypersurface, $M'\subset \mathbb C^N$ $(N\geq n)$ be a strongly pseudoconvex real algebraic hypersurface of the special form and $F$ be a meromorphic mapping in a neighborhood of a point $p\in…
Let W be a finite reflection group acting orthogonally on R^n, P be the Chevalley polynomial mapping determined by an integrity basis of the algebra of W-invariant polynomials, and h be the highest degree of the coordinate polynomials in…
We study the regularity results of holomorphic correspondences. As an application, we combine it with certain recently developed methods to obtain the extension theorem for proper holomorphic mappings between domains with real analytic…
We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for…
We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…
We prove a Reeb sphere theorem for finite simple graphs. The result bridges two different definitions of spheres in graph theory. We also reformulate Morse conditions in terms of the center manifolds, the level surface graphs {f=f(x)} in…