English
Related papers

Related papers: On fiber diameters of continuous maps

200 papers

We show that the infinite-dimensional Teichmueller space of a Riemann surface whose boundary consists of n closed curves is a holomorphic fiber space over the Teichmueller space of n-punctured surfaces. Each fiber is a complex Banach…

Complex Variables · Mathematics 2009-06-18 David Radnell , Eric Schippers

For almost all Riemannian metrics (in the $C^\infty$ Baire sense) on a compact manifold with boundary $(M^{n+1},\partial M)$, $3\leq (n + 1)\leq 7$, we prove that, for any open subset $V$ of $\partial M$, there exists a compact, properly…

Differential Geometry · Mathematics 2019-09-05 Zhichao Wang

We consider some planar triangular maps. These maps preserve certain fibration of the plane. We assume that there exists an invariant attracting fiber and we study the limit dynamics of those points in the basin of attraction of this…

Dynamical Systems · Mathematics 2015-02-19 Anna Cima , Armengol Gasull , Víctor Mañosa

The commuting graph of a group $G$ is the simple undirected graph whose vertices are the non-central elements of $G$ and two distinct vertices are adjacent if and only if they commute. It is conjectured by Jafarzadeh and Iranmanesh that…

Group Theory · Mathematics 2012-06-20 Michael Giudici , Aedan Pope

Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the…

Differential Geometry · Mathematics 2008-11-13 Siddartha Gadgil , Harish Seshadri

We prove the existence of foliations by area-minimizing hypersurfaces in asymptotically flat (AF) manifolds with arbitrary dimension and arbitrary ends. Also we provide behaviors of those hypersurfaces near the infinity of AF ends and…

Differential Geometry · Mathematics 2026-03-10 Shihang He , Yuguang Shi , Haobin Yu

Milnor's fibration theorem and its generalizations play a central role in the study of singularities of complex and real analytic maps. In the complex analytic case, the Milnor fibration on the sphere is always given by the normalized map…

Complex Variables · Mathematics 2026-01-08 José Luis Cisneros Molina , Aurélio Menegon

A $k$-cycle in a graph is a cycle of length $k.$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3\le k\le n,$ every edge of $G$ lies in a $k$-cycle. It seems difficult to determine the minimum size $f(n)$…

Combinatorics · Mathematics 2024-10-16 Chengli Li , Feng Liu , Xingzhi Zhan

For a smooth expanding map $f$ of the circle, its (unmarked) length spectrum is defined as the set of logarithms of multipliers of periodic orbits of $f$. This spectrum is analogous to the set of lengths of all closed geodesics on…

Dynamical Systems · Mathematics 2025-11-24 Kostiantyn Drach , Vadim Kaloshin

We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…

Algebraic Geometry · Mathematics 2020-03-04 Yves Aubry , Elena Berardini , Fabien Herbaut , Marc Perret

We study the existence and uniqueness problem of compact minimal vertical graphs in $\mathbb{H}^n\times\mathbb{R}$, $n\geq 2$, over bounded domains in the slice $\mathbb{H}^n\times\{0\}$, with non-connected boundary having a finite number…

Differential Geometry · Mathematics 2014-01-22 Aline Mauricio Barbosa

We consider approximation of diameter of a set $S$ of $n$ points in dimension $m$. E$\tilde{g}$ecio$\tilde{g}$lu and Kalantari \cite{kal} have shown that given any $p \in S$, by computing its farthest in $S$, say $q$, and in turn the…

Computational Geometry · Computer Science 2014-10-09 Sharareh Alipour , Bahman Kalantari , Hamid Homapour

Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…

Data Structures and Algorithms · Computer Science 2023-07-18 Amir Abboud , Mina Dalirrooyfard , Ray Li , Virginia Vassilevska-Williams

Let $X$ be an analytic subset of an open neighbourhood $U$ of the origin $\underline{0}$ in $\mathbb{C}^n$. Let $f\colon (X,\underline{0}) \to (\mathbb{C},0)$ be holomorphic and set $V =f^{-1}(0)$. Let $\B_\epsilon$ be a ball in $U$ of…

Algebraic Geometry · Mathematics 2009-05-21 José-Luis Cisneros-Molina , Jose Seade , Jawad Snoussi

We show that for a compact surface without boundary $M$ the set of cw-expansive homeomorphisms is dense in the set of all the homeomorphisms of $M$ with respect to the $C^0$ topology. After this we show that for a generic homeomorphism $f$…

Dynamical Systems · Mathematics 2025-04-02 Alfonso Artigue

We present a new proof of a theorem of Chen and Jiang: for any integer $n>1$, there is a constant $K_n>0$ such that every smooth projective $n$-fold $X$ with $\operatorname{vol}(X)>K_n$ has either the stable birational $2$-canonical map or…

Algebraic Geometry · Mathematics 2025-09-23 Pengjin Wang

Let $f(d)$ be the smallest value for which every bridgeless graph $G$ with diameter $d$ admits a strong orientation $\overrightarrow{G}$ such that the diameter of $\overrightarrow{G}$ is at most $f(d)$. Chv\'atal and Thomassen (1978)…

Combinatorics · Mathematics 2026-05-13 Jifu Lin , Lihua You

We describe non-locally connected planar continua via the concepts of fiber and numerical scale. Given a continuum $X\subset\mathbb{C}$ and $x\in\partial X$, we show that the set of points $y\in \partial X$ that cannot be separated from $x$…

General Topology · Mathematics 2017-03-20 Benoît Loridant , Jun Luo

Around 1960, R. Palais and J. Cerf proved a fundamental result relating spaces of diffeomorphisms and imbeddings of manifolds: If V is a submanifold of M, then the map from Diff(M) to Imb(V,M) that takes f to its restriction to V is locally…

Geometric Topology · Mathematics 2007-05-23 John Kalliongis , Darryl McCullough

We prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as a subgraph. Our result confirms, for…

Combinatorics · Mathematics 2022-07-21 Bruce Reed , Maya Stein