4 papers
Removable trees and matchings in -connected and -edge-connected graphs
Adam D. W. Clay, Tibor Jordán, 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…
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…
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…