NRNathan Reading

Nathan Reading

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Nathan Reading has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Cluster scattering diagrams of acyclic affine type

    by Nathan Reading, Salvatore Stella

    We give an explicit construction of the cluster scattering diagram for any acyclic exchange matrix of affine type. We show that the corresponding cluster scattering fan coincides both with the mutation fan and with a fan constructed in the almost positive roots model.

  • Open Access

    Para-exceptional sequences for tame hereditary algebras and McCammond-Sulway lattices

    by Eric J. Hanson, Nathan Reading

    Noncrossing partition posets in a Coxeter group $W$ can fail to be lattices when $W$ is not finite. When the lattice property fails for $W$ of affine type, McCammond and Sulway's construction provides a larger lattice that contains the noncrossing partition poset and that furthermore is a combinatorial Garside structure. We construct a lattice, isomorphic to McCammond and Sulway's lattice, using the representation theory of a corresponding connected tame hereditary algebra and give a representation-theoretic proof that it is a combinatorial Garside structure. To construct the lattice, we introduce para-exceptional sequences and para-exceptional subcategories in the module categories of tame hereditary algebras. Para-exceptional sequences are generalizations of exceptional sequences obtained by enlarging the set of allowed entries to include all non-homogeneous bricks. A para-exceptional subcategory is a subcategory obtained by applying a certain closure-like operator to the wide subcategory generated by a para-exceptional sequence.

  • Open Access

    Noncrossing partitions of an annulus

    by Laura G. Brestensky, Nathan Reading


  • Top Cited Papers
    Open Access

    Lattice theory of torsion classes: Beyond 𝜏-tilting theory

    by Laurent Demonet, Osamu Iyama, Nathan Reading, Idun Reiten, Hugh Thomas

    The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set t o r s A \mathsf {tors} A of torsion classes over a finite-dimensional algebra A A . We show that t o r s A \mathsf {tors} A is a complete lattice which enjoys very strong properties, as bialgebraicity and complete semidistributivity . Thus its Hasse quiver carries the important part of its structure, and we introduce the brick labelling of its Hasse quiver and use it to study lattice congruences of t o r s A \mathsf {tors} A . In particular, we give a representation-theoretical interpretation of the so-called forcing order , and we prove that t o r s A \mathsf {tors} A is completely congruence uniform . When I I is a two-sided ideal of A A , t o r s ( A / I ) \mathsf {tors} (A/I) is a lattice quotient of t o r s A \mathsf {tors} A which is called an algebraic quotient , and the corresponding lattice congruence is called an algebraic congruence . The second part of this paper consists in studying algebraic congruences. We characterize the arrows of the Hasse quiver of t o r s A \mathsf {tors} A that are contracted by an algebraic congruence in terms of the brick labelling. In the third part, we study in detail the case of preprojective algebras Π \Pi , for which t o r s Π \mathsf {tors} \Pi is the Weyl group endowed with the weak order. In particular, we give a new, more representation theoretical proof of the isomorphism between t o r s k Q \mathsf {tors} k Q and the Cambrian lattice when Q Q is a Dynkin quiver. We also prove that, in type A A , the algebraic quotients of t o r s Π \mathsf {tors} \Pi are exactly its Hasse-regular lattice quotients.


  • Open Access

    Lattice theory of torsion classes: Beyond $τ$-tilting theory

    by Laurent Demonet, Osamu Iyama, Nathan Reading, Idun Reiten, Hugh Thomas

    The aim of this paper is to establish a lattice theoretical framework to study the partially ordered set $\operatorname{\mathsf{tors}} A$ of torsion classes over a finite-dimensional algebra $A$. We show that $\operatorname{\mathsf{tors}} A$ is a complete lattice which enjoys very strong properties, as bialgebraicity and complete semidistributivity. Thus its Hasse quiver carries the important part of its structure, and we introduce the brick labelling of its Hasse quiver and use it to study lattice congruences of $\operatorname{\mathsf{tors}} A$. In particular, we give a representation-theoretical interpretation of the so-called forcing order, and we prove that $\operatorname{\mathsf{tors}} A$ is completely congruence uniform. When $I$ is a two-sided ideal of $A$, $\operatorname{\mathsf{tors}} (A/I)$ is a lattice quotient of $\operatorname{\mathsf{tors}} A$ which is called an algebraic quotient, and the corresponding lattice congruence is called an algebraic congruence. The second part of this paper consists in studying algebraic congruences. We characterize the arrows of the Hasse quiver of $\operatorname{\mathsf{tors}} A$ that are contracted by an algebraic congruence in terms of the brick labelling. In the third part, we study in detail the case of preprojective algebras $\Pi$, for which $\operatorname{\mathsf{tors}} \Pi$ is the Weyl group endowed with the weak order. In particular, we give a new, more representation theoretical proof of the isomorphism between $\operatorname{\mathsf{tors}} k Q$ and the Cambrian lattice when $Q$ is a Dynkin quiver. We also prove that, in type $A$, the algebraic quotients of $\operatorname{\mathsf{tors}} \Pi$ are exactly its Hasse-regular lattice quotients.

  • The fundamental theorem of finite semidistributive lattices

    by Nathan Reading, David E Speyer, Hugh Thomas


  • The action of a Coxeter element on an affine root system

    by Nathan Reading, Salvatore Stella

    The characterization of orbits of roots under the action of a Coxeter element is a fundamental tool in the study of finite root systems and their reflection groups. This paper develops the analogous tool in the affine setting, adding detail and uniformity to a result of Dlab and Ringel.


  • An affine almost positive roots model

    by Nathan Reading, Salvatore Stella

    We generalize the almost positive roots model for cluster algebras from finite type to a uniform finite/affine type model. We define a subset \Phi_c of the root system and a compatibility degree on \Phi_c , given by a formula that is new even in finite type. The clusters (maximal pairwise compatible sets of roots) define a complete fan Fan _c(\Phi) . Equivalently, every vector has a unique cluster expansion. We give a piecewise linear isomorphism from the subfan of Fan _c(\Phi) induced by real roots to the \mathbf g -vector fan of the associated cluster algebra. We show that \Phi_c is the set of denominator vectors of the associated acyclic cluster algebra and conjecture that the compatibility degree also describes denominator vectors for non-acyclic initial seeds. We extend results on exchangeability of roots to the affine case.


  • Lattice Homomorphisms Between Weak Orders

    by Nathan Reading

    We classify surjective lattice homomorphisms $W\to W'$ between the weak orders on finite Coxeter groups. Equivalently, we classify lattice congruences $\Theta$ on $W$ such that the quotient $W/\Theta$ is isomorphic to $W'$. Surprisingly, surjective homomorphisms exist quite generally: They exist if and only if the diagram of $W'$ is obtained from the diagram of $W$ by deleting vertices, deleting edges, and/or decreasing edge labels. A surjective homomorphism $W\to W'$ is determined by its restrictions to rank-two standard parabolic subgroups of $W$. Despite seeming natural in the setting of Coxeter groups, this determination in rank two is nontrivial. Indeed, from the combinatorial lattice theory point of view, all of these classification results should appear unlikely a priori. As an application of the classification of surjective homomorphisms between weak orders, we also obtain a classification of surjective homomorphisms between Cambrian lattices and a general construction of refinement relations between Cambrian fans.


  • Open Access

    Scattering fans

    by Nathan Reading

    Scattering diagrams arose in the context of mirror symmetry, Donaldson-Thomas theory, and integrable systems. We show that a consistent scattering diagram with minimal support cuts the ambient space into a complete fan. A special class of scattering diagrams, the cluster scattering diagrams, are closely related to cluster algebras. We show that the cluster scattering fan associated to an exchange matrix $B$ refines the mutation fan for $B$ (a complete fan that encodes the geometry of mutations of $B$). We conjecture that, when $B$ is $n\times n$ for $n>2$, these two fans coincide if and only if $B$ is of finite mutation type.