arXiv subjects

Paul E. Gunnells

Publications and source records attributed to Paul E. Gunnells.

At least 19 recordsLinked to original sources

arXiv2026

Black-white polynomials of graphs and generating functions

Let G be a graph. The black-white polynomial W_G(t) enumerates colorings of the vertices of G with two colors (black and white), where the power of t keeps track of how many white vertices have an even number of black neighbors. Such polynomials appear in quantum information theory, where they are used to capture properties of the entanglement in certain quantum states described by graphs. In this paper we describe how to use generating functions to compute these polynomials for various families X of graphs. Our main results are the following: (i) we describe some constructions under which X leads to a rational generating function; (ii) we use a matrix model to construct the exponential generating function of the black-white polynomials of all graphs; and (iii) we generalize a construction of Wright to build exponential generating functions of black-white polynomials for graphs of a given loop number.

math.CO↗

arXiv2026

Sector length distributions of recursively definable graph states through analytic combinatorics

The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the $k$-body correlations amongst the different systems, and has been used to study entanglement and error correction. A succinct description of a quantum state's SLD can be obtained by representing it through the coefficients of an appropriate weight enumerator polynomial, yielding bounds on fidelity under depolarizing noise and on multipartite entanglement. However, such expressions quickly grow out of hand and are generally difficult to achieve analytically, reflecting the computational hardness of the SLD. We sidestep this problem and, instead of a single state's SLDs, encode a family of quantum state's SLD as a generating function. We then find closed-form expressions for a large class of graph states which we call `recursively definable' and which include many common graphs such as path graphs, cycle graphs, star graphs, grid graphs, and more. As direct corollary, we obtain analytical expressions for such graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement criterion. Our work opens up the use of generating functions and more generally analytic combinatorics to solve problems in quantum information theory.

quant-ph↗

arXiv2024

Explicit sharbly cycles at the virtual cohomological dimension for SL_n(Z)

Denote the virtual cohomological dimension of SL_n(Z) by t=n(n-1)/2. Let St denote the Steinberg module of SL_n(Q) tensored with Q. Let Sh_* denote the sharbly resolution of the Steinberg module St. By Borel-Serre duality, the one-dimensional Q-vector space H^0(SL_n(Z), Q) is isomorphic to H_t(SL_n(Z),St). We find an explicit generator of H_t(SL_n(Z),St) in terms of sharbly cycles and cosharbly cocycles. These methods may extend to other degrees of cohomology of SL_n(Z).

math.GT↗

arXiv2024

Cohomology with Sym^g coefficients for congruence subgroups of SL_4(Z) and Galois representations

We extend the computations in our prior work to find the cohomology in degree five of a congruence subgroup Gamma of SL_4(Z) with coefficients in Sym^g(K^4), twisted by a nebentype character eta, along with the action of the Hecke algebra. This is the top cuspidal degree. In this paper we take K to be a finite field of large characteristic, as a proxy for the complex numbers. For each Hecke eigenclass found, we produce the unique Galois representation that appears to be attached to it. The computations require modifications to our previous algorithms to accommodate the fact that the coefficients are not one-dimensional.

math.NT↗

arXiv2023

Hypergraph matrix models and generating functions

Recently we introduced the hypergraph matrix model (HMM), a Hermitian matrix model generalizing the classical Gaussian Unitary Ensemble (GUE). In this model the Gaussians of the GUE, whose moments count partitions of finite sets into pairs, are replaced by formal measures whose moments count set partitions into parts of a fixed even size 2m >= 2. Just as the expectations of the trace polynomials Tr X^{2r} in the GUE produce polynomials counting unicellular orientable maps of different genera, in the HHM these expectations give polynomials counting certain unicelled edge-ramified CW complexes with extra data that we call (orientable CW) maps with instructions. In this paper we describe generating functions for maps with instructions of fixed genus and with the number of vertices arbitrary. Our results are motivated by work of Wright. In particular Wright computed generating functions of connected graphs of fixed first Betti number as rational functions in the rooted tree function T (x), given as the solution to the functional relation x = T e^{-T}.

