arXiv subjects

Victor Reiner

Publications and source records attributed to Victor Reiner.

At least 55 records · Page 3Linked to original sources

arXiv2015

Absolute order in general linear groups

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on GL(V) is shown to have two equivalent descriptions, one via additivity of length for factorizations into reflections, the other via additivity of fixed space codimensions. Other general properties of the order are derived, including self-duality of its intervals. Working over a finite field F_q, it is shown via a complex character computation that the poset interval from the identity to a Singer cycle (or any regular elliptic element) in GL_n(F_q) has a strikingly simple formula for the number of chains passing through a prescribed set of ranks.

math.CO↗

arXiv2015

Pseudodeterminants and perfect square spanning tree counts

The pseudodeterminant $\textrm{pdet}(M)$ of a square matrix is the last nonzero coefficient in its characteristic polynomial; for a nonsingular matrix, this is just the determinant. If $\partial$ is a symmetric or skew-symmetric matrix then $\textrm{pdet}(\partial\partial^t)=\textrm{pdet}(\partial)^2$. Whenever $\partial$ is the $k^{th}$ boundary map of a self-dual CW-complex $X$, this linear-algebraic identity implies that the torsion-weighted generating function for cellular $k$-trees in $X$ is a perfect square. In the case that $X$ is an \emph{antipodally} self-dual CW-sphere of odd dimension, the pseudodeterminant of its $k$th cellular boundary map can be interpreted directly as a torsion-weighted generating function both for $k$-trees and for $(k-1)$-trees, complementing the analogous result for even-dimensional spheres given by the second author. The argument relies on the topological fact that any self-dual even-dimensional CW-ball can be oriented so that its middle boundary map is skew-symmetric.

math.CO↗

arXiv2014

On non-conjugate Coxeter elements in well-generated reflection groups

Given an irreducible well-generated complex reflection group W with Coxeter number h, we call a Coxeter element any regular element (in the sense of Springer) of order h in W; this is a slight extension of the most common notion of Coxeter element. We show that the class of these Coxeter elements forms a single orbit in W under the action of reflection automorphisms. For Coxeter and Shephard groups, this implies that an element c is a Coxeter element if and only if there exists a simple system S of reflections such that c is the product of the generators in S. We moreover deduce multiple further implications of this property. In particular, we obtain that all noncrossing partition lattices of W associated to different Coxeter elements are isomorphic. We also prove that there is a simply transitive action of the Galois group of the field of definition of W on the set of conjugacy classes of Coxeter elements. Finally, we extend several of these properties to Springer's regular elements of arbitrary order.

math.CO↗

arXiv2014

Parking Spaces

Let $W$ be a Weyl group with root lattice $Q$ and Coxeter number $h$. The elements of the finite torus $Q/(h+1)Q$ are called the $W$-{\sf parking functions}, and we call the permutation representation of $W$ on the set of $W$-parking functions the (standard) $W$-{\sf parking space}. Parking spaces have interesting connections to enumerative combinatorics, diagonal harmonics, and rational Cherednik algebras. In this paper we define two new $W$-parking spaces, called the {\sf noncrossing parking space} and the {\sf algebraic parking space}, with the following features: 1) They are defined more generally for real reflection groups. 2) They carry not just $W$-actions, but $W\times C$-actions, where $C$ is the cyclic subgroup of $W$ generated by a Coxeter element. 3) In the crystallographic case, both are isomorphic to the standard $W$-parking space. Our Main Conjecture is that the two new parking spaces are isomorphic to each other as permutation representations of $W\times C$. This conjecture ties together several threads in the Catalan combinatorics of finite reflection groups. We provide evidence for the conjecture, proofs of some special cases, and suggest further directions for the theory.

math.CO↗

arXiv2014

Reflection factorizations of Singer cycles

The number of shortest factorizations into reflections for a Singer cycle in GL_n(F_q) is shown to be (q^n-1)^(n - 1). Formulas counting factorizations of any length, and counting those with reflections of fixed conjugacy classes are also given. The method is a standard character-theory technique, requiring the compilation of irreducible character values for Singer cycles, semisimple reflections, and transvections. The results suggest several open problems and questions, which are discussed at the end.

math.CO↗

arXiv2012

Toric partial orders

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite posets under the equivalence relation generated by converting minimal elements into maximal elements, or sources into sinks. We derive toric analogues for several features of ordinary partial orders, such as chains, antichains, transitivity, Hasse diagrams, linear extensions, and total orders.

math.CO↗

arXiv2012

A universal coefficient theorem for Gauss's Lemma

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that whenever {A_i},{B_j},{C_k} are the coefficients of polynomials A(X),B(X),C(X) with C(X)=A(X)B(X) and 1 = a_0 A_0 +...+ a_m A_m = b_0 B_0 +...+ b_n B_n, then one also has 1 = c_0 C_0 +...+ c_{m+n} C_{m+n}.

math.AC↗

arXiv2012

P-partitions revisited

We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.

math.CO↗

arXiv2012

