Related papers: Relative Vertex Asphericity
Relative notions of combinatorial asphericity have been used to prove that injective labeled oriented trees (which encode spines of ribbon 2-knots) are aspherical. This article presents an overview and comparison of the different notions of…
We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of…
A labeled oriented tree is called injective if each generator occurs at most once as an edge label. We show that injective labeled oriented trees are aspherical. The proof relies on a new relative asphericity test based on a lemma of…
Labeled oriented trees, LOT's, encode spines of ribbon discs in the 4-ball and ribbon 2-knots in the 4-sphere. The unresolved asphericity question for these spines is a major test case for Whitehead's asphericity conjecture. In this paper…
A 2-complex $K$ has collapsing non-positive immersion if for every combinatorial immersion $X\to K$, where $X$ is finite, connected and does not allow collapses, either $\chi(X)\le 0$ or $X$ is point. This concept is due to Wise who also…
The Loop Vertex Expansion (LVE) is a quantum field theory (QFT) method which explicitly computes the Borel sum of Feynman perturbation series. This LVE relies in a crucial way on symmetric tree weights which define a measure on the set of…
We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to…
If a complex $X$ is a subcomplex of a diagrammatically reducible 2-complex $Y$ that has locally indicable fundamental group, then $X$ has locally indicable fundamental group. This is a consequence of the Corson-Trace characterization of…
We investigate relative versions of dualizability designed for relative versions of topological field theories (TFTs), also called twisted TFTs, or quiche TFTs in the context of symmetries. In even dimensions we show an equivalence between…
A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…
We introduce a new generalization of relative entropy to non-negative vectors with sums $\gt 1$. We show in a purely combinatorial setting, with no probabilistic considerations, that in the presence of linear constraints defining a convex…
This paper presents two approaches to quantifying and visualizing variation in datasets of trees. The first approach localizes subtrees in which significant population differences are found through hypothesis testing and sparse classifiers…
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…
This paper begins the exploration of what we call measures of association between two irreducible complex projective varieties of the same dimension. The idea is to study from various points of view the minimal complexity of correspondences…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
This work presents a Virtual Element Method (VEM) formulation tailored for two-dimensional axisymmetric problems in linear elasticity. By exploiting the rotational symmetry of the geometry and loading conditions, the problem is reduced to a…
A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…
We shall define the relative $\dbar$-complex and study the curvature properties of the associated vector bundles. As an application, we shall prove that Yamaguchi's theory on subharmonicity of the Green operator can be seen as a curvature…
We propose tests for the null hypothesis that the law of a complex-valued random vector is circularly symmetric. The test criteria are formulated as $L^2$-type criteria based on empirical characteristic functions, and they are convenient…