Searcharxiv⌕ Search

arXiv subjects

Benjamin Young

Publications and source records attributed to Benjamin Young.

33 records · Page 2Linked to original sources

Rank 2 sheaves on toric 3-folds: classical and virtual counts

Let $\mathcal{M}$ be the moduli space of rank 2 stable torsion free sheaves with Chern classes $c_i$ on a smooth 3-fold $X$. When $X$ is toric with torus $T$, we describe the $T$-fixed locus of the moduli space. Connected components of $\mathcal{M}^T$ with constant reflexive hulls are isomorphic to products of $\mathbb{P}^1$. We mainly consider such connected components, which typically arise for any $c_1$, "low values" of $c_2$, and arbitrary $c_3$. In the classical part of the paper, we introduce a new type of combinatorics called double box configurations, which can be used to compute the generating function $\mathsf{Z}(q)$ of topological Euler characteristics of $\mathcal{M}$ (summing over all $c_3$). The combinatorics is solved using the double dimer model in a companion paper. This leads to explicit formulae for $\mathsf{Z}(q)$ involving the MacMahon function. In the virtual part of the paper, we define Donaldson-Thomas type invariants of toric Calabi-Yau 3-folds by virtual localization. The contribution to the invariant of an individual connected component of the $T$-fixed locus is in general not equal to its signed Euler characteristic due to $T$-fixed obstructions. Nevertheless, the generating function of all invariants is given by $\mathsf{Z}(q)$ up to signs.

math.AG↗

Intersection cohomology of the symmetric reciprocal plane

We compute the Kazhdan-Lusztig polynomial of the uniform matroid of rank n-1 on n elements by proving that the i-th coefficient of is equal to the number of ways to choose i non-intersecting chords in an (n-i+1)-gon. We also show that the corresponding intersection cohomology group is isomorphic to the irreducible representation of the symmetric group associated to the partition [n-2i,2,...,2].

math.CO↗

Nearly radial Neumann eigenfunctions on symmetric domains

We study the existence of Neumann eigenfunctions which do not change sign on the boundary of some special domains. We show that eigenfunctions which are strictly positive on the boundary exist on regular polygons with at least 5 sides, while on equilateral triangles and cubes it is not even possible to find an eigenfunction which is nonnegative on the boundary. We use analytic methods combined with symmetry arguments to prove the result for polygons with six or more sides. The case for the regular pentagon is harder. We develop a validated numerical method to prove this case, which involves iteratively bounding eigenvalues for a sequence of subdomains of the triangle. We use a learning algorithm to find and optimize this sequence of subdomains, making it straightforward to check our computations with standard software.

math.SP↗

Asymptotic domino statistics in the Aztec diamond

We study random domino tilings of the Aztec diamond with different weights for horizontal and vertical dominoes. A domino tiling of an Aztec diamond can also be described by a particle system which is a determinantal process. We give a relation between the correlation kernel for this process and the inverse Kasteleyn matrix of the Aztec diamond. This gives a formula for the inverse Kasteleyn matrix which generalizes a result of Helfgott. As an application, we investigate the asymptotics of the process formed by the southern dominoes close to the frozen boundary. We find that at the northern boundary, the southern domino process converges to a thinned Airy point process. At the southern boundary, the process of holes of the southern domino process converges to a multiple point process that we call the thickened Airy point process. We also study the convergence of the domino process in the unfrozen region to the limiting Gibbs measure.

math.PR↗

Coxeter-Knuth graphs and a signed Little map for type B reduced words

We define an analog of David Little's algorithm for reduced words in type B, and investigate its main properties. In particular, we show that our algorithm preserves the recording tableau of Kraśkiewicz insertion, and that it provides a bijective realization of the Type B transition equations in Schubert calculus. Many other aspects of type A theory carry over to this new setting. Our primary tool is a shifted version of the dual equivalence graphs defined by Assaf and further developed by Roberts. We provide an axiomatic characterization of shifted dual equivalence graphs, and use them to prove a structure theorem for the graph of Type B Coxeter-Knuth relations.

math.CO↗

A Markov growth process for Macdonald's distribution on reduced words

