activity
20032025
most citedA non-partitionable Cohen-Macaulay simplicial complex

72 citations · 105 across the 22 of their papers we have counts for

collaborators

31 papers

math.CO2025

Domino tilings beyond 2D

Caroline J. Klivans, Nicolau C. Saldanha

There is a rich history of domino tilings in two dimensions. Through a variety of techniques we can answer questions such as: how many tilings are there of a given region or what d…

math.CO2025

The Arboricity Polynomial

Felix Breuer, Caroline J Klivans

We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint in…

math.CO2023

A Three-Regime Theorem for Flow-Firing

Sarah Brauner, Galen Dorpalen-Barry, Selvi Kara +2

Graphical chip-firing is a discrete dynamical system where chips are placed on the vertices of a graph and exchanged via simple firing moves. Recent work has sought to generalize c…

math.CO2022★ 1 cited

Eigenvalues and Critical Groups of Adinkras

Kevin Iga, Caroline Klivans, Jordan Kostiuk +1

Adinkras are signed graphs used to study supersymmetry in physics. We provide an introduction to these objects, and study the properties of their signed adjacency and signed Laplac…

math-ph2020

Supersymmetry and Representation Theory in Low Dimensions

Mathew Calkins, S. James Gates, Caroline Klivans

Beginning from a discussion of the known most fundamental dynamical structures of the Standard Model of physics, extended into the realms of mathematics and theory by the concept o…

math.OC2020★ 1 cited

Clustering with Semidefinite Programming and Fixed Point Iteration

Pedro Felzenszwalb, Caroline Klivans, Alice Paul

We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the s…