English
Related papers

Related papers: A Whitney map onto the Long Arc

200 papers

In this paper, we consider inverse limits of $[0,1]$ using upper semicontinuous set-valued functions. We aim to expand on a previous paper exploring the relationship between the existence periodic points of a continuous function to the…

General Topology · Mathematics 2022-09-13 Tavish Dunn , David Ryden

We show that there are no tight nonholomorphic maps from irreducible domains into exceptional codomains, the only exception being the already known tight nonholomorphic maps from the Poincare disc. This follows up on previous work by the…

Differential Geometry · Mathematics 2014-10-30 Oskar Hamlet , Takayuki Okuda

In 1935, Whitney constructed a smooth function for which the Morse-Sard Theorem does not hold. Whitney's construction is closely related to certain compact connected set, which is called Whitney set now. From then on, there are a lot of…

Metric Geometry · Mathematics 2021-10-25 Qi-han Yuan , Yuan Zhang

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

Dynamical Systems · Mathematics 2022-04-20 Guizhen Cui , Yan Gao , Jinsong Zeng

We study the set of intrinsic metrics on a given graph. This is a convex compact set and it carries a natural order. We investigate existence of largest elements with respect to this order. We show that the only locally finite graphs which…

Functional Analysis · Mathematics 2023-08-25 Daniel Lenz , Marcel Schmidt , Felix Seifert

A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…

Dynamical Systems · Mathematics 2021-11-04 Georgios Lamprinakis

Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…

Combinatorics · Mathematics 2022-04-27 Donald Saari

We introduce and develop fine shape, which has a very simple definition and aims to supersede all previously known shape theories for metrizable spaces. The problem with known shape theories of metrizable spaces is illustrated by the…

Algebraic Topology · Mathematics 2022-11-22 Sergey A. Melikhov

The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…

Combinatorics · Mathematics 2016-03-22 Usman Ali , Syed Ahtisham Bokhary , Khola Wahid

In this article we study two "strong" topologies for spaces of smooth functions from a finite-dimensional manifold to a (possibly infinite-dimensional) manifold modeled on a locally convex space. Namely, we construct Whitney type topologies…

General Topology · Mathematics 2018-05-14 Eivind Otto Hjelle , Alexander Schmeding

We prove that the existence of a non-special tree of size $\lambda$ is equivalent to the existence of an uncountably chromatic graph with no $K_{\omega_1}$ minor of size $\lambda$, establishing a connection between the special tree number…

Logic · Mathematics 2022-12-06 Dávid Uhrik

In the field of dynamical systems, it is not rare to meet irregular functions, which are typically H{\"o}lder but not Lipschitz (e.g. the Weierstrass functions). Our goal is to scratch the surface of the following question: what happens if…

Dynamical Systems · Mathematics 2022-10-25 Benoît Kloeckner , Nicolae Mihalache

A graph matroid family $\mathcal{M}$ is a family of matroids $\mathcal{M}(G)$ defined on the edge set of each finite graph $G$ in a compatible and isomorphism-invariant way. We say that $\mathcal{M}$ has the Whitney property if there is a…

Combinatorics · Mathematics 2026-03-04 Dániel Garamvölgyi

We consider two basic problems of algebraic topology, the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given…

Computational Geometry · Computer Science 2013-02-12 Martin Cadek , Marek Krcal , Jiri Matousek , Lukas Vokrinek , Uli Wagner

We give an equivalent condition for the existence of invariant Gibbs measures for sequences of continuous functions on one-sided subshifts and, more generally, for the existence of Gibbs measures. These extend the results of Kim [6] and…

Dynamical Systems · Mathematics 2026-05-29 Yuki Yayama

We relate the existence problem of harmonic maps into $S^2$ to the convex geometry of $S^2$. On one hand, this allows us to construct new examples of harmonic maps of degree 0 from compact surfaces of arbitrary genus into $S^2$. On the…

Differential Geometry · Mathematics 2019-11-05 Renan Assimos , Jürgen Jost

We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…

Combinatorics · Mathematics 2024-01-22 Francesca Arrigo , Desmond J. Higham , Vanni Noferini , Ryan Wood

We establish a weighted version of the $H^p$-theory of quasiconformal mappings.

Complex Variables · Mathematics 2019-04-02 Sita Benedict , Pekka Koskela , Xining Li

We show that for every graph $H$, there is a hereditary weakly sparse graph class $\mathcal C_H$ of unbounded treewidth such that the $H$-free (i.e., excluding $H$ as an induced subgraph) graphs of $\mathcal C_H$ have bounded treewidth.…

Combinatorics · Mathematics 2025-04-02 Bogdan Alecu , Édouard Bonnet , Pedro Bureo Villafana , Nicolas Trotignon

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…

Logic in Computer Science · Computer Science 2023-02-24 Libor Barto , Bertalan Bodor , Marcin Kozik , Antoine Mottet , Michael Pinsker