Searcharxiv⌕ Search

arXiv subjects

Greg Kuperberg

Publications and source records attributed to Greg Kuperberg.

At least 55 records · Page 3Linked to original sources

Scholarly mathematical communication at a crossroads

This essay was invited for publication in Nieuw Archief voor Wiskunde; it will also appear in translation in the SMF Gazette and in the DMV Mitteilungen. I discuss the recent trends in scholarly communication in mathematics, the current state and intentions of the arXiv, and a proposal to reform peer review with the arXiv as a foundation.

math.HO↗

Finite, connected, semisimple, rigid tensor categories are linear

Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V) = k. We prove that linearity follows automatically from semisimplicity: Every connected, finite, semisimple, rigid, monoidal category \C is k-linear and finite-dimensional for some field k. Barring inseparable extensions, such a category becomes a multifusion category after passing to an algebraic extension of k. The proof depends on a result in Galois theory of independent interest, namely a finiteness theorem for abstract composita.

math.QA↗

A generalization of Filliman duality

Filliman duality expresses (the characteristic measure of) a convex polytope P containing the origin as an alternating sum of simplices that share supporting hyperplanes with P. The terms in the alternating sum are given by a triangulation of the polar body P^o. The duality can lead to useful formulas for the volume of P. A limiting case called Lawrence's algorithm can be used to compute the Fourier transform of P. In this note we extend Filliman duality to an involution on the space of polytopal measures on a finite-dimensional vector space, excluding polytopes that have a supporting hyperplane coplanar with the origin. As a special case, if P is a convex polytope containing the origin, any realization of P^o as a linear combination of simplices leads to a dual realization of P.

math.MG↗

Kasteleyn cokernels

We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is defined over a principal ideal domain, this is equivalent to considering its Smith normal form or its cokernel. Many variations of the enumeration methods result in equivalent matrices. In particular, Gessel-Viennot matrices are equivalent to Kasteleyn-Percus matrices. We apply these ideas to plane partitions and related planar of tilings. We list a number of conjectures, supported by experiments in Maple, about the forms of matrices associated to enumerations of plane partitions and other lozenge tilings of planar regions and their symmetry classes. We focus on the case where the enumerations are round or $q$-round, and we conjecture that cokernels remain round or $q$-round for related ``impossible enumerations'' in which there are no tilings. Our conjectures provide a new view of the topic of enumerating symmetry classes of plane partitions and their generalizations. In particular we conjecture that a $q$-specialization of a Jacobi-Trudi matrix has a Smith normal form. If so it could be an interesting structure associated to the corresponding irreducible representation of $\SL(n,\C)$. Finally we find, with proof, the normal form of the matrix that appears in the enumeration of domino tilings of an Aztec diamond.

math.CO↗

Quadrisecants of knots and links

We show that every non-trivial tame knot or link in R^3 has a quadrisecant, i.e. four collinear points. The quadrisecant must be topologically non-trivial in a precise sense. As an application, we show that a nonsingular, algebraic surface in R^3 which is a knotted torus must have degree at least eight.

math.GT↗

Fat 4-polytopes and fatter 3-spheres

We introduce the fatness parameter of a 4-dimensional polytope P, defined as ϕ(P)=(f_1+f_2)/(f_0+f_3). It arises in an important open problem in 4-dimensional combinatorial geometry: Is the fatness of convex 4-polytopes bounded? We describe and analyze a hyperbolic geometry construction that produces 4-polytopes with fatness ϕ(P)>5.048, as well as the first infinite family of 2-simple, 2-simplicial 4-polytopes. Moreover, using a construction via finite covering spaces of surfaces, we show that fatness is not bounded for the more general class of strongly regular CW decompositions of the 3-sphere.

math.CO↗

A tracial quantum central limit theorem

