English
Related papers

Related papers: On degrees of birational mappings

200 papers

We show that the set of Julia limiting directions of a transcendental-type $K$-quasiregular mapping $f:\mathbb{R}^n\to \mathbb{R}^n$ must contain a component of a certain size, depending on the dimension $n$, the maximal dilatation $K$, and…

Dynamical Systems · Mathematics 2024-05-10 Alastair N. Fletcher , Julie M. Steranka

We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…

Combinatorics · Mathematics 2017-08-24 Alice Miller , Michael Codish

We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…

Combinatorics · Mathematics 2010-11-13 Balázs Keszegh , János Pach , Dömötör Pálvölgyi

In this paper we give an explanation of a number of observations relating to degree growth of birational mappings of the plane and their deautonomisation by singularity confinement. These observations are of a link between two a priori…

Exactly Solvable and Integrable Systems · Physics 2024-12-30 Alexander Stokes , Takafumi Mase , Ralph Willox , Basile Grammaticos

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

Algebraic Geometry · Mathematics 2021-03-09 Niels Lubbes

We show that the de Bruijn-Erd\H{o}s condition for the error term in their improvement of Fekete's Lemma is not only sufficient but also necessary in the following strong sense. Suppose that given a sequence $0\leq f(1)\leq f(2)\leq…

Combinatorics · Mathematics 2018-10-30 Zoltan Furedi , Imre Z. Ruzsa

We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…

Commutative Algebra · Mathematics 2024-10-02 Claude Carlet , Serge Feukoua , Ana Sălăgean

Let $\mathcal{C}(S^{m})$ denote the set of continuous maps from the unit sphere $S^{m}$ in $\mathbb{R}^{m+1}$ into itself endowed with the supremum norm. We prove that the set $\{f^n: f\in \mathcal{C}(S^{m})~\text{and}~n\ge 2\}$ of iterated…

Dynamical Systems · Mathematics 2023-01-27 Chaitanya Gopalakrishna

The dynamical degrees of a rational map $f:X\dashrightarrow X$ are fundamental invariants describing the rate of growth of the action of iterates of $f$ on the cohomology of $X$. When $f$ has nonempty indeterminacy set, these quantities can…

Dynamical Systems · Mathematics 2015-03-13 Sarah Koch , Roland K. W. Roeder

Some new results on plane F_{q^2}-maximal curves are stated and proved. It is known that the degree d of such curves is upper bounded by q+1 and that d=q+1 if and only if the curve is F_{q^2}-isomorphic to the Hermitian. We show that d\le…

Algebraic Geometry · Mathematics 2007-05-23 Angela Aguglia , Gabor Korchmaros , Fernando Torres

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

Combinatorics · Mathematics 2025-12-02 Jiangdong Ai , Gregory Gutin , Xiangzhou Liu , Anders Yeo , Yacong Zhou

We study birational automorphisms of algebraic varieties of bounded growth, i.e. such that the norms of the inverse images ${(f^n)}^* \colon \mathrm{NS}(X)\to \mathrm{NS}(X)$ of the powers of the automorphism $f\in\mathrm{Bir}(X)$ are…

Algebraic Geometry · Mathematics 2025-03-05 Alexandra Kuznetsova

We show that if $\Phi: X \dashrightarrow X$ is a dominant rational self-map of a projective surface $X$ over $\mathbb{C}$ with a regular and non-invertible iterate $\Phi^n$, then we can take $n \leq 12$. This bound is sharp and realized on…

Algebraic Geometry · Mathematics 2025-12-02 Sina Saleh

We prove that one can perfectly pack degenerate graphs into complete or dense $n$-vertex quasirandom graphs, provided that all the degenerate graphs have maximum degree $o(\frac{n}{\log n})$, and in addition $\Omega(n)$ of them have at most…

Combinatorics · Mathematics 2019-06-28 Peter Allen , Julia Böttcher , Dennis Clemens , Anusch Taraz

Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…

Combinatorics · Mathematics 2007-05-23 Niranjan Balachandran , Niraj Khare

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…

Commutative Algebra · Mathematics 2021-01-29 M. Chardin , S. H. Hassanzadeh , A. Simis

All binary plane curves of degree less than 7 are examined for curves with a large number of Fq rational points on their smooth model, for q = 2^m ; m = 3, 4,...,11. Previous results are improved, and many new curves are found meeting or…

Number Theory · Mathematics 2025-10-20 Chris Lomont

Let $H_n$ be the row space of a signed adjacency matrix of a $C_4$-free bipartite bi-regular graph in which one part has degree $d(n)\to\infty$ and the other part has degree $k+1$ where $k\geq 1$ is a fixed integer. We show that the local…

Probability · Mathematics 2025-10-23 Asaf Nachmias , Yuval Peled

We prove that the degeneracy of graphs in a hereditary class defined by a finite set S of forbidden induced subgraphs is bounded if and only if S includes a complete graph, a complete bipartite graph and a forest.

Combinatorics · Mathematics 2022-06-22 A. Atminas , V. Lozin

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

Combinatorics · Mathematics 2015-07-22 Élie de Panafieu , Lander Ramos