Susanna Fishel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Susanna Fishel has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Glenn Hurlbert
Virginia Commonwealth University
2 shared publications - Karen Meagher
Univ Regina, Dept Math & Stat, Regina, SK S4S 0A2, Canada
2 shared publications - Luis Pena
Instituto de Matemática y Física, Universidad de Talca, Talca, Chile
2 shared publications - Vikram Kamat
Department of Mathematics & Statistics Villanova University Villanova PA USA
2 shared publications - Bridget Eileen Tenner
Department of Mathematical Sciences, DePaul University, Chicago, USA
1 shared publication - Eleni Tzanaki
Department of Applied Mathematics, University of Crete, Heraklion, Greece
1 shared publication
Latest Publications
- 11 September 2025
- Published by Springer Nature in Arabian Journal of Mathematics
- Vol. 15 (2) , 1-9
Parking functions with zero secondary dinv
- 11 September 2025
- Published by Springer Nature in Arabian Journal of Mathematics
- Vol. 15 (2) , 1-9
Parking functions with zero secondary dinv
- Open Access
Parking functions with zero secondary dinv
We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.Open AccessParking functions with zero secondary dinv
We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$. - Open Access
Fundamental quasisymmetric functions in superspace
The fundamental quasisymmetric functions in superspace are a generalization of the fundamental quasisymmetric functions involving anticommuting variables. We obtain the action of the product, coproduct, and antipode on the fundamental quasisymmetric functions in superspace. We also extend to superspace the well known expansion of the Schur functions in terms of fundamental quasisymmetric functions.
Open AccessFundamental quasisymmetric functions in superspace
The fundamental quasisymmetric functions in superspace are a generalization of the fundamental quasisymmetric functions involving anticommuting variables. We obtain the action of the product, coproduct, and antipode on the fundamental quasisymmetric functions in superspace. We also extend to superspace the well known expansion of the Schur functions in terms of fundamental quasisymmetric functions.
- 9 May 2021
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 299 (3-4) , 2215-2255
Unitary representations of the Cherednik algebra: $V^*$-homology- 9 May 2021
- Published by Springer Nature in Mathematische Zeitschrift
- Vol. 299 (3-4) , 2215-2255
Unitary representations of the Cherednik algebra: $V^*$-homology- Open Access
A survey of the Shi arrangement
In 1983, Lusztig defined a map $\sigma$ from affine permutations of $n$ to partitions of $n$. He conjectured that for any partition $\lambda$ of $n$, $\sigma^{-1}(\lambda)$ is a two-sided cell. Shi, in 1986, proved part of this conjecture. As a byproduct, he introduced the Shi arrangement of hyperplanes and found a few of its remarkable properties. The Shi arrangement has since become a central object in algebraic combinatorics. This article is intended to be a fairly gentle introduction to the Shi arrangement, intended for readers with a modest background in combinatorics, algebra, and Euclidean geometry.Open AccessA survey of the Shi arrangement
In 1983, Lusztig defined a map $\sigma$ from affine permutations of $n$ to partitions of $n$. He conjectured that for any partition $\lambda$ of $n$, $\sigma^{-1}(\lambda)$ is a two-sided cell. Shi, in 1986, proved part of this conjecture. As a byproduct, he introduced the Shi arrangement of hyperplanes and found a few of its remarkable properties. The Shi arrangement has since become a central object in algebraic combinatorics. This article is intended to be a fairly gentle introduction to the Shi arrangement, intended for readers with a modest background in combinatorics, algebra, and Euclidean geometry. - 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 266, 65-75
Erdős–Ko–Rado theorems on the weak Bruhat lattice
- 1 August 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 266, 65-75
Erdős–Ko–Rado theorems on the weak Bruhat lattice
- Open Access
Erdős-Ko-Rado theorems on the weak Bruhat lattice}
Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the maximum intersecting ${\cal P}$ in the lattice of subsets of a finite set with the additional condition that ${\cal P}$ is contained within a level of the lattice. The Erd\H{o}s-Ko-Rado theorem has been extensively studied and generalized to other objects and lattices. In this paper, we focus on intersecting families of permutations as defined with respect to the weak Bruhat lattice. In this setting, we prove analogs of certain extremal results on intersecting set systems. In particular we give a characterization of the maximum intersecting families of permutations in the Bruhat lattice. We also characterize the maximum intersecting families of permutations within the $r^{\textrm{th}}$ level of the Bruhat lattice of permutations of size $n$, provided that $n$ is large relative to $r$.Open AccessErdős-Ko-Rado theorems on the weak Bruhat lattice}
Let ${\mathscr L}=(X,\preceq)$ be a lattice. For ${\cal P}\subseteq X$ we say that ${\cal P}$ is $t$-{\it intersecting} if ${\sf rank}(x\wedge y)\ge t$ for all $x,y\in{\cal P}$. The seminal theorem of Erd\H{o}s, Ko and Rado describes the maximum intersecting ${\cal P}$ in the lattice of subsets of a finite set with the additional condition that ${\cal P}$ is contained within a level of the lattice. The Erd\H{o}s-Ko-Rado theorem has been extensively studied and generalized to other objects and lattices. In this paper, we focus on intersecting families of permutations as defined with respect to the weak Bruhat lattice. In this setting, we prove analogs of certain extremal results on intersecting set systems. In particular we give a characterization of the maximum intersecting families of permutations in the Bruhat lattice. We also characterize the maximum intersecting families of permutations within the $r^{\textrm{th}}$ level of the Bruhat lattice of permutations of size $n$, provided that $n$ is large relative to $r$. - Open Access
Enumerations relating braid and commutation classes
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.
Open AccessEnumerations relating braid and commutation classes
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.
- 1 April 2015
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 131, 153-186
Results and conjectures on the number of standard strong marked tableaux
- 1 April 2015
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 131, 153-186
Results and conjectures on the number of standard strong marked tableaux