math.CO↗

arXiv2023

On the cohomology of GL_2 and SL_2 over imaginary quadratic fields

We report on computations of the cohomology of GL_2(O_D) and SL_2(O_D), where D<0 is a fundamental discriminant. These computations go well beyond earlier results of Vogtmann and Scheutzow. We use the technique of homology of Voronoi complexes, and our computations recover the integral cohomology away from the primes 2, 3. We observed exponential growth in the torsion subgroup of H^2 as $D$ increases, and compared our data to bounds of Rohlfs.

math.NT↗

arXiv2021

Generalized Catalan numbers from hypergraphs

The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting plane trees and noncrossing set partitions. They also arise in the GUE matrix model as the leading coefficient of certain polynomials, a connection closely related to the plane trees and noncrossing set partitions interpretations. In this paper we define a generalization of the Catalan numbers. In fact we define an infinite collection of generalizations C_n^(m), m >= 1, with m=1 giving the usual Catalans. The sequence C_n^(m) comes from studying certain matrix models attached to hypergraphs. We also give some combinatorial interpretations of these numbers, and conjecture some asymptotics.

math.CO↗

arXiv2019

Weighted lattice point sums in lattice polytopes, unifying Dehn--Sommerville and Ehrhart--Macdonald

Let $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $φ\colon V\rightarrow \CC $ be a homogeneous polynomial function of degree $d$ (i.e., an element of $\Sym^{d} (V^{*})$). For $q\in \ZZ_{>0}$ and any face $F$ of $P$, let $D_{φ,F} (q)$ be the sum of $φ$ over the lattice points in the dilate $qF$. We define a generating function $G_φ(q,y) \in \QQ [q] [y]$ packaging together the various $D_{φ,F} (q)$, and show that it satisfies a functional equation that simultaneously generalizes Ehrhart--Macdonald reciprocity and the Dehn--Sommerville relations. When $P$ is a simple lattice polytope (i.e., each vertex meets $n$ edges), we show how $G_φ$ can be computed using an analogue of Brion--Vergne's Euler--Maclaurin summation formula.

math.NT↗

arXiv2019

Ironwood Meta Key Agreement and Authentication Protocol

Number theoretic public-key solutions, currently used in many applications worldwide, will be subject to various quantum attacks, making them less attractive for longer-term use. Certain group theoretic constructs are now showing promise in providing quantum-resistant cryptographic primitives, and may provide suitable alternatives for those looking to address known quantum attacks. In this paper, we introduce a new protocol called a Meta Key Agreement and Authentication Protocol (MKAAP) that has some characteristics of a public-key solution and some of a shared-key solution. Specifically it has the deployment benefits of a public-key system, allowing two entities that have never met before to authenticate without requiring real-time access to a third-party, but does require secure provisioning of key material from a trusted key distribution system (similar to a symmetric system) prior to deployment. We then describe a specific MKAAP instance, the Ironwood MKAAP, discuss its security, and show how it resists certain quantum attacks such as Shor's algorithm or Grover's quantum search algorithm. We also show Ironwood implemented on several ``internet of things'' (IoT devices), measure its performance, and show how it performs significantly better than ECC using fewer device resources.

cs.CR↗

arXiv2019

Tiered trees, weights, and q-Eulerian numbers

Maxmin trees are labeled trees with the property that each vertex is either a local maximum or a local minimum. Such trees were originally introduced by Postnikov, who gave a formula to count them and different combinatorial interpretations for their number. In this paper we generalize this construction and define tiered trees by allowing more than two classes of vertices. Tiered trees arise naturally when counting the absolutely indecomposable representations of certain quivers, and also when one enumerates torus orbits on certain homogeneous varieties. We define a notion of weight for tiered trees and prove bijections between various weight 0 tiered trees and other combinatorial objects; in particular order n weight 0 maxmin trees are naturally in bijection with permutations on n-1 letters. We conclude by using our weight function to define a new q-analogue of the Eulerian numbers.

