Searcharxiv⌕ Search

arXiv subjects

Christian Gaetz

Publications and source records attributed to Christian Gaetz.

45 records · Page 3Linked to original sources
arXiv2020

Differential posets and restriction in critical groups

In recent work, Benkart, Klivans, and Reiner defined the critical group of a faithful representation of a finite group $G$, which is analogous to the critical group of a graph. In this paper we study maps between critical groups induced by injective group homomorphisms and in particular the map induced by restriction of the representation to a subgroup. We show that in the abelian group case the critical groups are isomorphic to the critical groups of a certain Cayley graph and that the restriction map corresponds to a graph covering map. We also show that when $G$ is an element in a differential tower of groups, critical groups of certain representations are closely related to words of up-down maps in the associated differential poset. We use this to generalize an explicit formula for the critical group of the permutation representation of the symmetric group given by the second author, and to enumerate the factors in such critical groups.

math.CO↗
arXiv2020

Path counting and rank gaps in differential posets

We study the gaps $Δp_n$ between consecutive rank sizes in $r$-differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen Miller's result that $Δp_n \geq 1$, which resolved a longstanding conjecture of Stanley, by showing that $Δp_n \geq 2r$. We also obtain stronger bounds in the case that the poset has many substructures called threads.

math.CO↗
arXiv2020

Separable elements in Weyl groups

We define the notion of a separable element in a finite Weyl group, generalizing the well-studied class of separable permutations. We prove that the upper and lower order ideals in weak Bruhat order generated by a separable element are rank-symmetric and rank-unimodal, and that the product of their rank generating functions gives that of the whole group, answering an open problem of Fan Wei. We also prove that separable elements are characterized by pattern avoidance in the sense of Billey and Postnikov.

math.CO↗
arXiv2020

A combinatorial duality between the weak and strong Bruhat orders

In recent work, the authors used an order lowering operator $\nabla$, introduced by Stanley, to prove the strong Sperner property for the weak Bruhat order on the symmetric group. Hamaker, Pechenik, Speyer, and Weigandt interpreted $\nabla$ as a differential operator on Schubert polynomials and used this to prove a new identity for Schubert polynomials and a determinant conjecture of Stanley. In this paper we study a raising operator $Δ$ for the \emph{strong} Bruhat order, which is in many ways dual to $\nabla$. We prove a Schubert identity dual to that of Hamaker et al. and derive formulas for counting weighted paths in the Hasse diagrams of the strong order which agree with path counting formulas for the weak order. We also show that powers of $\nabla$ and $Δ$ have the same Smith normal forms, which we describe explicitly, answering a question of Stanley.

math.CO↗
arXiv2019

Dual graded graphs and Bratteli diagrams of towers of groups

An $r$-dual tower of groups is a nested sequence of finite groups, like the symmetric groups, whose Bratteli diagram forms an $r$-dual graded graph. Miller and Reiner introduced a special case of these towers in order to study the Smith forms of the up and down maps in a differential poset. Agarwal and the author have also used these towers to compute critical groups of representations of groups appearing in the tower. In this paper I prove that when $r$ is one or prime, wreath products of a fixed group with the symmetric groups are the only $r$-dual tower of groups, and conjecture that this is the case for general values of $r$. This implies that these wreath products are the only groups for which one can define an analog of the Robinson-Schensted bijection in terms of a growth rule in a dual graded graph.

math.CO↗
arXiv2016

Critical groups of group representations

This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes the precise structure of the critical group both for the regular representation of any finite group, and for the reflection representation of the symmetric group.

math.CO↗
arXiv2016

Extreme rays of the $(N, k)$-Schur Cone

We discuss several partial results towards proving Dennis White's conjecture on the extreme rays of the $(N,2)$-Schur cone. We are interested in which vectors are extreme in the cone generated by all products of Schur functions of partitions with $k$ or fewer parts. For the case where $k =2$, White conjectured that the extreme rays are obtained by excluding a certain family of "bad pairs," and proved a special case of the conjecture using Farkas' Lemma. We present an alternate proof of the special case, in addition to showing more infinite families of extreme rays and reducing White's conjecture to two simpler conjectures.

math.CO↗
arXiv2015

K-Knuth Equivalence for Increasing Tableaux

A K-theoretic analogue of RSK insertion and Knuth equivalence relations was first introduced in 2006 by Buch, Kresch, Shimozono, Tamvakis, and Yong. The resulting K-Knuth equivalence relations on words and increasing tableaux on [n] has prompted investigation into the equivalence classes of tableaux arising from these relations. Of particular interest are the tableaux that are unique in their class, which we refer to as unique rectification targets (URTs). In this paper we give several new families of URTs and a bound on the length of intermediate words connecting two K-Knuth equivalent words. In addition, we describe an algorithm to determine if two words are K-Knuth equivalent and to compute all K-Knuth equivalence classes of tableaux on [n].

math.CO↗