arXiv subjects

William Slofstra

Publications and source records attributed to William Slofstra.

31 records · Page 2Linked to original sources

arXiv2017

Billey-Postnikov decompositions and the fibre bundle structure of Schubert varieties

A theorem of Ryan and Wolper states that a type A Schubert variety is smooth if and only if it is an iterated fibre bundle of Grassmannians. We extend this theorem to arbitrary finite type, showing that a Schubert variety in a generalized flag variety is rationally smooth if and only if it is an iterated fibre bundle of rationally smooth Grassmannian Schubert varieties. The proof depends on deep combinatorial results of Billey-Postnikov on Weyl groups. We determine all smooth and rationally smooth Grassmannian Schubert varieties, and give a new proof of Peterson's theorem that all simply-laced rationally smooth Schubert varieties are smooth. Taken together, our results give a fairly complete geometric description of smooth and rationally smooth Schubert varieties using primarily combinatorial methods.

math.AG↗

arXiv2017

Smooth Schubert varieties in the affine flag variety of type $\tilde{A}$

We show that every smooth Schubert variety of affine type $\tilde{A}$ is an iterated fibre bundle of Grassmannians, extending an analogous result by Ryan and Wolper for Schubert varieties of finite type $A$. As a consequence, we finish a conjecture of Billey-Crites that a Schubert variety in affine type $\tilde{A}$ is smooth if and only if the corresponding affine permutation avoids the patterns $4231$ and $3412$. Using this iterated fibre bundle structure, we compute the generating function for the number of smooth Schubert varieties of affine type $\tilde{A}$.

math.CO↗

arXiv2016

Perfect Commuting-Operator Strategies for Linear System Games

Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of entanglement correspond to finite-dimensional operator solutions of a certain set of non-commutative equations. We investigate linear system games in the commuting-operator model of entanglement, where Alice and Bob's measurement operators act on a joint Hilbert space, and Alice's operators must commute with Bob's operators. We show that perfect strategies in this model correspond to possibly-infinite-dimensional operator solutions of the non-commutative equations. The proof is based around a finitely-presented group associated to the linear system which arises from the non-commutative equations.

quant-ph↗

arXiv2015

Staircase diagrams and enumeration of smooth Schubert varieties

We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These combinatorial structures are collections of steps of irregular size, forming interconnected staircases over the given graph. Over a Dynkin-Coxeter graph, the set of "nearly-maximally labelled" staircase diagrams is in bijection with the set of Schubert varieties with a complete Billey-Postnikov (BP) decomposition. We can then use an earlier result of the authors showing that all finite-type rationally smooth Schubert varieties have a complete BP decomposition to finish the enumeration.

math.CO↗

arXiv2015

Rationally smooth Schubert varieties and inversion hyperplane arrangements

We show that an element $w$ of a finite Weyl group $W$ is rationally smooth if and only if the hyperplane arrangement $I$ associated to the inversion set of $w$ is inductively free, and the product $(d_1+1) \cdots (d_l+1)$ of the coexponents $d_1,\ldots,d_l$ is equal to the size of the Bruhat interval $[e,w]$, where $e$ is the identity in $W$. As part of the proof, we describe exactly when a rationally smooth element in a finite Weyl group has a chain Billey-Postnikov decomposition. For finite Coxeter groups, we show that chain Billey-Postnikov decompositions are connected with certain modular coatoms of $I$.

math.CO↗

arXiv2015

The Cotangent Bundle of a Cominuscule Grassmannian

A theorem of the first author states that the cotangent bundle of the type $A$ Grassmannian variety can be embedded as an open subset of a smooth Schubert variety in a two-step affine partial flag variety. We extend this result to cotangent bundles of cominuscule generalized Grassmannians of arbitrary Lie type.

math.AG↗

arXiv2015

Twisted strong Macdonald theorems and adjoint orbits

The strong Macdonald theorems state that, for $L$ reductive and $s$ an odd variable, the cohomology algebras $H^*(L[z]/z^N)$ and $H^*(L[z,s])$ are freely generated, and describe the cohomological, $s$-, and $z$-degrees of the generators. The resulting identity for the $z$-weighted Euler characteristic is equivalent to Macdonald's constant term identity for a finite root system. We calculate $H^*(\mathfrak{p} / z^N \mathfrak{p})$ and $H^*(\mathfrak{p}[s])$ for $\mathfrak{p}$ a standard parahoric in a twisted loop algebra, giving strong Macdonald theorems that take into account both a parabolic component and a possible diagram automorphism twist. In particular we show that $H^*(\mathfrak{p} / z^N \mathfrak{p})$ contains a parabolic subalgebra of the coinvariant algebra of the fixed-point subgroup of the Weyl group of $L$, and thus is no longer free. We also prove a strong Macdonald theorem for $H^*(\mathfrak{b}; S^* \mathfrak{n}^*)$ and $H^*(\mathfrak{b} / z^N \mathfrak{n})$ when $\mathfrak{b}$ and $\mathfrak{n}$ are Iwahori and nilpotent subalgebras respectively of a twisted loop algebra. For each strong Macdonald theorem proved, taking $z$-weighted Euler characteristics gives an identity equivalent to Macdonald's constant term identity for the corresponding affine root system. As part of the proof, we study the regular adjoint orbits for the adjoint action of the twisted arc group associated to $L$, proving an analogue of the Kostant slice theorem.

