학술

Computations with diagonal simplicial tensor modules

arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

Abstract

For each vertex order $\pi$ of a finite simple graph on at least two vertices, insert an isolated vertex between successive vertices.

In the resulting adjacency matrix $A$, deleting row $i$ and column $i$ gives a principal submatrix $A_i$.

The alternating sum of the $A_i$ is the simplicial boundary of $A$ and has full rank over $\mathbb F_2$ exactly when $\pi$ traces a Hamiltonian path.

Each Hamiltonian path gives two full-rank orders.

We tabulate boundary rank distributions over all vertex orders of the Petersen, $4\times4$ rook, and Shrikhande graphs.

Full-rank counts distinguish the cospectral rook and Shrikhande graphs.

For each finite graph, vertex and edge tensors in a three-axis diagonal simplicial tensor module generate a simplicial submodule whose normalized chains form the graph's incidence complex and compute its homology.

Let $X$ be a diagonal simplicial tensor module on $k\ge1$ axes over a nonzero unital commutative ring.

We give coordinate bases for its horn kernels and normalized chains.

A horn has a unique filler exactly when its degree exceeds $k$.

For a shape in $X$ of simplicial dimension $n$ (shortest axis length $n+1$), the simplicial module $X$ is an $n$-hypergroupoid exactly when $k\le n$.

We prove analogous bounds for horn filling in a dendroidal module on rooted trees.

Over a field, we construct a rational map from the space of hypermatrices of fixed shape and degree to a product of Grassmannians.

The reduced closure of its image is rational and, over $\mathbb C$, is isomorphic to a Schubert variety.

Python code for this paper's examples and rank tables is at this https URL.

관련 뉴스