We prove a central limit theorem for non-commutative random variables in a von Neumann algebra with a tracial state: Any non-commutative polynomial of averages of i.i.d. samples converges to a classical limit. The proof is based on a central limit theorem for ordered joint distributions together with a commutator estimate related to the Baker-Campbell-Hausdorff expansion. The result can be considered a generalization of Johansson's theorem on the limiting distribution of the shape of a random word in a fixed alphabet as its length goes to infinity [math.CO/9906120,math.PR/9909104].

math-ph↗

Symmetry classes of alternating-sign matrices under one roof

In a previous article [math.CO/9712207], we derived the alternating-sign matrix (ASM) theorem from the Izergin-Korepin determinant for a partition function for square ice with domain wall boundary. Here we show that the same argument enumerates three other symmetry classes of alternating-sign matrices: VSASMs (vertically symmetric ASMs), even HTSASMs (half-turn-symmetric ASMs), and even QTSASMs (quarter-turn-symmetric ASMs). The VSASM enumeration was conjectured by Mills; the others by Robbins [math.CO/0008045]. We introduce several new types of ASMs: UASMs (ASMs with a U-turn side), UUASMs (two U-turn sides), OSASMs (off-diagonally symmetric ASMs), OOSASMs (off-diagonally, off-antidiagonally symmetric), and UOSASMs (off-diagonally symmetric with U-turn sides). UASMs generalize VSASMs, while UUASMs generalize VHSASMs (vertically and horizontally symmetric ASMs) and another new class, VHPASMs (vertically and horizontally perverse). OSASMs, OOSASMs, and UOSASMs are related to the remaining symmetry classes of ASMs, namely DSASMs (diagonally symmetric), DASASMs (diagonally, anti-diagonally symmetric), and TSASMs (totally symmetric ASMs). We enumerate several of these new classes, and we provide several 2-enumerations and 3-enumerations. Our main technical tool is a set of multi-parameter determinant and Pfaffian formulas generalizing the Izergin-Korepin determinant for ASMs and the Tsuchiya determinant for UASMs [solv-int/9804010]. We evaluate specializations of the determinants and Pfaffians using the factor exhaustion method.

math.CO↗

Notions of denseness

The notion of a completely saturated packing [Fejes Toth, Kuperberg and Kuperberg, Highly saturated packings and reduced coverings, Monats. Math. 125 (1998) 127-145] is a sharper version of maximum density, and the analogous notion of a completely reduced covering is a sharper version of minimum density. We define two related notions: uniformly recurrent and weakly recurrent dense packings, and diffusively dominant packings. Every compact domain in Euclidean space has a uniformly recurrent dense packing. If the domain self-nests, such a packing is limit-equivalent to a completely saturated one. Diffusive dominance is yet sharper than complete saturation and leads to a better understanding of n-saturation.

math.MG↗

Random words, quantum statistics, central limits, random matrices

Recently Tracy and Widom conjectured [math.CO/9904042] and Johansson proved [math.CO/9906120] that the expected shape λof the semi-standard tableau produced by a random word in k letters is asymptotically the spectrum of a random traceless k by k GUE matrix. In this article we give two arguments for this fact. In the first argument, we realize the random matrix itself as a quantum random variable on the space of random words, if this space is viewed as a quantum state space. In the second argument, we show that the distribution of λis asymptotically given by the usual local limit theorem, but the resulting Gaussian is disguised by an extra polynomial weight and by reflecting walls. Both arguments more generally apply to an arbitrary finite-dimensional representation V of an arbitrary simple Lie algebra g. In the original question, V is the defining representation of g = su(k).

math.PR↗

Perturbative 3-manifold invariants by cut-and-paste topology

We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. Our definition is as close as possible to one given by Kontsevich. We will also establish some basic properties of these invariants, in particular that they are universally finite type with respect to algebraically split surgery and with respect to Torelli surgery. Torelli surgery is a mutual generalization of blink surgery of Garoufalidis and Levine and clasper surgery of Habiro.

math.GT↗

Circumscribing constant-width bodies with polytopes

