Essential dimension lowering mappings having dense deficiency set
Mladen Bestvina
Abstract
Mladen Bestvina
Abstract
Two classes of surjective maps $f:{S^m} \to {S^n}$ that are one-to-one over the image of a dense set are constructed. We show that for $m,n \geq 3$ there is a monotone surjection $f:{S^m} \to {S^n}$ that is one-to-one over the image of a dense set; and for $3 \leq n \leq m \leq 2n - 3$, each element of ${\pi _m}({S^n})$ can be represented as a monotone surjection $f:{S^m} \to {S^n}$ that is one-to-one over the image of a dense set.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Two classes of surjective maps $f:{S^m} \to {S^n}$ that are one-to-one over the image of a dense set are constructed. We show that for $m,n \geq 3$ there is a monotone surjection $f:{S^m} \to {S^n}$ that is one-to-one over the image of a dense set; and for $3 \leq n \leq m \leq 2n - 3$, each element of ${\pi _m}({S^n})$ can be represented as a monotone surjection $f:{S^m} \to {S^n}$ that is one-to-one over the image of a dense set.
Key concepts: Surjective function, Mathematics, Monotone polygon, Image (mathematics), Dimension (graph theory), Combinatorics, Set (abstract data type), Discrete mathematics