Related papers: On fiber diameters of continuous maps

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

We show that a continuous map or a continuous flow on $\R^{n}$ with a certain recurrence relation must have a fixed point. Specifically, if there is a compact set W with the property that the forward orbit of every point in $\R^{n}$…

Let $F\subseteq [0,1]^2$ be a Bedford-McMullen carpet defined by exponents $m>n$, that projects to $[0,1]$ on the $y$-axis. We show that under mild conditions on $F$, there are many non principle lines $\ell$ such that $\dim^* F\cap \ell =…

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

This paper explores the fibers of the principal minor map over a general field. The principal minor map is the map that assigns to each $n\times n$ matrix the $2^n$-vector of its principal minors. In $1984$, Hartfiel and Loewy proposed a…

For three dimensional complete Riemannian manifolds with scalar curvature no less than one, we obtain the sharp upper bound of complete stable minimal surfaces' diameter.

In this paper we study boundedness of bundle diffeomorphism groups over a circle. For a fiber bundle $\pi : M \to S^1$ with fiber $N$ and structure group $\Gamma$ and $r \in {\Bbb Z}_{\geq 0} \cup \{ \infty \}$ we distinguish an integer $k…

We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote…

Given a point and an expanding map on the unit interval, we consider the set of points for which the forward orbit under this map is bounded away from the given point. For maps like multiplication by an integer modulo 1, such sets have full…

We limit the singularities that arise in geometric generic fibers of morphisms between smooth varieties of positive characteristic by studying changes in embedding dimension under inseparable field extensions. We then use this result in the…

In this paper we prove that if a pair of graphs G,H have senders, then they necessarily have connected minimal senders; we also prove that given two fixed graphs that are either 3-connected or triangles there are minimal (G,H)-senders with…

The bloom of complex network study, in particular, with respect to scale-free ones, is considerably triggering the research of scale-free graph itself. Therefore, a great number of interesting results have been reported in the past,…

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \emph{seed} node and is allowed to make queries about neighbours of nodes…

The commuting graph of a group G, denoted by Gamma(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. Let Z_m be the commutative ring of…

We study topologically monotone surjective $W^{1,n}$-maps of finite distortion $f \colon \Omega \to \Omega'$, where $\Omega, \Omega' $ are domains in $\mathbb{R}^n$, $n \geq 2$. If the outer distortion function $K_f \in…

Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…