math.RT↗

arXiv2015

A Brylinski filtration for affine Kac-Moody algebras

Braverman and Finkelberg have recently proposed a conjectural analogue of the geometric Satake isomorphism for untwisted affine Kac-Moody groups. As part of their model, they conjecture that (at dominant weights) Lusztig's q-analog of weight multiplicity is equal to the Poincare series of the principal nilpotent filtration of the weight space, as occurs in the finite-dimensional case. We show that the conjectured equality holds for all affine Kac-Moody algebras if the principal nilpotent filtration is replaced by the principal Heisenberg filtration. The main body of the proof is a Lie algebra cohomology vanishing result. We also give an example to show that the Poincare series of the principal nilpotent filtration is not always equal to the q-analog of weight multiplicity. Finally, we give some partial results for indefinite Kac-Moody algebras.

math.RT↗

arXiv2014

A pattern avoidance criterion for free inversion arrangements

We show that the hyperplane arrangement of a coconvex set in a finite root system is free if and only if it is free in corank 4. As a consequence, we show that the inversion arrangement of a Weyl group element w is free if and only if w avoids a finite list of root system patterns. As a key part of the proof, we use a recent theorem of Abe and Yoshinaga to show that if the root system does not contain any factors of type C or F, then Peterson translation of coconvex sets preserves freeness. This also allows us to give a Kostant-Shapiro-Steinberg rule for the coexponents of a free inversion arrangement in any type.

math.CO↗

arXiv2013

Rationally smooth elements of Coxeter groups and triangle group avoidance

We study a family of infinite-type Coxeter groups defined by the avoidance of certain rank 3 parabolic subgroups. For this family, rationally smooth elements can be detected by looking at only a few coefficients of the Poincaré polynomial. We also prove a factorization theorem for the Poincaré polynomial of rationally smooth elements. As an application, we show that a large class of infinite-type Coxeter groups have only finitely many rationally smooth elements. Explicit enumerations and descriptions of these elements are given in special cases.

math.CO↗

arXiv2010

Lower bounds on the entanglement needed to play XOR non-local games

We give an explicit family of XOR games with O(n)-bit questions requiring 2^n ebits to play near-optimally. More generally we introduce a new technique for proving lower bounds on the amount of entanglement required by an XOR game: we show that near-optimal strategies for an XOR game G correspond to approximate representations of a certain C^*-algebra associated to G. Our results extend an earlier theorem of Tsirelson characterising the set of quantum strategies which implement extremal quantum correlations.

quant-ph↗

arXiv2008

Strong Parallel Repetition Theorem for Quantum XOR Proof Systems

We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to coordinate their behavior using a shared entangled quantum state, a perfect parallel repetition theorem holds in the following sense. The prover's optimal success probability for simultaneously playing a collection of XOR proof systems is exactly the product of the individual optimal success probabilities. This property is remarkable in view of the fact that, in the classical case (where the provers can only utilize classical information), it does not hold. The theorem is proved by analyzing parities of XOR proof systems using semidefinite programming techniques, which we then relate to parallel repetitions of XOR games via Fourier analysis.

quant-ph↗

arXiv2008

Annular embeddings of permutations for arbitrary genus

In the symmetric group on a set of size 2n, let P_{2n} denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as ``pairings'', since each disjoint cycle has length 2). Harer and Zagier explicitly determined the distribution of the number of disjoint cycles in the product of a fixed cycle of length 2n and the elements of P_{2n}. Their famous result has been reproved many times, primarily because it can be interpreted as the genus distribution for 2-cell embeddings in an orientable surface,of a graph with a single vertex attached to n loops. In this paper we give a new formula for the cycle distribution when a fixed permutation with two cycles (say the lengths are p,q, where p+q=2n) is multiplied by the elements of P_{2n}. It can be interpreted as the genus distribution for 2-cell embeddings in an orientable surface, of a graph with two vertices, of degrees p and q. In terms of these graphs, the formula involves a parameter that allows us to specify, separately, the number of edges between the two vertices and the number of loops at each of the vertices. The proof is combinatorial, and uses a new algorithm that we introduce to create all rooted forests containing a given rooted forest.

math.CO↗