Fake degrees for reflection actions on roots

A finite irreducible real reflection group of rank l and Coxeter number h has root system of cardinality h*l. It is shown that the fake degree for the permutation action on its roots is divisible by [h]_q = 1+q+q^2+...+q^{h-1}, and that in simply-laced types, it equals [h]_q times the summation of q^{e_i - 1} where e_i runs through the exponents, so that e_i - 1 are the codegrees.

math.CO↗

arXiv2011

Linear extension sums as valuations of cones

The geometric and algebraic theory of valuations on cones is applied to understand identities involving summing certain rational functions over the set of linear extensions of a poset.

math.CO↗

arXiv2011

The negative q-binomial

Interpretations for the q-binomial coefficient evaluated at -q are discussed. A (q,t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces.

math.CO↗

arXiv2011

A multivariate "inv" hook formula for forests

Bjoerner and Wachs provided two q-generalizations of Knuth's hook formula counting linear extensions of forests: one involving the major index statistic, and one involving the inversion number statistic. We prove a multivariate generalization of their inversion number result, motivated by specializations related to the modular invariant theory of finite general linear groups.

math.CO↗

arXiv2011

Spectra of Symmetrized Shuffling Operators

(Abridged abstract) For a finite real reflection group W and a W-orbit O of flats in its reflection arrangement---or equivalently a conjugacy class of its parabolic subgroups---we introduce a statistic on elements of W. We then study the operator of right-multiplication within the group algebra of W by the element whose coefficients are given by this statistic. We reinterpret the operators geometrically in terms of the arrangement of reflecting hyperplanes for W. We show that they are self-adjoint and positive semidefinite. via two explicit factorizations into a symmetrized form A^t A. In one such factorization, A is a generalization of the projection of a simplex onto the linear ordering polytope. In the other factorization, A is the transition matrix for one of the well-studied Bidigare-Hanlon-Rockmore random walks on the chambers of an arrangement. We study the family of operators in which O is the conjugacy classes of Young subgroups of type (k,1^{n-k}). A special case within this family is the operator corresponding to random-to-random shuffling. We show in a purely enumerative fashion that these operators pairwise commute. We furthermore conjecture that they have integer spectrum, generalizing a conjecture of Uyemura-Reyes for the case k=n-1. We use representation theory to show that if O is a conjugacy class of rank one parabolics in W, the corresponding operator has integer spectrum. Our proof makes use of an (apparently) new family of twisted Gelfand pairs for W. We also study the family of operators in which O is the conjugacy classes of Young subgroups of type (2^k,1^{n-2k}). Here the construction of a Gelfand model for the symmetric group shows that these operators pairwise commute and that they have integer spectrum. For the symmetric group, we conjecture that apart from the two commuting families above, no other pair of operators of this form commutes.

math.CO↗

arXiv2011

Constructions for cyclic sieving phenomena

We show how to derive new instances of the cyclic sieving phenomenon from old ones via elementary representation theory. Examples are given involving objects such as words, parking functions, finite fields, and graphs.

math.CO↗

arXiv2010

The critical group of a line graph

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected graphs containing no cut-edge. Here the number of independent cycles in the graph, which is known to bound the number of generators for the critical group of the graph, is shown also to bound the number of generators for the critical group of its line graph. The second gives, for each prime p, a constraint on the p-primary structure of the critical group, based on the largest power of p dividing all sums of degrees of two adjacent vertices. The third deals with connected graphs whose line graph is regular. Here known results relating the number of spanning trees of the graph and of its line graph are sharpened to exact sequences which relate their critical groups. The first two results interact extremely well with the third. For example, they imply that in a regular nonbipartite graph, the critical group of the graph and that of its line graph determine each other uniquely in a simple fashion.

math.CO↗

arXiv2010

Koszul incidence algebras, affine semigroups, and Stanley-Reisner ideals

We prove a theorem unifying three results from combinatorial homological and commutative algebra, characterizing the Koszul property for incidence algebras of posets and affine semigroup rings, and characterizing linear resolutions of squarefree monomial ideals. The characterization in the graded setting is via the Cohen-Macaulay property of certain posets or simplicial complexes, and in the more general nongraded setting, via the sequential Cohen-Macaulay property.

math.AC↗

arXiv2009

Presenting the cohomology of a Schubert variety

We extend the short presentation due to [Borel '53] of the cohomology ring of a generalized flag manifold to a relatively short presentation of the cohomology of any of its Schubert varieties. Our result is stated in a root-system uniform manner by introducing the essential set of a Coxeter group element, generalizing and giving a new characterization of [Fulton '92]'s definition for permutations. Further refinements are obtained in type A.

math.CO↗

arXiv2009

(q,t)-analogues and GL_n(F_q)

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is the order of a finite field. These (q,t)-binomial coefficients and their interpretations generalize further in two directions, one relating to column-strict tableaux and Macdonald's ``seventh variation'' of Schur functions, the other relating to permutation statistics and Hilbert series from the invariant theory of GL_n(F_q).

math.CO↗