The simplicial boundary of a CAT(0) cube complex

For a CAT(0) cube complex $\mathbf X$, we define a simplicial flag complex $\partial_\Delta\mathbf X$, called the \emph{simplicial boundary}, which is a natural setting for studying non-hyperbolic behavior of $\mathbf X$. We compare $\partial_\Delta\mathbf X$ to the Roller, visual, and Tits boundaries of $\mathbf X$ and give conditions under which the natural CAT(1) metric on $\partial_\Delta\mathbf X$ makes it (quasi)isometric to the Tits boundary. $\partial_\Delta\mathbf X$ allows us to interpolate between studying geodesic rays in $\mathbf X$ and the geometry of its \emph{contact graph} $\Gamma\mathbf X$, which is known to be quasi-isometric to a tree, and we characterize essential cube complexes for which the contact graph is bounded. Using related techniques, we study divergence of combinatorial geodesics in $\mathbf X$ using $\partial_\Delta\mathbf X$. Finally, we rephrase the rank-rigidity theorem of Caprace-Sageev in terms of group actions on $\Gamma\mathbf X$ and $\partial_\Delta\mathbf X$ and state characterizations of cubulated groups with linear divergence in terms of $\Gamma\mathbf X$ and $\partial_\Delta\mathbf X$.Comment: Lemma 3.18 was not stated correctly. This is fixed, and a minor adjustment to the beginning of the proof of Theorem 3.19 has been made as a result. Statements other than 3.18 do not need to change. I thank Abdul Zalloum for the correction. See also: arXiv:2004.01182 (this version differs from previous only by addition of the preceding link, at administrators' request

Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems

Core congestion is inherent in hyperbolic networks

We investigate the impact the negative curvature has on the traffic congestion in large-scale networks. We prove that every Gromov hyperbolic network $G$ admits a core, thus answering in the positive a conjecture by Jonckheere, Lou, Bonahon, and Baryshnikov, Internet Mathematics, 7 (2011) which is based on the experimental observation by Narayan and Saniee, Physical Review E, 84 (2011) that real-world networks with small hyperbolicity have a core congestion. Namely, we prove that for every subset $X$ of vertices of a $\delta$-hyperbolic graph $G$ there exists a vertex $m$ of $G$ such that the disk $D(m,4 \delta)$ of radius $4 \delta$ centered at $m$ intercepts at least one half of the total flow between all pairs of vertices of $X$, where the flow between two vertices $x,y\in X$ is carried by geodesic (or quasi-geodesic) $(x,y)$-paths. A set $S$ intercepts the flow between two nodes $x$ and $y$ if $S$ intersect every shortest path between $x$ and $y$. Differently from what was conjectured by Jonckheere et al., we show that $m$ is not (and cannot be) the center of mass of $X$ but is a node close to the median of $X$ in the so-called injective hull of $X$. In case of non-uniform traffic between nodes of $X$ (in this case, the unit flow exists only between certain pairs of nodes of $X$ defined by a commodity graph $R$), we prove a primal-dual result showing that for any $\rho>5\delta$ the size of a $\rho$-multi-core (i.e., the number of disks of radius $\rho$) intercepting all pairs of $R$ is upper bounded by the maximum number of pairwise $(\rho-3\delta)$-apart pairs of $R$

The visual boundary of Z^2

We introduce ideas from geometric group theory related to boundaries of groups. This is a mostly expository paper. We consider the visual boundary of a free abelian group, and show that it is an uncountable set with the trivial topology

Convexity and the Euclidean metric of space-time

We address the question about the reasons why the "Wick-rotated", positive-definite, space-time metric obeys the Pythagorean theorem. An answer is proposed based on the convexity and smoothness properties of the functional spaces purporting to provide the kinematic framework of approaches to quantum gravity. We employ moduli of convexity and smoothness which are eventually extremized by Hilbert spaces. We point out the potential physical significance that functional analytical dualities play in this framework. Following the spirit of the variational principles employed in classical and quantum Physics, such Hilbert spaces dominate in a generalized functional integral approach. The metric of space-time is induced by the inner product of such Hilbert spaces.Comment: 41 pages. No figures. Standard LaTeX2e. Change of affiliation of the author and mostly superficial changes in this version. Accepted for publication by "Universe" in a Special Issue with title: "100 years of Chronogeometrodynamics: the Status of Einstein's theory of Gravitation in its Centennial Year

The Geometry of Niggli Reduction II: BGAOL -- Embedding Niggli Reduction

Niggli reduction can be viewed as a series of operations in a six-dimensional space derived from the metric tensor. An implicit embedding of the space of Niggli-reduced cells in a higher dimensional space to facilitate calculation of distances between cells is described. This distance metric is used to create a program, BGAOL, for Bravais lattice determination. Results from BGAOL are compared to the results from other metric-based Bravais lattice determination algorithms