AAAaron Abrams

Aaron Abrams

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Aaron Abrams has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Yet Another Species of Forbidden-distances Chromatic Number

    by Aaron Abrams, Peter Johnson

    This 2001 paper introduces a new type of chromatic number for point sets.

  • Open Access

    Integer Area Dissections of Lattice Polygons via a Non-Abelian Sperner's Lemma

    by Aaron Abrams, Jamie Pommersheim

    We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.

  • Open Access

    Integrality relations for polygonal dissections

    by Aaron Abrams, James Pommersheim

    Given a parallelogram dissected into triangles, the area of any one of the triangles of the dissection is integral over the ring generated by the areas of the other triangles. Given a trapezoid dissected into triangles, the area of any triangle determined by either diagonal of the trapezoid is integral over the ring generated by the areas of the triangles in the dissection. In both cases, the integrality relations are invariant under deformation of the dissection. The trapezoid theorem implies and provides a new context for Monsky's equidissection theorem that a square cannot be dissected into an odd number of triangles of equal area. A corollary of these results is that the area polynomials for parallelograms we introduced and studied in previous work (2014; 2022; 2023) have all leading coefficients equal to ±1.

  • On eigenvalue gaps of integer matrices

    by Aaron Abrams, Zeph Landau, Jamie Pommersheim, Nikhil Srivastava

    Given an n × n n\times n matrix with integer entries in the range [ − h , h ] [-h,h] , how close can two of its distinct eigenvalues be? The best previously known examples (Lu [Minimum eigenvalue separation, ProQuest LLC, Ann Arbor, MI, 1992. Thesis (Ph.D.)–University of California, Berkeley; Wilkinson [The algebraic eigenvalue problem, Monographs on Numerical Analysis, The Clarendon Press, Oxford University Press, New York, 1988]) have a minimum gap of h − O ( n ) h^{-O(n)} . Here we give an explicit construction of matrices with entries in [ 0 , h ] [0,h] with two eigenvalues separated by at most h − n 2 / 16 + o ( n 2 ) h^{-n^2/16+o(n^2)} . Up to a constant in the exponent, this agrees with the known lower bound of Ω ( ( 2 n ) − n 2 h − n 2 ) \Omega ((2\sqrt {n})^{-n^2}h^{-n^2}) (Mahler [Michigan Math. J. 11 (1964), pp. 257–262]). Bounds on the minimum gap are relevant to the worst case analysis of algorithms for diagonalization and computing canonical forms of integer matrices (e.g. Dey et al. [Bit complexity of Jordan normal form and polynomial spectral factorization, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2023, pp. Art. No. 42]). In addition to our explicit construction, we show there are many matrices with a slightly larger gap of roughly h − n 2 / 32 h^{-n^2/32} . We also construct 0-1 matrices which have two eigenvalues separated by at most 2 − n 2 / 64 + o ( n 2 ) 2^{-n^2/64+o(n^2)} .


  • Open Access

    On Eigenvalue Gaps of Integer Matrices

    by Aaron Abrams, Zeph Landau, Jamie Pommersheim, Nikhil Srivastava

    Given an $n\times n$ matrix with integer entries in the range $[-h,h]$, how close can two of its distinct eigenvalues be? The best previously known examples have a minimum gap of $h^{-O(n)}$. Here we give an explicit construction of matrices with entries in $[0,h]$ with two eigenvalues separated by at most $h^{-n^2/16+o(n^2)}$. Up to a constant in the exponent, this agrees with the known lower bound of $\Omega((2\sqrt{n})^{-n^2}h^{-n^2})$ \cite{mahler1964inequality}. Bounds on the minimum gap are relevant to the worst case analysis of algorithms for diagonalization and computing canonical forms of integer matrices. In addition to our explicit construction, we show there are many matrices with a slightly larger gap of roughly $h^{-n^2/32}$. We also construct 0-1 matrices which have two eigenvalues separated by at most $2^{-n^2/64+o(n^2)}$.

  • Open Access

    Generalized Dissections and Monsky's Theorem

    by Aaron Abrams, Jamie Pommersheim

    Monsky's celebrated equidissection theorem follows from his more general proof of the existence of a polynomial relation $f$ among the areas of the triangles in a dissection of the unit square. More recently, the authors studied a different polynomial $p$, also a relation among the areas of the triangles in such a dissection, that is invariant under certain deformations of the dissection. In this paper we study the relationship between these two polynomials. We first generalize the notion of dissection, allowing triangles whose orientation differs from that of the plane. We define a deformation space of these generalized dissections and we show that this space is an irreducible algebraic variety. We then extend the theorem of Monsky to the context of generalized dissections, showing that Monsky's polynomial $f$ can be chosen to be invariant under deformation. Although $f$ is not uniquely defined, the interplay between $p$ and $f$ then allows us to identify a canonical pair of choices for the polynomial $f$. In many cases, all of the coefficients of the canonical $f$ polynomials are positive. We also use the deformation-invariance of $f$ to prove that the polynomial $p$ is congruent modulo 2 to a power of the sum of its variables.

  • Open Access

    Group trisections and smooth 4–manifolds

    by Aaron Abrams, David Gay, Robion Kirby


  • Open Access

    Sums of twisted circulants

    by Aaron Abrams, Henry Landau, Zeph Landau, James Pommersheim

    The rate of convergence of simple random walk on the Heisenberg group over $Z/nZ$ with a standard generating set was determined by Bump et al [1,2]. We extend this result to random walks on the same groups with an arbitrary minimal symmetric generating set. We also determine the rate of convergence of simple random walk on higher-dimensional versions of the Heisenberg group with a standard generating set. We obtain our results via Fourier analysis, using an eigenvalue bound for sums of twisted circulant matrices. The key tool is a generalization of a version of the Heisenberg Uncertainty Principle due to Donoho-Stark [4].