activity
20002026
most citedOperads in iterated monoidal categories

41 citations · 99 across the 7 of their papers we have counts for

collaborators

7 papers

math.CO2026

Some Central Digraphs and their Automorphisms

Jacob A. Siehler

We define a family of finite directed graphs on vertex set , where has mul…

math.CO2024

Look, There's More to Say about Conway's Look and Say Sequence

Greg Dresden, Jacob Siehler

We take Conway's Look and Say Sequence into a base-3 world, and we discover that there are only 24 interesting and irreducible sequences in base 3.

math.CO2014

Selections Without Adjacency on a Rectangular Grid

Jacob A. Siehler

Using T(m,n;k) to denote the number of ways to make a selection of k squares from an (m x n) rectangular grid with no two squares in the selection adjacent, we give a formula for T…

math.AT2007★ 41 cited

Operads in iterated monoidal categories

Stefan Forcey, Jacob Siehler, Seth Sowers

The structure of a -fold monoidal category as introduced by Balteanu, Fiedorowicz, Schwänzl and Vogt can be seen as a weaker structure than a symmetric or even braided monoidal…

math.CT2004★ 2 cited

Combinatorial n-fold monoidal categories and n-fold operads

S. Forcey, J. Siehler, E. Seth Sowers

Operads were originally defined as V-operads, that is, enriched in a symmetric or braided monoidal category V. The symmetry or braiding in V is required in order to describe the as…

math.QA2002★ 31 cited

Near-group categories

Jacob Siehler

We consider the possibility of semisimple tensor categories whose fusion rule includes exactly one noninvertible simple object. Conditions are given for the existence or nonexisten…