activity
20162026
most citedSummand minimality and asymptotic convergence of generalized Zeckendorf decompositions

9 citations · 9 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2026

Ehrhart -distributions

Benjamin Braun, Max Hlavacek, Cesar J. Meza +2

Every polynomial with real non-negative coefficients yields a finite probability distribution after normalization. The Ehrhart -polynomial of a lattice polytope is a non-n…

math.CO2023

Signed Poset Polytopes

Matthias Beck, Max Hlavacek

Stanley introduced in 1986 the order polytope and the chain polytope for a given finite poset. These polytopes contain much information about the poset and have given rise to impor…

math.CO2020

Subdivisions of Shellable Complexes

Max Hlavacek, Liam Solus

In geometric, algebraic, and topological combinatorics, the unimodality of combinatorial generating polynomials is frequently studied. Unimodality follows when the polynomial is (r…

math.CO2016

Classification of crescent configurations

Rebecca F. Durst, Max Hlavacek, Chi Huynh +2

Let points be in crescent configurations in if they lie in general position in and determine distinct distances, such that for every $1 \leq…

math-ph2016

Random Matrix Ensembles with Split Limiting Behavior

Paula Burkhardt, Peter Cohen, Jonathan Dewitt +6

We introduce a new family of random real symmetric matrix ensembles, the -checkerboard matrices, whose limiting spectral measure has two components which can be dete…

math.NT2016★ 9 cited

Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions

Katherine Cordwell, Max Hlavacek, Chi Huynh +3

Given a recurrence sequence , with where for all and , the generalized Zeckendorf decomposi…

math.CO2016

A Decomposition of Parking Functions by Undesired Spaces

Melody Bruce, Michael Dougherty, Max Hlavacek +2

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of par…