Related papers: Stepanov Differentiability Theorem for intrinsic g…

In the Euclidean setting the celebrated Aleksandrov-Busemann-Feller theorem states that convex functions are a.e. twice differentiable. In this paper we prove that a similar result holds in the Heisenberg group, by showing that every…

Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…

Network data can be conveniently modeled as a graph signal, where data values are assigned to the nodes of a graph describing the underlying network topology. Successful learning from network data requires methods that effectively exploit…

In this paper we study the Reidemeister spectrum of 2-step nilpotent groups associated to graphs. We develop three methods, based on the structure of the graph, that can be used to determine the Reidemeister spectrum of the associated group…

We prove an analog of Lagrange's Theorem for continued fractions on the Heisenberg group: points with an eventually periodic continued fraction expansion are those that satisfy a particular type of quadratic form, and vice-versa.

We define Khovanov homology mod 2 for graph-links.

We prove a homological stability theorem for the subgroup of the mapping class group acting as the identity on some fixed portion of the first homology group of the surface. We also prove a similar theorem for the subgroup of the mapping…

We prove Schlichting's theorem for approximate subgroups: if $\mathcal{X}$ is a uniform family of commensurable approximate subgroups in some ambient group, then there exists an invariant approximate subgroup commensurable with…

We give an explicit Singular Value Decomposition of the sub-Riemannian X-ray transform on the Heisenberg group with compact center. By studying the singular values, we obtain a two-radius theorem for integrals over sub-Riemannian geodesics.…

We establish splitter theorems for graph immersions for two families of graphs, $k$-edge-connected graphs, with $k$ even, and 3-edge-connected, internally 4-edge-connected graphs. As a corollary, we prove that every $3$-edge-connected,…

We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

We study the dynamical behaviors of degenerate stochastic differential equations (SDEs). We select an auxiliary Fisher information functional as the Lyapunov functional. Using generalized Fisher information, we conduct the Lyapunov…

We study a class of graphs that represent local independence structures in stochastic processes allowing for correlated error processes. Several graphs may encode the same local independencies and we characterize such equivalence classes of…

In this paper we obtain the stability theorem for the independence number of $G(n, r, 1)$ graphs. This result was previously stated in the paper of M. Pyaderkin but the proof there was incorrect. We introduce the correct proof of the key…

We develop a homotopy theory of directed graphs based on cubical homotopy groups, also referred to as A-groups or reduced GLMY homotopy groups. Localizing the category of directed graphs at morphisms that induce isomorphisms on these groups…

We prove that, for each circle graph $H$, every graph with sufficiently large rank-width contains a vertex-minor isomorphic to $H$.

We prove a $C^m$ Lusin approximation theorem for horizontal curves in the Heisenberg group. This states that every absolutely continuous horizontal curve whose horizontal velocity is $m-1$ times $L^1$ differentiable almost everywhere…

We present a new algorithm for computing the first discrete homology group of a graph. By testing the algorithm on different data sets of random graphs, we find that it significantly outperforms other known algorithms.

We prove two isomorphism-invariance theorems for groupoids associated with ultragraphs. These theorems characterize ultragraphs for which the topological full group of an associated groupoid is an isomorphism invariant. These results extend…