90 citations · 166 across the 9 of their papers we have counts for
10 papers
Community Detection in Hypergraphs via Mutual Information Maximization
Jurgen Kritschgau, Daniel Kaiser, Oliver Alvarado Rodriguez +7
The hypergraph community detection problem seeks to identify groups of related nodes in hypergraph data. We propose an information-theoretic hypergraph community detection algorith…
A cut-by-curves criterion for overconvergent of -isocrystals
Thomas Grubb, Kiran S. Kedlaya, James Upton
Let be a smooth scheme over a finite field. It is conjectured that a convergent -isocrystal on is overconvergent if its restriction to every curve contained in is ov…
Set Partition Patterns and the Dimension Index
Thomas Grubb, Frederick Rajasekaran
The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set…
Pattern Matching in Set Partitions is NP-Complete
Thomas Grubb
In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is…
Cyclotomic Points and Algebraic Properties of Polygon Diagonals
Thomas Grubb, Christian Woll
By viewing the regular -gon as the set of th roots of unity in the complex plane we transform several questions regarding polygon diagonals into when a polynomial vanishes wh…
Threshold Progressions in a Variety of Covering and Packing Contexts
Anant Godbole, Thomas Grubb, Kyutae Han +1
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a…