22 citations · 77 across the 14 of their papers we have counts for
17 papers
The regularity of almost all edge ideals
Alexander Engström, Milo Orlich
A fruitful contemporary paradigm in graph theory is that almost all graphs that do not contain a certain subgraph have common structural characteristics. The "almost" is crucial, w…
Standard complexes of matroids and lattice paths
Alexander Engström, Raman Sanyal, Christian Stump
Motivated by Gröbner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain sub…
Graded Expectations: Betti numbers and anti-lecture hall compositions of random threshold graphs
Alexander Engström, Christian Go, Matthew T. Stamps
This paper examines the one-to-one-to-one correspondence between threshold graphs, Betti numbers of quotients of polynomial rings by -linear ideals, and anti-lecture hall compos…
Transfer-Matrix Methods meet Ehrhart Theory
Alexander Engström, Florian Kohl
Transfer-Matrix Methods originated in physics where they were used to count the number of allowed particle states on a structure whose width is a parameter. Typically, the numb…
Maximum Number of Modes of Gaussian Mixtures
Carlos Améndola, Alexander Engström, Christian Haase
Gaussian mixture models are widely used in Statistics. A fundamental aspect of these distributions is the study of the local maxima of the density, or modes. In particular, it is n…
Geometric juggling with q-analogues
Alexander Engström, Lasse Leskelä, Harri Varpanen
We derive a combinatorial equilibrium for bounded juggling patterns with a random, -geometric throw distribution. The dynamics are analyzed via rook placements on staircase Ferr…