Related papers: On degrees of birational mappings

We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…

We prove that any finitely generated subgroup of the plane Cremona group consisting only of algebraic elements is of bounded degree. This follows from a more general result on `decent' actions on infinite direct sums. We apply our results…

We study the link between the degree growth of integrable birational mappings of order higher than two and their singularity structures. The higher order mappings we use in this study are all obtained by coupling mappings that are…

We present new degree-sequence lower bounds on the expected size of an independent set from the hard-core model. For arbitrary graphs, we establish a multivariate lower bound inspired by a conjecture of the first author and Kang and a…

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…

Let D be a bounded, finitely connected domain in the complex plane without isolated points in the boundary and let f be a continuous function on the boundary bD. Let F be a continuous extension of f to the closure of D. We prove that f…

We describe a new algorithm for calculating the topological degree deg (f, B, 0) where B \subseteq Rn is a product of closed real intervals and f : B \rightarrow Rn is a real-valued continuous function given in the form of arithmetical…

It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all $\Delta\geq3$ and for all sufficiently large $n$, there is a simple $\Delta$-regular $n$-vertex graph with queue-number at…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

Let $f$ be an inner function with $f(0)=0$ which is not a rotation and let $f^{n}$ be its $n$-th iterate. Let $\{a_{n}\}$ be a sequence of complex numbers. We prove that the series $\sum a_{n}f^{n}(\xi)$ converges at almost every point…

Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…

Let $\mathcal{A}$ be a finite set of $d\times d$ matrices with integer entries and let $m_n(\mathcal{A})$ be the maximum norm of a product of $n$ elements of $\mathcal{A}$. In this paper, we classify gaps in the growth of…

For a finite group $G$ acting faithfully on a finite dimensional $F$-vector space $V$, we show that in the modular case, the top degree of the vector coinvariants grows unboundedly: $\lim_{m\to\infty} \topdeg F[V^{m}]_{G}=\infty$. In…

A graph class $\mathcal{G}$ has linear growth if, for each graph $G \in \mathcal{G}$ and every positive integer $r$, every subgraph of $G$ with radius at most $r$ contains $O(r)$ vertices. In this paper, we show that every graph class with…

Let $C$ be a closed cone with nonempty interior $C^\circ$ in a Banach space. Let $f:C^\circ \rightarrow C^\circ$ be an order-preserving subhomogeneous function with a fixed point in $C^\circ$. We introduce a condition which guarantees that…

We show that any birational selfmap of a complex projective surface that has dynamical degree greater than one and is defined over a number field automatically satisfies the Bedford-Diller energy condition after a suitable birational…

Let f(n,m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m edges. Summarizing earlier research, we present a concise, asymptotically sharp upper bound on f(n,m), better than the bound of de Caen for…

For maps of one complex variable, $f$, given as the sum of a degree $n$ power map and a degree $d$ polynomial, we provide necessary and sufficient conditions that the geometric limit as $n$ approaches infinity of the set of points that…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

We present a surprisingly short proof that for any continuous map $f : \mathbb{R}^n \rightarrow \mathbb{R}^m$, if $n>m$, then there exists no bound on the diameter of fibers of $f$. Moreover, we show that when $m=1$, the union of small…