Max Hlavacek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Max Hlavacek has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Chi Huynh
Department of Mathematics, University of Illinois, Urbana, USA
2 shared publications - Steven J. Miller
Department of Mathematics and Statistics, Williams College
2 shared publications - Carsten Peterson
Department of Mathematics University of Michigan Ann Arbor Michigan
1 shared publication Carsten Sprunger
1 shared publication- Eyvindur Ari Palsson
Department of Mathematics, Virginia Tech, Blacksburg, USA
1 shared publication Ian Nicolas
Pacific University
1 shared publication
Latest Publications
- Open Access
Classification of crescent configurations
Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$ times. Since Erd\H{o}s' conjecture in 1989 on the existence of $N$ sufficiently large such that no crescent configurations exist on $N$ or more points, he, Pomerance, and Pal\'asti have given constructions for $n$ up to $8$ but nothing is yet known for $n \geq 9$. Most recently, Burt et. al. had proven that a crescent configuration on $n$ points exists in $\mathbb{R}^{n-2}$ for $n \geq 3$. In this paper, we study the classification of these configurations on $4$ and $5$ points through graph isomorphism and rigidity. Our techniques, which can be generalized to higher dimensions, offer a new viewpoint on the problem through the lens of distance geometry and provide a systematic way to construct crescent configurations.Open AccessClassification of crescent configurations
Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$ times. Since Erd\H{o}s' conjecture in 1989 on the existence of $N$ sufficiently large such that no crescent configurations exist on $N$ or more points, he, Pomerance, and Pal\'asti have given constructions for $n$ up to $8$ but nothing is yet known for $n \geq 9$. Most recently, Burt et. al. had proven that a crescent configuration on $n$ points exists in $\mathbb{R}^{n-2}$ for $n \geq 3$. In this paper, we study the classification of these configurations on $4$ and $5$ points through graph isomorphism and rigidity. Our techniques, which can be generalized to higher dimensions, offer a new viewpoint on the problem through the lens of distance geometry and provide a systematic way to construct crescent configurations. - Open Access
Summand minimality and asymptotic convergence of generalized Zeckendorf decompositions
Given a recurrence sequence $H$, with $H_n = c_1 H_{n-1} + \dots + c_t H_{n-t}$ where $c_i \in \mathbb{N}_0$ for all $i$ and $c_1, c_t \geq 1$, the generalized Zeckendorf decomposition (gzd) of $m \in \mathbb{N}_0$ is the unique representation of $m$ using $H$ composed of blocks lexicographically less than $\sigma = (c_1, \dots, c_t)$. We prove that the gzd of $m$ uses the fewest number of summands among all representations of $m$ using $H$, for all $m$, if and only if $\sigma$ is weakly decreasing. We develop an algorithm for moving from any representation of $m$ to the gzd, the analysis of which proves that $\sigma$ weakly decreasing implies summand minimality. We prove that the gzds of numbers of the form $v_0 H_n + \dots + v_\ell H_{n-\ell}$ converge in a suitable sense as $n \to \infty$, furthermore we classify three distinct behaviors for this convergence. We use this result, together with the irreducibility of certain families of polynomials, to exhibit a representation with fewer summands than the gzd if $\sigma$ is not weakly decreasing.Open AccessSummand minimality and asymptotic convergence of generalized Zeckendorf decompositions
Given a recurrence sequence $H$, with $H_n = c_1 H_{n-1} + \dots + c_t H_{n-t}$ where $c_i \in \mathbb{N}_0$ for all $i$ and $c_1, c_t \geq 1$, the generalized Zeckendorf decomposition (gzd) of $m \in \mathbb{N}_0$ is the unique representation of $m$ using $H$ composed of blocks lexicographically less than $\sigma = (c_1, \dots, c_t)$. We prove that the gzd of $m$ uses the fewest number of summands among all representations of $m$ using $H$, for all $m$, if and only if $\sigma$ is weakly decreasing. We develop an algorithm for moving from any representation of $m$ to the gzd, the analysis of which proves that $\sigma$ weakly decreasing implies summand minimality. We prove that the gzds of numbers of the form $v_0 H_n + \dots + v_\ell H_{n-\ell}$ converge in a suitable sense as $n \to \infty$, furthermore we classify three distinct behaviors for this convergence. We use this result, together with the irreducibility of certain families of polynomials, to exhibit a representation with fewer summands than the gzd if $\sigma$ is not weakly decreasing. - Open Access
Random Matrix Ensembles with Split Limiting Behavior
We introduce a new family of $N\times N$ random real symmetric matrix ensembles, the $k$-checkerboard matrices, whose limiting spectral measure has two components which can be determined explicitly. All but $k$ eigenvalues are in the bulk, and their behavior, appropriately normalized, converges to the semi-circle as $N\to\infty$; the remaining $k$ are tightly constrained near $N/k$ and their distribution converges to the $k \times k$ hollow GOE ensemble (this is the density arising by modifying the GOE ensemble by forcing all entries on the main diagonal to be zero). Similar results hold for complex and quaternionic analogues. We isolate the two regimes by using matrix perturbation results and a nonstandard weight function for the eigenvalues, then derive their limiting distributions using a modification of the method of moments and analysis of the resulting combinatorics.Open AccessRandom Matrix Ensembles with Split Limiting Behavior
We introduce a new family of $N\times N$ random real symmetric matrix ensembles, the $k$-checkerboard matrices, whose limiting spectral measure has two components which can be determined explicitly. All but $k$ eigenvalues are in the bulk, and their behavior, appropriately normalized, converges to the semi-circle as $N\to\infty$; the remaining $k$ are tightly constrained near $N/k$ and their distribution converges to the $k \times k$ hollow GOE ensemble (this is the density arising by modifying the GOE ensemble by forcing all entries on the main diagonal to be zero). Similar results hold for complex and quaternionic analogues. We isolate the two regimes by using matrix perturbation results and a nonstandard weight function for the eigenvalues, then derive their limiting distributions using a modification of the method of moments and analysis of the resulting combinatorics. - Open Access
- 8 July 2016
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 23 (3) , P3.32
A Decomposition of Parking Functions by Undesired Spaces
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 parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the corresponding posets. In particular, they share properties with the noncrossing partition lattice such as local self-duality, a nice characterization of intervals, a readily computable Möbius function, and a symmetric chain decomposition. We also explore connections with order complexes, labeled Dyck paths, and rooted forests.
- 8 July 2016
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 23 (3) , P3.32
Open AccessA Decomposition of Parking Functions by Undesired Spaces
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 parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the corresponding posets. In particular, they share properties with the noncrossing partition lattice such as local self-duality, a nice characterization of intervals, a readily computable Möbius function, and a symmetric chain decomposition. We also explore connections with order complexes, labeled Dyck paths, and rooted forests.