NERDS 29.0

Overview

Date: October 18, 2026
Place: Wellesley College

Schedule

9:30 Coffee
10:00 Yunting Zhang (University of Connecticut)
10:30 Benjamin Grant (University of Connecticut)
11:00 Janani Lakshmanan (University of Hawai’i at Mānoa alumna)
12 Lunch
2:00 Emma Gruner (College
of the Holy Cross)
3:00 Russell Miller (Queens College & The Graduate Center, CUNY)

Abstract

Benjamin Grant (University of Connecticut)
A Descriptive Combinatorics Approach to Infinitary Quiver Mutation Dynamics

Cluster algebras are certain commutative rings with remarkable combinatorial structures that underpin an area of intense current research focus in modern algebraic combinatorics. These combinatorial structures are governed at their core by quivers (i.e. directed multigraphs with no loops or oriented 2-cycles) and quiver mutations (particular involutive transformations performed locally around a choice of vertex). Even for quivers with only finitely many vertices, many “basic” algorithmic questions about mutation-equivalence remain open (“is mutation-equivalence decidable?” and “is ‘being mutation-equivalent to an acyclic quiver’ decidable?” are such examples). This work aims, in part, to address questions like these in the setting of quivers with countably infinitely many vertices via the language of descriptive set theory. We examine the Borel complexity of relations like mutation-equivalence and properties like mutation-acyclicity. As a byproduct of our approach, we are also able to provide rather natural definitions of “convergence” and “divergence” for infinite sequences of mutations; while various infinite-rank cluster combinatorics papers have given ad hoc notions of convergence, this work gives the first uniform definition (to the best of the author’s knowledge). As a measurement of complexity, we provide a classification of the (non-)density of the domains of convergence and divergence of infinite mutation sequences in one of our spaces of quivers. Pending time, we will also examine the Fraïssé quiver, its behavior under finite and infinite mutation sequences, and open questions about the existence of mutation-closed Fraïssé classes of quivers. This talk is based on arxiv:2604.16660.

Emma Gruner (College of the Holy Cross)
A Baire Category Approach to Besicovitch’s Theorem

One of the fundamental results from geometric measure theory is Besicovitch’s Theorem from 1952, which states that any closed subset of Euclidean space having infinite Hausdorff measure contains a compact subset with positive finite Hausdorff measure. However, the compatibility theoretic and reverse mathematical complexity of this result have not been extensively studied. In this talk, we introduce a variant of the Baire Category Theorem that operates within the context of a fixed closed set, and we show how Besicovitch’s original proof can be reevaluated through that lens. This approach not only confirms that the theorem is provable in the system $\text{ACA}_0$, but it demonstrates how a witnessing subset can be computed from just one Turing jump of the original set.

Janani Lakshmanan (University of Hawai’i at Mānoa alumna)
Unbounded Length Minimal Synchronizing Words for Quantum Channels over Qutrits and Qubits

A quantum variant of the longstanding Černy conjecture was addressed by Grudka et al., who constructed quantum channels with synchronizing words of length 3 for qutrits. We extend their result to arbitrary long minimal synchronizing words, then adjust the technique for the 2-dimensional qubit case.

Russell Miller (Queens College & The Graduate Center, CUNY)
Computable Categoricity for Tree-Presented Profinite Groups

Infinite profinite groups $G$ have size continuum and therefore do not admit examination under the usual notions of computable structure theory. However, they are naturally presented by finite-branching trees, with group elements represented by infinite paths through the tree. For such presentations, we say that $G$ is computably categorical if, for every two computable tree presentations $T_0$ and $T_1$ of $G$ (with computable finite branching and no terminal nodes), there is a Turing functional $\Phi$ that maps paths $Q$ through $T_0$ to paths $\Phi^Q$ through $T_1$ so that the map $Q\mapsto\Phi^Q$ is an isomorphism of groups. In short, all computable tree presentations of $G$ are isomorphic via type-2-computable functions.

We connect this notion with computable categoricity for countable structures, using a scheme for presenting inverse systems of profinite groups that was devised by Cherlin, van den Dries, and Macintyre, and deduce various results about categoricity for the tree presentations.

Yunting Zhang (University of Connecticut)
Distinguishing Numbers of Countable Linear Orders and Their Index-Set Complexity

The distinguishing number of a linear order is the least number of colors needed to eliminate every nonidentity order automorphism. We show that every nonempty countable linear order has distinguishing number (1), (2), or (\aleph_0), and characterize the last case by a local finite-condensation condition: some infinite open interval has uniformly bounded finite blocks. For computable presentations, the corresponding index sets are respectively (\Pi^1_1)-complete, (\Sigma^1_1)-complete, and (\Sigma^0_3)-complete under computable many-one reductions.

Travel Support

Limited funding is provided from the NSF to support participation by students and others to NERDS. If interested, please email Russell Miller.

$$$$