15 citations · 27 across the 7 of their papers we have counts for
8 papers
Enumeration of Nondegenerate Hypermatrices
Brandon Koprowski, Joel Brewster Lewis
We consider the problem of enumerating hypermatrices of format over a finite field that have nonzero hyperdeterminant and whose nonzero entries are rest…
Upho lattices II: ways of realizing a core
Sam Hopkins, Joel B. Lewis
A poset is called upper homogeneous, or "upho," if all of its principal order filters are isomorphic to the whole poset. In previous work of the first author, it was shown that eac…
Interval-closed set rowmotion and homomesy on products of two chains
Nadia Lafrenière, Joel Brewster Lewis, Erin McNicholas +2
We study rowmotion dynamics on interval-closed sets. Our first main result proves a simplification of the global definition of interval-closed set rowmotion from (Elder, Lafrenière…
Global patterns in signed permutations
Owen John Levens, Joel Brewster Lewis, Bridget Eileen Tenner
Global permutation patterns have recently been shown to characterize important properties of a Coxeter group. Here we study global patterns in the context of signed permutations, w…
Disarray, reduced words, and 321-avoidance in George groups
Joel Brewster Lewis, Bridget Eileen Tenner
Previous work has shown that the disarray (or displacement) of an (affine) (signed) permutation is bounded in terms of its Coxeter length. Here, we characterize the permutations fo…
Combinatorial formulas for shifted dual stable Grothendieck polynomials
Joel Brewster Lewis, Eric Marberg
The -theoretic Schur - and -functions and may be concretely defined as weight generating functions for semistandard shifted set-valued tableaux. These symmet…
Computing reflection length in an affine Coxeter group
Joel Brewster Lewis, Jon McCammond, T. Kyle Petersen +1
In any Coxeter group, the conjugates of elements in its Coxeter generating set are called reflections and the reflection length of an element is its length with respect to this exp…
Enumeration of Graded (3+1)-Avoiding Posets
Joel Brewster Lewis, Yan X Zhang
The notion of (3+1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumeration of all (3+1)-avoiding posets remains open. In this paper, we…