Makeev conjectured that every constant-width body is inscribed in the dual difference body of a regular simplex. We prove that homologically, there are an odd number of such circumscribing bodies in dimension 3, and therefore geometrically there is at least one. We show that the homological answer is zero in higher dimensions, a result which is inconclusive for the geometric question. We also give a partial generalization involving affine circumscription of strictly convex bodies.

math.MG↗

The bottleneck conjecture

The Mahler volume of a centrally symmetric convex body K is defined as M(K)= (Vol K)(Vol K^dual). Mahler conjectured that this volume is minimized when K is a cube. We introduce the bottleneck conjecture, which stipulates that a certain convex body K^diamond subset K X K^dual has least volume when K is an ellipsoid. If true, the bottleneck conjecture would strengthen the best current lower bound on the Mahler volume due to Bourgain and Milman. We also generalize the bottleneck conjecture in the context of indefinite orthogonal geometry and prove some special cases of the generalization.

math.MG↗

An exploration of the permanent-determinant method

The permanent-determinant method and its generalization, the Hafnian-Pfaffian method, are methods to enumerate perfect matchings of plane graphs that was discovered by P. W. Kasteleyn. We present several new techniques and arguments related to the permanent-determinant with consequences in enumerative combinatorics. Here are some of the results that follow from these techniques: 1. If a bipartite graph on the sphere with 4n vertices is invariant under the antipodal map, the number of matchings is the square of the number of matchings of the quotient graph. 2. The number of matchings of the edge graph of a graph with vertices of degree at most 3 is a power of 2. 3. The three Carlitz matrices whose determinants count a x b x c plane partitions all have the same cokernel. 4. Two symmetry classes of plane partitions can be enumerated with almost no calculation.

math.CO↗

Web bases for sl(3) are not dual canonical

We compare two natural bases for the invariant space of a tensor product of irreducible representations of A_2, or sl(3). One basis is the web basis, defined from a skein theory called the combinatorial A_2 spider. The other basis is the dual canonical basis, the dual of the basis defined by Lusztig and Kashiwara. For sl(2) or A_1, the web bases have been discovered many times and were recently shown to be dual canonical by Frenkel and Khovanov. We prove that for sl(3), the two bases eventually diverge even though they agree in many small cases. The first disagreement comes in the invariant space Inv((V^+ tensor V^+ tensor V^- tensor V^-)^{tensor 3}), where V^+ and V^- are the two 3-dimensional representations of sl(3). If the tensor factors are listed in the indicated order, only 511 of the 512 invariant basis vectors coincide.

q-alg↗

Another low-technology estimate in convex geometry

We give a short argument that for some C > 0, every n-dimensional Banach ball K admits a 256-round subquotient of dimension at least C n/(log n). This is a weak version of Milman's quotient of subspace theorem, which lacks the logarithmic factor.

math.MG↗

Generalized counterexamples to the Seifert conjecture

Using the theory of plugs and the self-insertion construction due to the second author, we prove that a foliation of any codimension of any manifold can be modified in a real analytic or piecewise-linear fashion so that all minimal sets have codimension 1. In particular, the 3-sphere S^3 has a real analytic dynamical system such that all limit sets are 2-dimensional. We also prove that a 1-dimensional foliation of a manifold of dimension at least 3 can be modified in a piecewise-linear fashion so that there are no closed leaves but all minimal sets are 1-dimensional. These theorems provide new counterexamples to the Seifert conjecture, which asserts that every dynamical system on S^3 with no singular points has a periodic trajectory.

math.DS↗

Non-involutory Hopf algebras and 3-manifold invariants

We present a definition of an invariant #(M,H), defined for every finite-dimensional Hopf algebra (or Hopf superalgebra or Hopf object) H and for every closed, framed 3-manifold M. When H is a quantized universal enveloping algebra, #(M,H) is closely related to well-known quantum link invariants such as the HOMFLY polynomial, but it is not a topological quantum field theory.

q-alg↗