2 citations · 2 across the 6 of their papers we have counts for
6 papers
Removable trees and matchings in -connected and -edge-connected graphs
Adam D. W. Clay, Tibor Jordán
T. Hasunuma (J. Graph Theory, 2023) conjectured that if is a -connected (resp. -edge-connected) graph with minimum degree , and is a tree of order…
A combinatorial approach to obstructing left-orderability of Dehn fillings
Adam Clay, Junyu Lu, Tjay Staruch
We introduce the conjugate-slope property of knots, a variant of Nie's Property (D), which can be used to study non-left-orderability of fundamental groups arising from Dehn fillin…
Order-detection and non-left-orderable surgeries on links
Adam Clay, Junyu Lu
Beginning with a -manifold having a single torus boundary component, there are several computational techniques in the literature that use a presentation of the fundamental…
Approximate normalizations for approximate density functionals
Adam Clay, Kiril Datchev, Wenlan Miao +3
It seems self-evident that a density functional calculation should be normalized to the number of electrons in the system. We present multiple examples where the accuracy of the ap…
Minimally rigid tensegrity frameworks
Adam D. W. Clay, Tibor Jordán, Sára Hanna Tóth
A -dimensional tensegrity framework is an edge-labeled geometric graph in , which consists of a graph and a map $p:V\to {\mathbb R}^…
Order-detection, representation-detection, and applications to cable knots
Adam Clay, Junyu Lu
Given a -manifold with multiple incompressible torus boundary components, we develop a general definition of order-detection of tuples of slopes on the boundary components o…