V.Buchstaber | V.Cherepanov | M.Masuda | G.Solomadin | K.Sorokin |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & \ast \\ \ast & \ast & & \\ \ast & & \ast & \\ \ast & & & \ast \end{pmatrix} \] | |
Star graph | Arrowhead matrix |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & \ast \\ \ast & \ast & \ast & \ast \\ \ast & \ast & \ast & \ast \\ \ast & \ast & \ast & \ast \end{pmatrix} \] | |
Full graph | Full matrix |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & & \\ \ast & \ast & \ast & \\ & \ast & \ast & \ast \\ & & \ast & \ast \end{pmatrix} \] | |
Path graph | Tridiagonal matrix |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & & & \ast\\ \ast & \ast & \ast & & \\ & \ast & \ast & \ast & \\ & & \ast & \ast & \ast \\ \ast & & & \ast & \ast \end{pmatrix} \] | |
Cycle graph | Periodic tridiag- onal matrix |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & & & \ast\\ \ast & \ast & \ast & & \\ & \ast & \ast & \ast & \\ & & \ast & \ast & \ast \\ \ast & & & \ast & \ast \end{pmatrix} \] | $\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & \ast \\ \ast & \ast & & \\ \ast & & \ast & \\ \ast & & & \ast \end{pmatrix} \] |
This is a torus.
Move cursor to pick an element and act on a matrix! |
$\circlearrowright$ |
|
||||||||||||||||||
[edit] |
Definition: $X$ is called equivariantly formal if its Serre spectral sequence degenerates at $E_2$.
Definition: $X$ is called equivariantly formal if its Serre spectral sequence degenerates at $E_2$.
Equivalently (fixed points are isolated): Equivariant formality $\Leftrightarrow$ $H^{odd}(X)=0$.
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & \ast \\ \ast & \ast & \ast & \ast \\ \ast & \ast & \ast & \ast \\ \ast & \ast & \ast & \ast \end{pmatrix} \] | |
Full graph | Full matrix |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & & \\ \ast & \ast & \ast & \\ & \ast & \ast & \ast \\ & & \ast & \ast \end{pmatrix} \] | |
Path graph $\mathbb{I}_n$ | Tridiagonal matrix |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & & \\ \ast & \ast & \ast & \ast & \\ \ast & \ast & \ast & \ast & \\ & \ast & \ast & \ast & \ast \\ & & & \ast & \ast \\ \end{pmatrix} \] |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & \ast \\ \ast & \ast & & \\ \ast & & \ast & \\ \ast & & & \ast \end{pmatrix} \] | |
Star graph $St_n$ | Arrowhead matrix |
Theorem (Gal-Januszkiewicz, unpublished):
$M_{St_3,\lambda}/T$ is a solid torus with boundary subdivided into hexagons.
Therefore, from Masuda-Panov theorem it follows that $M_{St_3,\lambda}$ is not equivariantly formal. |
|
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & & & \ast\\ \ast & \ast & \ast & & \\ & \ast & \ast & \ast & \\ & & \ast & \ast & \ast \\ \ast & & & \ast & \ast \end{pmatrix} \] | |
Cycle graph $Cy_n$ | Periodic tridiag- onal matrix |
But I proved: $M_{Cy_n,\lambda}/T\cong S^4\times T^{n-3}$.
Which graphs correspond to staircase matrices?
Definition: Graph $\Gamma$ is called indifference graph if it is the intersection graph of some collection of unit intervals on a line $\mathbb{R}$.
Also called unit interval graphs or proper interval graphs.
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast & & \\ \ast & \ast & \ast & \ast & \\ \ast & \ast & \ast & \ast & \\ & \ast & \ast & \ast & \ast \\ & & & \ast & \ast \\ \end{pmatrix} \] |
$\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \ast \\ \ast & \ast & \\ \ast & & \ast \end{pmatrix} \] | $\Rightarrow$ | \[ \begin{pmatrix} \ast & \ast & \\ \ast & \ast & \ast \\ & \ast & \ast \end{pmatrix} \] |
Original matrix: |
|
At each step we represent a matrix $A_i$ as $Q\cdot R$ and take $A_{i+1}=R\cdot Q$. Here $Q$ is orgthogonal, $R$ is upper triangular. |
Fill in the matrix above. Press "u" to upload. Press "q" to make QR step. After 0 iterations: |
|
"$\Gamma$ is not an indifference graph" $\Rightarrow$ "$M_{\Gamma,\lambda}$ is not formal".
Induced | Not induced |
Claw $St_3$ | Holes $Cy_k$, $k\geq 4$ | $Net$ | $Sun$ |
To do this, we developed a general approach.
Cases: |
|
\[ \begin{pmatrix} \ast & \ast & \ast & \ast & & \\ \ast & \ast & \ast & & \ast & \\ \ast & \ast & \ast & & & \ast \\ \ast & & & \ast & & \\ & \ast & & & \ast & \\ & & \ast & & & \ast \\ \end{pmatrix}, \begin{pmatrix} \ast & \ast & \ast & & \ast & \ast \\ \ast & \ast & \ast & \ast & & \ast\\ \ast & \ast & \ast & \ast & \ast & \\ & \ast & \ast & \ast & & \\ \ast& & \ast & & \ast & \\ \ast & \ast & & & & \ast \\ \end{pmatrix} \] |
Cases: |
|
\[ \begin{pmatrix} \ast & \ast & \ast & \ast & & \\ \ast & \ast & \ast & & \ast & \\ \ast & \ast & \ast & & & \ast \\ \ast & & & \ast & & \\ & \ast & & & \ast & \\ & & \ast & & & \ast \\ \end{pmatrix}, \begin{pmatrix} \ast & \ast & \ast & & \ast & \ast \\ \ast & \ast & \ast & \ast & & \ast\\ \ast & \ast & \ast & \ast & \ast & \\ & \ast & \ast & \ast & & \\ \ast& & \ast & & \ast & \\ \ast & \ast & & & & \ast \\ \end{pmatrix} \] |
An extended version of this presentation is available here. | Source code and instructions on usage lie on Github. |