Julianna S. Tymoczko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Latest Publications
- Open Access
Permutation actions on equivariant cohomology
This survey paper describes two geometric representations of the permutation group using the tools of toric topology. These actions are extremely useful for computational problems in Schubert calculus. The (torus) equivariant cohomology of the flag variety is constructed using the combinatorial description of Goresky-Kottwitz-MacPherson, discussed in detail. Two permutation representations on equivariant and ordinary cohomology are identified in terms of irreducible representations of the permutation group. We show how to use the permutation actions to construct divided difference operators and to give formulas for some localizations of certain equivariant classes. This paper includes several new results, in particular a new proof of the Chevalley-Monk formula and a proof that one of the natural permutation representations on the equivariant cohomology of the flag variety is the regular representation. Many examples, exercises, and open questions are provided.
Open AccessPermutation actions on equivariant cohomology
This survey paper describes two geometric representations of the permutation group using the tools of toric topology. These actions are extremely useful for computational problems in Schubert calculus. The (torus) equivariant cohomology of the flag variety is constructed using the combinatorial description of Goresky-Kottwitz-MacPherson, discussed in detail. Two permutation representations on equivariant and ordinary cohomology are identified in terms of irreducible representations of the permutation group. We show how to use the permutation actions to construct divided difference operators and to give formulas for some localizations of certain equivariant classes. This paper includes several new results, in particular a new proof of the Chevalley-Monk formula and a proof that one of the natural permutation representations on the equivariant cohomology of the flag variety is the regular representation. Many examples, exercises, and open questions are provided.
- Open Access
Linear conditions imposed on flag varieties
We study subvarieties of the flag variety called Hessenberg varieties, defined by certain linear conditions. These subvarieties arise naturally in applications including geometric representation theory, number theory, and numerical analysis. We describe completely the homology of Hessenberg varieties over GL_n(C) and show that they have no odd-dimensional homology. We provide an explicit geometric construction which partitions each Hessenberg variety into pieces homeomorphic to affine space. We characterize these affine pieces by fillings of Young tableaux and show that the dimension of the affine piece can be computed by combinatorial rules generalizing the Eulerian numbers. We give an equivalent formulation of this result in terms of roots. We conclude with a section on open questions.
Open AccessLinear conditions imposed on flag varieties
We study subvarieties of the flag variety called Hessenberg varieties, defined by certain linear conditions. These subvarieties arise naturally in applications including geometric representation theory, number theory, and numerical analysis. We describe completely the homology of Hessenberg varieties over GL_n(C) and show that they have no odd-dimensional homology. We provide an explicit geometric construction which partitions each Hessenberg variety into pieces homeomorphic to affine space. We characterize these affine pieces by fillings of Young tableaux and show that the dimension of the affine piece can be computed by combinatorial rules generalizing the Eulerian numbers. We give an equivalent formulation of this result in terms of roots. We conclude with a section on open questions.
- Open Access
An introduction to equivariant cohomology and homology, following Goresky, Kottwitz, and MacPherson
This paper provides an introduction to equivariant cohomology and homology using the approach of Goresky, Kottwitz, and MacPherson. When a group G acts suitably on a variety X, the equivariant cohomology of X can be computed using the combinatorial data of a skeleton of G-orbits on X. We give both a geometric definition and the traditional definition of equivariant cohomology. We include a discussion of the moment map and an algorithm for finding a set of generators for the equivariant cohomology of X. Many examples and explicit calculations are provided.
Open AccessAn introduction to equivariant cohomology and homology, following Goresky, Kottwitz, and MacPherson
This paper provides an introduction to equivariant cohomology and homology using the approach of Goresky, Kottwitz, and MacPherson. When a group G acts suitably on a variety X, the equivariant cohomology of X can be computed using the combinatorial data of a skeleton of G-orbits on X. We give both a geometric definition and the traditional definition of equivariant cohomology. We include a discussion of the moment map and an algorithm for finding a set of generators for the equivariant cohomology of X. Many examples and explicit calculations are provided.
- Open Access
Distinguishing numbers for graphs and groups
A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish the graph. It is one measure of the complexity of the graph. We extend these definitions to an arbitrary group action of G on a set X. A labelling \phi: X \longrightarrow {1,2,...,k} is distinguishing if no nontrivial element of G preserves \phi except those in the stabilizer of X. The distinguishing number of the group action on X is the minimum k needed for \phi to distinguish the group action. We show that distinguishing group actions is a more general problem than distinguishing graphs. We completely characterize actions of the symmetric group S_n on a set with distinguishing number n.
Open AccessDistinguishing numbers for graphs and groups
A graph G is distinguished if its vertices are labelled by a map \phi: V(G) \longrightarrow {1,2,...,k} so that no graph automorphism preserves \phi. The distinguishing number of G is the minimum number k necessary for \phi to distinguish the graph. It is one measure of the complexity of the graph. We extend these definitions to an arbitrary group action of G on a set X. A labelling \phi: X \longrightarrow {1,2,...,k} is distinguishing if no nontrivial element of G preserves \phi except those in the stabilizer of X. The distinguishing number of the group action on X is the minimum k needed for \phi to distinguish the group action. We show that distinguishing group actions is a more general problem than distinguishing graphs. We completely characterize actions of the symmetric group S_n on a set with distinguishing number n.
- Open Access
Decomposing Hessenberg varieties over classical groups
Hessenberg varieties are a family of subvarieties of the flag variety, including the Springer fibers, the Peterson variety, and the entire flag variety itself. The seminal example arises from a problem in numerical analysis and consists for a fixed linear operator M of the full flags V_1 \subsetneq V_2 >... \subsetneq V_n in GL_n with M V_i contained in V_{i+1} for all i. In this paper I show that all Hessenberg varieties in type A_n and semisimple and regular nilpotent Hessenberg varieties in types B_n,C_n, and D_n can be paved by affine spaces. Moreover, this paving is the intersection of a particular Bruhat decomposition with the Hessenberg variety. In type A_n, an equivalent description of the cells of the paving in terms of certain fillings of a Young diagram can be used to compute the Betti numbers of Hessenberg varieties. As an example, I show that the Poincare polynomial of the Peterson variety in A_n is \sum_{i =0}^{n-1} \binom{n-1}{i} x^{2i}.
Open AccessDecomposing Hessenberg varieties over classical groups
Hessenberg varieties are a family of subvarieties of the flag variety, including the Springer fibers, the Peterson variety, and the entire flag variety itself. The seminal example arises from a problem in numerical analysis and consists for a fixed linear operator M of the full flags V_1 \subsetneq V_2 >... \subsetneq V_n in GL_n with M V_i contained in V_{i+1} for all i. In this paper I show that all Hessenberg varieties in type A_n and semisimple and regular nilpotent Hessenberg varieties in types B_n,C_n, and D_n can be paved by affine spaces. Moreover, this paving is the intersection of a particular Bruhat decomposition with the Hessenberg variety. In type A_n, an equivalent description of the cells of the paving in terms of certain fillings of a Young diagram can be used to compute the Betti numbers of Hessenberg varieties. As an example, I show that the Poincare polynomial of the Peterson variety in A_n is \sum_{i =0}^{n-1} \binom{n-1}{i} x^{2i}.
- Open Access
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R63
Distinguishing Numbers for Graphs and Groups
A graph $G$ is distinguished if its vertices are labelled by a map $\phi: V(G) \longrightarrow \{1,2,\ldots, k\}$ so that no non-trivial graph automorphism preserves $\phi$. The distinguishing number of $G$ is the minimum number $k$ necessary for $\phi$ to distinguish the graph. It measures the symmetry of the graph. We extend these definitions to an arbitrary group action of $\Gamma$ on a set $X$. A labelling $\phi: X \longrightarrow \{1,2,\ldots,k\}$ is distinguishing if no element of $\Gamma$ preserves $\phi$ except those which fix each element of $X$. The distinguishing number of the group action on $X$ is the minimum $k$ needed for $\phi$ to distinguish the group action. We show that distinguishing group actions is a more general problem than distinguishing graphs. We completely characterize actions of $S_n$ on a set with distinguishing number $n$, answering an open question of Albertson and Collins.- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R63
Open AccessDistinguishing Numbers for Graphs and Groups
A graph $G$ is distinguished if its vertices are labelled by a map $\phi: V(G) \longrightarrow \{1,2,\ldots, k\}$ so that no non-trivial graph automorphism preserves $\phi$. The distinguishing number of $G$ is the minimum number $k$ necessary for $\phi$ to distinguish the graph. It measures the symmetry of the graph. We extend these definitions to an arbitrary group action of $\Gamma$ on a set $X$. A labelling $\phi: X \longrightarrow \{1,2,\ldots,k\}$ is distinguishing if no element of $\Gamma$ preserves $\phi$ except those which fix each element of $X$. The distinguishing number of the group action on $X$ is the minimum $k$ needed for $\phi$ to distinguish the group action. We show that distinguishing group actions is a more general problem than distinguishing graphs. We completely characterize actions of $S_n$ on a set with distinguishing number $n$, answering an open question of Albertson and Collins.