We give an algorithmic-bijective proof of Macdonald's reduced word identity in the theory of Schubert polynomials, in the special case where the permutation is dominant. Our bijection uses a novel application of David Little's generalized bumping algorithm. We also describe a Markov growth process for an associated probability distribution on reduced words. Our growth process can be implemented efficiently on a computer and allows for fast sampling of reduced words. We also discuss various partial generalizations and links to Little's work on the RSK algorithm.

math.CO↗

Coupling Functions for Domino tilings of Aztec diamonds

The inverse Kasteleyn matrix of a bipartite graph holds much information about the perfect matchings of the system such as local statistics which can be used to compute local and global asymptotics. In this paper, we consider three different weightings of domino tilings of the Aztec diamond and show using recurrence relations, we can compute the inverse Kasteleyn matrix. These weights are the one-periodic weighting where the horizontal edges have one weight and the vertical edges have another weight, the q^{vol} weighting which corresponds to multiplying the product of tile weights by q if we add a `box' to the height function and the two-periodic weighting which exhibits a flat region with defects in the center.

math.CO↗

Relating Edelman-Greene insertion to the Little map

The Little map and the Edelman-Greene insertion algorithm, a generalization of the Robinson-Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map factors through Edelman-Greene insertion and establish new results about each map as a consequence. In particular, we resolve some conjectures of Lam and Little.

math.CO↗

Correlations for the Novak process

We study random lozenge tilings of a certain shape in the plane called the Novak half-hexagon, and compute the correlation functions for this process. This model was introduced by Nordenstam and Young (2011) and has many intriguing similarities with a more well-studied model, domino tilings of the Aztec diamond. The most difficult step in the present paper is to compute the inverse of the matrix whose (i,j) entry is the binomial coefficient C(A, B_j - i) for indeterminate variables A and B_1, ..., B_n.

math.CO↗

Domino shuffling for the Del Pezzo 3 lattice

We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on a family of finite subgraphs of this lattice whose boundary conditions are compatible with our algorithm. In particular, we re-prove an enumerative theorem of Ciucu, as well as finding a related family of subgraphs which have 2^{(n+1)^2} perfect matchings. We also give three-variable generating functions for perfect matchings on both families of graphs, which encode certain statistics on the height functions of these graphs.

math.CO↗

Domino shuffling on Novak half-hexagons and Aztec half-diamonds

We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an "arctic parabola" theorem for the Half-Hexagons as a corollary of the Arctic Circle theorem for the Aztec Diamond.

math.CO↗

A solution to one of Knuth's permutation problems

We answer a problem posed recently by Knuth: an n-dimensional box, with edges lying on the positive coordinate axes and generic edge lengths W_1 < W_2 < ... < W_n, is dissected into n! pieces along the planes x_i = x_j. We describe which pieces have the same volume, and show that there are C_n distinct volumes, where C_n denotes the nth Catalan number.

math.CO↗

Squishing dimers on the hexagon lattice

We describe an operation on dimer configurations on the hexagon lattice, called "squishing", and use this operation to explain some of the properties of dimer generating functions.

math.CO↗

Computing a pyramid partition generating function with dimer shuffling

We verify a recent conjecture of Kenyon/Szendroi, arXiv:0705.3419, by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson--Thomas theory of a non-commutative resolution of the conifold singularity {x1x2 -x3x4 = 0}. The proof does not require algebraic geometry; it uses a modified version of the domino shuffling algorithm of Elkies, Kuperberg, Larsen and Propp.

math.CO↗

Generating functions for colored 3D Young diagrams and the Donaldson-Thomas invariants of orbifolds

We derive two multivariate generating functions for three-dimensional Young diagrams (also called plane partitions). The variables correspond to a colouring of the boxes according to a finite Abelian subgroup G of SO(3). We use the vertex operator methods of Okounkov--Reshetikhin--Vafa for the easy case G = Z/n; to handle the considerably more difficult case G=Z/2 x Z/2, we will also use a refinement of the author's recent q--enumeration of pyramid partitions. In the appendix, we relate the diagram generating functions to the Donaldson-Thomas partition functions of the orbifold C^3/G. We find a relationship between the Donaldson-Thomas partition functions of the orbifold and its G-Hilbert scheme resolution. We formulate a crepant resolution conjecture for the Donaldson-Thomas theory of local orbifolds satisfying the Hard Lefschetz condition.

math.CO↗