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

It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi,…

In this paper, we establish a new criterion for covering maps between real algebraic varieties. Specifically, we prove that a quasi-finite, flat morphism with locally constant geometric fibers between varieties over a real closed field…

An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

We study a CR analogue of the Ahlfors derivative for conformal immersions of Stowe [23] that generalizes the CR Schwarzian derivative studied earlier by the second-named author [21]. This notion possesses several important properties…

In this paper, we prove a rigidity result for proper holomorphic maps between unit balls that have many symmetries and which extend to H\"older continuous maps on the boundary, with H\"older exponent strictly greater than 1/2.

A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

We determine all local smooth or formal CR maps from the unit sphere $\mathbb{S}^3\subset \mathbb{C}^2$ into the tube $\mathcal{T}:= \mathcal{C} \times i\mathbb{R}^3 \subset \mathbb{C}^3$ over the future light cone $\mathcal{C}:=…

We consider the maximum chromatic number of hypergraphs consisting of cliques that have pairwise small intersections. Designs of the appropriate parameters produce optimal constructions, but these are known to exist only when the number of…

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. There has been much recent interest in the problem for mixed graphs, where we allow both undirected…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

We study the rigidity of holomorphic mappings from a neighborhood of a Levi-nondegenerate CR hypersurface $M$ with signature $l$ into a hyperquadric $Q_{l'}^{N} \subseteq \mathbb{CP}^{N+1}$ of larger dimension and signature. We show that if…

We consider a smooth CR mapping $f$ from a real-analytic generic submanifold $M$ in $\bC^N$ into $\bC^N$. For $M$ of finite type and essentially finite at a point $p\in M$, and $f$ formally finite at $p$, we give a necessary and sufficient…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

Let $\mathcal{Q}$ be a vertex subset problem on graphs. In a reconfiguration variant of $\mathcal{Q}$ we are given a graph $G$ and two feasible solutions $S_s, S_t\subseteq V(G)$ of $\mathcal{Q}$ with $|S_s|=|S_t|=k$. The problem is to…

We consider here the $3$-sphere $\mathbf S^3$ seen as the boundary at infinity of the complex hyperbolic plane $\mathbf{H}^2_{\mathbf C}$. It comes equipped with a contact structure and two classes of special curves. First $\mathbf…

We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…

Graph Burning asks, given a graph $G = (V,E)$ and an integer $k$, whether there exists $(b_{0},\dots,b_{k-1}) \in V^{k}$ such that every vertex in $G$ has distance at most $i$ from some $b_{i}$. This problem is known to be NP-complete even…

For a given branched covering between closed connected surfaces, there are several easy relations one can establish between the Euler characteristics of the surfaces, their orientability, the total degree, and the local degrees at the…