math.CO↗

arXiv2018

Exotic matrix models: the Albert algebra and the spin factor

The matrix models attached to real symmetric matrices and the complex/quaternionic Hermitian matrices have been studied by many authors. These models correspond to three of the simple formally real Jordan algebras over R. Such algebras were classified by Jordan, von Neumann, and Wigner in the 30s, and apart from these three there are two others: (i) the spin factor L_{1,n}, an algebra built on R^{n+1}, and (ii) the Albert algebra A of 3 by 3 Hermitian matrices over the octonions. In this paper we investigate the matrix models attached to these remaining cases.

math.CO↗

arXiv2018

On the toplogical computation of K4 of the Gaussian and Eisenstein integers

In this paper we use topological tools to investigate the structure of the algebraic K-groups K_4 (Z[i]) and K_4 (Z[rho]), where i := sqrt{-1} and rho := (1+sqrt{-3})/2. We exploit the close connection between homology groups of GL_n(R) for n <= 5 and those of related classifying spaces, then compute the former using Voronoi's reduction theory of positive definite quadratic and Hermitian forms to produce a very large finite cell complex on which GL_n(R) acts. Our main result is that K_4 (Z[i]) and K_4 (Z[rho]) have no p-torsion for p >= 5.

math.KT↗

arXiv2018

Cohomology with twisted one-dimensional coefficients for congruence subgroups of SL(4,Z) and Galois representations

We extend the computations in [AGM1, AGM2, AGM3] to find the cohomology in degree five of a congruence subgroup Gamma of SL(4,Z) with coefficients in a field K, twisted by a nebentype character eta, along with the action of the Hecke algebra. This is the top cuspidal degree. In practice we take K to be a finite field of large characteristic, as a proxy for the complex numbers. For each Hecke eigenclass found, we produce a Galois representation that appears to be attached to it. Our computations show that in every case this Galois representation is the only one that could be attached to it. The existence of the attached Galois representations agrees with a theorem of Scholze and sheds light on the Borel-Serre boundary for Gamma. The computations require serious modifications to our previous algorithms to accommodate the twisted coefficients. Nontrivial coefficients add a layer of complication to our data structures, and new possibilites arise that must be taken into account in the Galois Finder, the code that finds the Galois representations. We have improved the Galois Finder so that it reports when the attached Galois representation is uniquely determined by our data.

math.NT↗

arXiv2018

On the cohomology of congruence subgroups of GL3 over the Eisenstein integers

Let F be the imaginary quadratic field of discriminant -3 and OF its ring of integers. Let Gamma be the arithmetic group GL_3 (OF), and for any ideal n subset OF let Gamma_0 (n) be the congruence subgroup of level n consisting of matrices with bottom row (0,0,*) bmod n. In this paper we compute the cohomology spaces H^{nu - 1} (Gamma_0 (n); C) as a Hecke module for various levels n, where nu is the virtual cohomological dimension of Gamma. This represents the first attempt at such computations for GL_3 over an imaginary quadratic field, and complements work of Grunewald--Helling--Mennicke and Cremona, who computed the cohomology of GL_2 over imaginary quadratic fields. In our results we observe a variety of phenomena, including cohomology classes that apparently correspond to nonselfdual cuspforms on GL_3/F.

math.NT↗

arXiv2016

On the growth of torsion in the cohomology of arithmetic groups

