English
Related papers

Related papers: On the realisation problem for mapping degree sets

200 papers

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

We compute the sets of degrees of maps between principal $SU(2)$-bundles over $S^5$, i.e. between any of the manifolds $SU(2)\times S^5$ and $SU(3)$. We show that the Steenrod squares provide the only obstruction to the existence of a…

Algebraic Topology · Mathematics 2019-12-04 Jean-François Lafont , Christoforos Neofytidis

This paper concerns various models of ``at-most-$n$-valued maps''. That is, multivalued maps $f:X\multimap Y$ for which $f(x)$ has cardinality at most $n$ for each $x$. We consider 4 classes of such maps which have appeared in the…

General Topology · Mathematics 2025-02-28 Daciberg Lima Goncalves , Robert Skiba , P. Christopher Staecker

A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…

Rings and Algebras · Mathematics 2019-12-30 Yuri Bahturin , Alberto Elduque , Mikhail Kochetov

This paper introduces three sets of sufficient conditions, for generating bijective simplicial mappings of manifold meshes. A necessary condition for a simplicial mapping of a mesh to be injective is that it either maintains the orientation…

Computational Geometry · Computer Science 2014-02-18 Yaron Lipman

We prove that for any partition of a set which contains an infinite arithmetic (respectively geometric) progression into two disjoint subsets, at least one of these subsets contains an infinite number of triplets such that each triplet is…

General Mathematics · Mathematics 2009-11-24 Florentin Smarandache

We study a family of closely-related distributed graph problems, which we call degree splitting, where roughly speaking the objective is to partition (or orient) the edges such that each node's degree is split almost uniformly. Our findings…

Data Structures and Algorithms · Computer Science 2016-08-11 Mohsen Ghaffari , Hsin-Hao Su

This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers $n,k$ and $p_1\le p_2\le \cdots\le p_k$ such that $p_1+\cdots+p_k=n$ and $k$ divides $\sum_{i=1}^ni$, we study…

Combinatorics · Mathematics 2024-01-03 Ehab Ebrahem , Shlomo Hoory , Dani Kotlar

The catenary degree is an invariant that measures the distance between factorizations of elements within an atomic monoid. In this paper, we classify which finite subsets of $\mathbb Z_{\ge 0}$ occur as the set of catenary degrees of a…

Commutative Algebra · Mathematics 2018-08-15 Christopher O'Neill , Roberto Pelayo

Let $M$ be a complete K\"{a}hler manifold, whose universal covering is biholomorphic to a ball $\mathbb B^m(R_0)$ in $\mathbb C^m$ ($0<R_0\le +\infty$). In this article, we will show that if three meromorphic mappings $f^1,f^2,f^3$ of $M$…

Complex Variables · Mathematics 2021-10-11 Si Duc Quang

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…

Combinatorics · Mathematics 2018-12-12 Daniel Pellicer , Primož Potočnik , Micael Toledo

We construct, for $m\geq 6$ and $2n\leq m$, closed manifolds $M^{m}$ with finite nonzero $\varphi(M^{m},S^{n}$), where $\varphi(M,N)$ denotes the minimum number of critical points of a smooth map $M\to N$. We also give some explicit…

Geometric Topology · Mathematics 2019-01-25 Louis Funar , Cornel Pintea

We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…

Combinatorics · Mathematics 2010-09-27 Dömötör Pálvölgyi

Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…

Logic · Mathematics 2025-11-07 Matthew Harrison-Trainor

In this paper, we study positive as well as non-negative and non-trivial gradings on finite dimensional Lie algebras. We give a different proof that the existence of such a grading on a Lie algebra is invariant under taking field…

Rings and Algebras · Mathematics 2016-03-04 Jonas Deré

For an extension A/B of neither necessarily associative nor necessarily unital rings, we investigate the connection between simplicity of A with a property that we call A-simplicity of B. By this we mean that there is no non-trivial ideal I…

Rings and Algebras · Mathematics 2014-02-17 Patrik Nystedt , Johan Öinert

We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…

Geometric Topology · Mathematics 2023-11-15 Naoki Kitazawa , Osamu Saeki

Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…

Geometric Topology · Mathematics 2021-05-21 Louis Funar

It was proved that whenever $\mathbb{N}$ is partitioned into finitely many cells, one cell must contain arbitrary length arithmetic and geometric progression nicely intertwined, so that one cell must be rich in the sense of containing…

Combinatorics · Mathematics 2012-01-24 Dibyendu De , Ram Krishna Paul

Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…

Combinatorics · Mathematics 2019-03-19 Drago Bokal , Mojca Bračič , Marek Derňár , Petr Hliněný