Related papers: On ubiquity problems in infinite digraphs
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
The bienergy of smooth maps between Riemannian manifolds, when restricted to unit vector fields, yields two different variational problems depending on whether one takes the full functional or just the vertical contribution. Their critical…
We give new classes of examples of orbits of the diagonal group in the space of unit volume lattices in R^d for d > 2 with nice (homogeneous) orbit closures, as well as examples of orbits with explicitly computable but irregular orbit…
We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees…
In this short paper we show a sufficient condition for the solvability of the Dirichlet problem at infinity in Riemannian cones (as defined below).This condition is related to a celebrated result of Milnor that classifies parabolic…
We give an alternative proof of the stable manifold theorem as an application of the (right and left) inverse mapping theorem on a space of sequences. We investigate the diffeomorphism class of the global stable manifold, a problem which in…
We prove that Hilbert space is distortable and, in fact, arbitrarily distortable. This means that for all lambda >1 there exists an equivalent norm |.| on l_2 such that for all infinite dimensional subspaces Y of l_2 there exist x,y in Y…
We give a bijective correspondence between the number of nilpotent matrices over a Boolean semiring and the number of directed acyclic graphs on ordered vertices. We then enumerate pairs of maps between two finite sets whose composites are…
We prove that every orientation-preserving homeomorphism of Euclidean space can be expressed as a commutator of two orientation-preserving homeomorphisms. We give an analogous result for annuli. In the annulus case, we also extend the…
In this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the…
Let X be a normed linear space. We examine if every open, convex and unbounded subset of X is equal to the union of a family of open straight half lines. The answer is affirmative if and only if X is finite dimensional.
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
A net $(x_\alpha)$ in a vector lattice $X$ is said to be {unbounded order convergent} (or uo-convergent, for short) to $x\in X$ if the net $(\abs{x_\alpha-x}\wedge y)$ converges to 0 in order for all $y\in X_+$. In this paper, we study…
Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the…
We prove that solutions to elliptic equations in two variables in divergence form, possibly non-selfadjoint and with lower order terms, satisfy the strong unique continuation property.
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…
Let Q be a connected directed quiver with n vertices. We show that Q is representation-infinite if and only if there do exist n isomorphism classes of exceptional modules of some fixed length at least 2.
We provide a characterization of when a coarse equivalence between coarse disjoint unions of expander graphs is close to a bijective coarse equivalence. We use this to show that if the uniform Roe algebras of coarse disjoint unions of…
In this paper, we study oriented bipartite graphs. In particular, we introduce "bitransitive" graphs. Several characterizations of bitransitive bitournaments are obtained. We show that bitransitive bitounaments are equivalent to acyclic…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.