Let G be a semisimple Lie group with associated symmetric space D, and let Gamma subset G be a cocompact arithmetic group. Let L be a lattice inside a Z Gamma-module arising from a rational finite-dimensional complex representation of G. Bergeron and Venkatesh recently gave a precise conjecture about the growth of the order of the torsion subgroup H_i (Gamma_k; L )_tors as Gamma_k ranges over a tower of congruence subgroups of Gamma. In particular they conjectured that the ratio (log |H_i (Gamma_k ; L)_tors|)/[Gamma : Gamma_k] should tend to a nonzero limit if and only if i= (dim(D)-1)/2 and G is a group of deficiency 1. Furthermore, they gave a precise expression for the limit. In this paper, we investigate computationally the cohomology of several (non-cocompact) arithmetic groups, including GL_n (Z) for n=3,4,5 and GL_2 (O) for various rings of integers, and observe its growth as a function of level. In all cases where our dataset is sufficiently large, we observe excellent agreement with the same limit as in the predictions of Bergeron--Venkatesh. Our data also prompts us to make two new conjectures on the growth of torsion not covered by the Bergeron--Venkatesh conjecture.

math.NT↗

arXiv2016

Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser

The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless sensors. It is a group-theoretic cryptographic protocol that allows two users to construct a shared secret via a Diffie-Hellman-type scheme over an insecure channel. Building on the refuted 2012 permutation-based attack of Kalka-Teichner-Tsaban, in 2015 Ben-Zvi-Blackburn-Tsaban (BBT) presented a heuristic attack that attempts to recover the AEDH shared secret. In their paper BBT reference the AEDH protocol as presented to ISO for certification (ISO 29167-20) by SecureRF. The ISO draft contains two profiles using the Algebraic Eraser. One profile is unaffected by this attack; the second profile is subject to their attack provided the attack runs in real time. This is not the case in most practical deployments. The BBT attack is simply a targeted attack that does not attempt to break the method, system parameters, or recover any private keys. Rather, its limited focus is to recover the shared secret in a single transaction. In addition, the BBT attack is based on several conjectures that are assumed to hold when parameters are chosen according to standard distributions, which can be mitigated, if not avoided. This paper shows how to choose special distributions so that these conjectures do not hold making the BBT attack ineffective for braid groups with sufficiently many strands. Further, the BBT attack assumes that certain data is available to an attacker, but there are realistic deployment scenarios where this is not the case, making the attack fail completely. In summary, the BBT attack is flawed (with respect to the SecureRF ISO draft) and, at a minimum, over-reaches as to its applicability.

cs.CR↗

arXiv2014

A table of elliptic curves over the cubic field of discriminant -23

Let F be the cubic field of discriminant -23 and O its ring of integers. Let Gamma be the arithmetic group GL_2 (O), and for any ideal n subset O let Gamma_0 (n) be the congruence subgroup of level n. In a previous paper, two of us (PG and DY) computed the cohomology of various Gamma_0 (n), along with the action of the Hecke operators. The goal of that paper was to test the modularity of elliptic curves over F. In the present paper, we complement and extend this prior work in two ways. First, we tabulate more elliptic curves than were found in our prior work by using various heuristics ("old and new" cohomology classes, dimensions of Eisenstein subspaces) to predict the existence of elliptic curves of various conductors, and then by using more sophisticated search techniques (for instance, torsion subgroups, twisting, and the Cremona-Lingham algorithm) to find them. We then compute further invariants of these curves, such as their rank and representatives of all isogeny classes. Our enumeration includes conjecturally the first elliptic curves of ranks 1 and 2 over this field, which occur at levels of norm 719 and 9173 respectively.

math.NT↗

arXiv2014

Metaplectic Demazure operators and Whittaker functions

In a previous paper the first two named authors defined an action of a Weyl group on rational functions and used it to construct multiple Dirichlet series. These series are related to Whittaker functions on an n-fold metaplectic cover of a reductive group. In this paper, we define metaplectic analogues of the Demazure and Demazure-Lusztig operators. We show how these operators, together with results of McNamara, can be used to compute Whittaker functions on metaplectic groups over p-adic fields.

math.RT↗