VRVictor Reiner

Victor Reiner

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Victor Reiner has a total of 84 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The cyclotomic polynomial topologically

    by Gregg Musiker, Victor Reiner

    We interpret the coefficients of the cyclotomic polynomial in terms of simplicial homology.

  • Cyclic quasi-symmetric functions

    by Ron M. Adin, Ira M. Gessel, Victor Reiner, Yuval Roichman


  • Whitney Numbers for Poset Cones

    by Galen Dorpalen-Barry, Jang Soo Kim, Victor Reiner


  • Invariant theory for coincidental complex reflection groups

    by Victor Reiner, Anne V. Shepler, Eric Sommers


  • Open Access

    Whitney Numbers for Poset Cones

    by Galen Dorpalen-Barry, Jang Soo Kim, Victor Reiner

    Hyperplane arrangements dissect $\mathbb{R}^n$ into connected components called chambers, and a well-known theorem of Zaslavsky counts chambers as a sum of nonnegative integers called Whitney numbers of the first kind. His theorem generalizes to count chambers within any cone defined as the intersection of a collection of halfspaces from the arrangement, leading to a notion of Whitney numbers for each cone. This paper focuses on cones within the braid arrangement, consisting of the reflecting hyperplanes $x_i=x_j$ inside $\mathbb{R}^n$ for the symmetric group, thought of as the type $A_{n-1}$ reflection group. Here cones correspond to posets, chambers within the cone correspond to linear extensions of the poset, and the Whitney numbers of the cone interestingly refine the number of linear extensions of the poset. We interpret this refinement for all posets as counting linear extensions according to a statistic that generalizes the number of left-to-right maxima of a permutation. When the poset is a disjoint union of chains, we interpret this refinement differently, using Foata's theory of cycle decomposition for multiset permutations, leading to a simple generating function compiling these Whitney numbers.

  • Open Access

    Hopf Algebras in Combinatorics

    by Darij Grinberg, Victor Reiner

    These notes -- originating from a one-semester class by their second author at the University of Minnesota -- survey some of the most important Hopf algebras appearing in combinatorics. After introducing coalgebras, bialgebras and Hopf algebras in general, we study the Hopf algebra of symmetric functions, including Zelevinsky's axiomatic characterization of it as a "positive self-adjoint Hopf algebra" and its application to the representation theory of symmetric and (briefly) finite general linear groups. The notes then continue with the quasisymmetric and the noncommutative symmetric functions, some Hopf algebras formed from graphs, posets and matroids, and the Malvenuto-Reutenauer Hopf algebra of permutations. Among the results surveyed are the Littlewood-Richardson rule and other symmetric function identities, Zelevinsky's structure theorem for PSHs, the antipode formula for P-partition enumerators, the Aguiar-Bergeron-Sottile universal property of QSym, the theory of Lyndon words, the Gessel-Reutenauer bijection, and Hazewinkel's polynomial freeness of QSym. The notes are written with a graduate student reader in mind, being mostly self-contained but requiring a good familiarity with multilinear algebra and -- for the representation-theory applications -- basic group representation theory.


  • Open Access

    Critical groups of covering, voltage, and signed graphs

    by Victor Reiner, Dennis Tseng

    Graph coverings are known to induce surjections of their critical groups. Here we describe the kernels of these morphisms in terms of data parametrizing the covering. Regular coverings are parametrized by voltage graphs, and the above kernel can be identified with a naturally defined voltage graph critical group. For double covers, the voltage graph is a signed graph, and the theory takes a particularly pleasant form, leading also to a theory of double covers of signed graphs.

  • Open Access

    Diameter of reduced words

    by Victor Reiner, Yuval Roichman

    For finite reflection groups of types A and B, we determine the diameter of the graph whose vertices are reduced words for the longest element and whose edges are braid relations. This is deduced from a more general theorem that applies to supersolvable hyperplane arrangements.

  • Open Access

    A quasisymmetric function for matroids

    by Louis J. Billera, Ning Jia, Victor Reiner

    A new isomorphism invariant of matroids is introduced, in the form of a quasisymmetric function. This invariant (1) defines a Hopf morphism from the Hopf algebra of matroids to the quasisymmetric functions, which is surjective if one uses rational coefficients, (2) is a multivariate generating function for integer weight vectors that give minimum total weight to a unique base of the matroid, (3) is equivalent, via the Hopf antipode, to a generating function for integer weight vectors which keeps track of how many bases minimize the total weight, (4) behaves simply under matroid duality, (5) has a simple expansion in terms of P-partition enumerators, and (6) is a valuation on decompositions of matroid base polytopes. This last property leads to an interesting application: it can sometimes be used to prove that a matroid base polytope has no decompositions into smaller matroid base polytopes. Existence of such decompositions is a subtle issue arising in work of Lafforgue, where lack of such a decomposition implies the matroid has only a finite number of realizations up to projective equivalence.

  • Open Access

    Cyclic quasi-symmetric functions

    by Ron M. Adin, Ira M. Gessel, Victor Reiner, Yuval Roichman

    The ring of cyclic quasi-symmetric functions and its non-Escher subring are introduced in this paper. A natural basis consists of fundamental cyclic quasi-symmetric functions; for the non-Escher subring they arise as toric $P$-partition enumerators, for toric posets $P$ with a total cyclic order. The associated structure constants are determined by cyclic shuffles of permutations. We then prove the following positivity phenomenon: for every non-hook shape $\lambda$, the coefficients in the expansion of the Schur function $s_\lambda$ in terms of fundamental cyclic quasi-symmetric functions are nonnegative. The proof relies on the existence of a cyclic descent map on the standard Young tableaux (SYT) of shape $\lambda$. The theory has applications to the enumeration of cyclic shuffles and SYT by cyclic descents.