English
Related papers

Related papers: On the realisation problem for mapping degree sets

200 papers

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…

Logic · Mathematics 2021-10-05 Nikolay Bazhenov , Dariusz Kalociński , Michał Wrocławski

We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse

Bedford asked if there exists a birational self map $f$ of the complex projective plane such that for any automorphism $A$ of the complex projective plane $A\circ f$ is not conjugate to an automorphism. Blanc gave such a $f$ of degree $6$…

Dynamical Systems · Mathematics 2021-11-04 Julie Déserti

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…

Combinatorics · Mathematics 2024-09-06 John Talbot , Jun Yan

Let $n\in \mathbb{N}$ and $d_1 \geq d_2 \geq d_n\geq 1$ be integers. There is characterization of when $(d_1, d_1, \ldots, d_n)$ is the degree sequence of a graph containing a perfect matching, due to results of Lov\'{a}sz (1974) and…

Combinatorics · Mathematics 2025-10-02 Joseph Briggs , Jessica McDonald , Songling Shan

The moduli space of stable rational curves with marked points has two distinguished families of maps: the forgetful maps, given by forgetting some of the markings, and the Kapranov maps, given by complete linear series of $\psi$-classes.…

Algebraic Geometry · Mathematics 2025-09-15 Joshua Brakensiek , Christopher Eur , Matt Larson , Shiyue Li

Let $G=(V,E)$ be a finite undirected graph without loops and multiple edges. A subset $M \subseteq E$ of edges is a {\em dominating induced matching} ({\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $M$. In…

Discrete Mathematics · Computer Science 2019-04-12 Andreas Brandstädt , Raffaele Mosca

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

Dynamical Systems · Mathematics 2012-08-29 James T. Campbell , Jared T. Collins

We consider maps between commutative groups and their functional degrees. These degrees are defined based on a simple idea -- the functional degree should decrease if a discrete derivative is taken. We show that the maps of finite…

Group Theory · Mathematics 2021-06-28 Uwe Schauz

A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size…

Combinatorics · Mathematics 2023-04-20 Valentin Bouquet , François Delbot , Christophe Picouleau , Stéphane Rovedakis

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Logic · Mathematics 2026-01-19 Joey Lakerdas-Gayle

Given a sequence $\{Z_d\}_{d\in \mathbb{N}}$ of smooth and compact hypersurfaces in $\mathbb{R}^{n-1}$, we prove that (up to extracting subsequences) there exists a regular definable hypersurface $\Gamma\subset \mathbb{R}\mathrm{P}^n$ such…

Algebraic Geometry · Mathematics 2019-12-02 Saugata Basu , Antonio Lerario , Abhiram Natarajan

In these notes, we consider self-maps of degree > 1 on a weak del Pezzo surface X of degree < 8. We show that there are exactly 12 such X, modulo isomorphism. In particular, K_X^2 > 2, and if X has one self-map of degree > 1 then for every…

Algebraic Geometry · Mathematics 2018-06-20 D. -Q. Zhang

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Combinatorics · Mathematics 2017-03-22 F. V. Weinstein

Let $p$ be a prime. We study non-constant morphisms $f:X_0(p)_\mathbb \to Y$, where $Y/\mathbb Q$ is a curve of genus $\geq 2$. We prove that for $p<3000$ such an $f$ of degree $d>1$ must be isomorphic to the quotient map $X_0(p)\to…

Algebraic Geometry · Mathematics 2026-02-12 Maarten Derickx , Petar Orlić

We look at sequences of positive integers that can be realized as degree sequences of iterates of rational dominant maps of smooth projective varieties over arbitrary fields. New constraints on the degree growth of endomorphisms of the…

Algebraic Geometry · Mathematics 2016-06-16 Christian Urech

The problem of density of $C^0$-stable mappings is a classical and venerable subject in singularity theory. In 1973, Mather showed that the set of proper $C^0$-stable mappings is dense in the set of all proper mappings, which implies that…

Geometric Topology · Mathematics 2023-04-25 Shunsuke Ichiki

Motivated by work of Dragt and Abell on accelerator physics, we study the completion of symplectic jets by polynomial maps of low degrees. We use Anders\'en-Lempert Theory to prove that symplectic completions always exist, and we prove the…

Algebraic Geometry · Mathematics 2013-08-19 Erik Loew , Jorge V. Pereira , Han Peters , Erlend F. Wold