arXiv subjects

Benjamin Blanchette

Publications and source records attributed to Benjamin Blanchette.

5 recordsLinked to original sources

arXiv2025

Stabilization of the Spread-Global Dimension

Motivated by constructions from applied topology, there has been recent interest in the homological algebra of linear representations of posets, particularly in the context of homological algebra relative to non-standard exact structures. A prominent example is the spread exact structure on the category of representations of a fixed poset, in which the indecomposable projectives are the spread representations (that is, the indicator representations of convex and connected subsets). The spread-global dimension is known to be finite for finite posets and not uniformly bounded on the collection of all Cartesian products between two arbitrary finite total orders. It was conjectured in [AENY23] that the spread-global dimension is uniformly bounded on the collection of all Cartesian products between a fixed finite total order and an arbitrary finite total order. We provide a positive answer to this conjecture and, more generally, prove that the spread-global dimension is uniformly bounded on the collection of all Cartesian products between a fixed finite poset and an arbitrary finite total order. In doing so, we also establish the existence of finite spread-resolutions for finitely presented representations of arbitrary grid posets.

math.RT↗

arXiv2023

Exact structures for persistence modules

We discuss applications of exact structures and relative homological algebra to the study of invariants of multiparameter persistence modules. This paper is mostly expository, but does contain a pair of novel results. Over finite posets, classical arguments about the relative projective modules of an exact structure make use of Auslander-Reiten theory. One of our results establishes a new adjunction which allows us to ``lift'' these arguments to certain infinite posets over which Auslander-Reiten sequences do not always exist. We give several examples of this lifting, in particular highlighting the non-existence and existence of resolutions by upsets when working with finitely presentable representations of the plane and of the closure of the positive quadrant, respectively. We then restrict our attention to finite posets. In this setting, we discuss the relationship between the global dimension of an exact structure and the representation dimension of the incidence algebra of the poset. We conclude with our second novel contribution. This is an explicit description of the irreducible morphisms between relative projective modules for several exact structures which have appeared previously in the literature.

math.AT↗

arXiv2021

Homological approximations in persistence theory

We define a class of invariants, which we call homological invariants, for persistence modules over a finite poset. Informally, a homological invariant is one that respects some homological data and takes values in the free abelian group generated by a finite set of indecomposable modules. We focus in particular on groups generated by "spread modules", which are sometimes called "interval modules" in the persistence theory literature. We show that both the dimension vector and rank invariant are equivalent to homological invariants taking values in groups generated by spread modules. We also show that the free abelian group generated by the "single-source" spread modules gives rise to a new invariant which is finer than the rank invariant. They are also thankful to an anonymous referee for their thorough reading of this paper and suggestions for improvement.

math.AT↗

arXiv2019

Quasi-automatic semigroups

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a rational relation. This class of semigroups contains previously considered semigroups and groups (Sakarovitch, Epstein et al., Campbell et al.). Membership of a semigroup to this class does not depend on the choice of the generators. These semigroups are rationally presented. Representatives may be computed in exponential time. Their word problem is decidable in exponential time. They enjoy a property similar to the so-called Lipschitz property, or fellow traveler property. If graded, they are automatic. In the case of groups, they are finitely presented with an exponential isoperimetric inequality and they are characterized by the weak Lipschitz property.

math.GR↗

arXiv2019

Quasi-automatic groups are asynchronously automatic

A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a quasi-automatic semigroup for which these rational relations are also recognisable by two-tape automata. We show that when such a semigroup happens to be a group, the converse actually holds, meaning quasi-automatic groups are asynchronously automatic.

math.GR↗