2 citations · 3 across the 5 of their papers we have counts for
5 papers
Enumerating submonoids of finite commutative monoids
Caoilainn Kirkpatrick, Amelie el Mahmoud, Kyle Ormsby +6
Given a finite commutative monoid , we show that submonoids of - where is equipped with the max operation - may be enumerated via t…
Combinatorics of factorization systems on lattices
Jishnu Bose, Tien Chih, Hannah Housden +4
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in…
Transfer systems for rank two elementary Abelian groups: characteristic functions and matchstick games
Linus Bao, Christy Hazel, Tia Karkos +6
We prove that Hill's characteristic function for transfer systems on a lattice surjects onto interior operators for . Moreover, the fibers of have unique maxima whic…
The combinatorics of operads for and
Scott Balchin, Ethan MacBrough, Kyle Ormsby
We provide a general recursive method for constructing transfer systems on finite lattices. Using this we calculate the number of homotopically distinct operads for dihe…
Lifting operads from conjugacy data
Scott Balchin, Ethan MacBrough, Kyle Ormsby
We isolate a class of groups -- called lossless groups -- for which homotopy classes of - operads are in bijection with certain restricted transfer systems on the pose…