activity
20022026
most citedIntrinsically linked graphs and even linking number

9 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2026

Class-uniformly resolvable designs with all but one block having size two

Karen Cordova, Alexander J. Diesl, Micaela Roth +1

A Class-Uniformly Resolvable Design (CURD) is a resolvable design in which each parallel class has the same block structure. We study CURDS in which each parallel class contains on…

math.RA2009★ 1 cited

A note on completeness in the theory of strongly clean rings

Alexander J. Diesl, Thomas J. Dorsey

Many authors have investigated the behavior of strong cleanness under certain ring extensions. In this note, we prove that if is a ring which is complete with respect to an ide…

math.RA2009★ 1 cited

A Characterization of Certain Morphic Trivial Extensions

Alexander J. Diesl, Thomas J. Dorsey, Warren Wm. McGovern

Given a ring , we study the bimodules for which the trivial extension is morphic. We obtain a complete characterization in the case where is left perfect, a…

math.GT2005★ 9 cited

Intrinsically linked graphs and even linking number

Thomas Fleming, Alexander Diesl

We study intrinsically linked graphs where we require that every embedding of the graph contains not just a non-split link, but a link that satisfies some additional property. Exam…

math.NT2002★ 4 cited

A Dual Approach to Triangle Sequences: A Multidimensional Continued Fraction Algorithm

S. Assaf, L. Chen, T. Cheslack-Postava +5

A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is present…