相关论文: Degree of Ball Maps with Maximum Geometric Rank

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 consider proper holomorphic maps of ball complements and differences in complex euclidean spaces of dimension at least two. Such maps are always rational, which naturally leads to a related problem of classifying rational maps taking…

In this paper, we give an explicit criterion when a rational holomorphic map between balls is equivalent to a polynomial holomorphic map. Making use of this criterion, we show that any proper rational holomorphic map from B^2 into B^N of…

We make several new contributions to the study of proper holomorphic mappings between balls. Our results include a degree estimate for rational proper maps, a new gap phenomenon for convex families of arbitrary proper maps, and an…

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

We study the degree of an $L$-Lipschitz map between Riemannian manifolds, proving new upper bounds and constructing new examples. For instance, if $X_k$ is the connected sum of $k$ copies of $\mathbb CP^2$ for $k \ge 4$, then we prove that…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

Given closed possibly nonorientable surfaces $M,N$, we prove that if a map $f:M\to N$ has degree $d>0$, then $\chi(M)\le d\cdot\chi(N)$. We give all necessary comments on the definition and properties of geometric degree, which can be…

Given a class of graphs G closed under taking minors, we study the maximum degree \Delta_n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find…

In this paper, we study the gap rigidity phenomenon for proper holomorphic maps between balls of different dimension. We show that any $F\in prop_3({\mathbb{B}}^n, {\mathbb{B}} ^N)$, with $3n<N\leq 4n-7$ and $n\geq 7$, is equivalent to a…

Let $n\geq 3$ and let $\Omega \subset \mathbb{R}^n$ be a $\mathcal{C}^1$ bounded domain which is diffeomorphic to a ball. We investigate here the problem of finding critical points of the $n$-energy in the space $\mathcal{I}=\{v\in…

For a graph $G$, let $c_k(G)$ be the number of spanning trees of $G$ with maximum degree at most $k$. For $k \ge 3$, it is proved that every connected $n$-vertex $r$-regular graph $G$ with $r \ge \frac{n}{k+1}$ satisfies $$ c_k(G)^{1/n} \ge…

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

We study proper rational maps from the unit disk to balls in higher dimensions. After gathering some known results, we study the moduli space of unitary equivalence classes of polynomial proper maps from the disk to a ball, and we establish…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide some effective and computable criteria for birationality in terms of their algebraic and geometric properties. We also extend the Jacobian…

A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…