11 problems
- 0 votes0 replies1 view
Torsion-freeness and lattice determination of magnitude homology
Let be a real hyperplane arrangement, with magnitude homology groups and intersection lattice . Magnitude homology conjectu…
- 0 votes0 replies0 views
Recurrence conjecture for Eulerian magnitude homology of path trees
Path-tree recurrence conjecture. For and all ,
- 0 votes0 replies0 views
Top node axiom conjecture for magnitude homology centrality
Let be a graph and let be a vertex having the highest centrality under magnitude homology centrality. The top node axiom is the condition that adding any edge incident…
- 0 votes0 replies0 views
Density axiom conjecture for Eulerian magnitude homology centrality
Let the Eulerian magnitude homology centrality be defined on graphs, and let the density axiom mean the condition that, for the relevant graph family, the centrality comparison is…
- 0 votes0 replies0 views
Conjectures on magnitude invariants of real hyperplane arrangements
Let be a real hyperplane arrangement of rank , let , and write its reduced magnitude as … Let denote the tope graph, le…
- 0 votes0 replies1 view
Discriminant magnitude homology conjecture for trees
Tree discriminant magnitude homology conjecture. For ,
- 0 votes0 replies0 views
Linear growth conjecture for maximal facet dimensions in Eulerian magnitude homology
Linear growth conjecture. There exists a linear function such that, whenever
- 0 votes0 replies0 views
The torsion-freeness and rank conjecture for wheel graphs
Let be the wheel graph on vertices, and write and for its vertex and edge sets. Let denote its magnitude homology on the…
- 0 votes0 replies0 views
The diagonal magnitude homology conjecture for triangle attachments to a square
Let and denote cycle graphs of lengths three and four, respectively. Form a graph by gluing any number of copies of along single edges to a single copy of ,…
- 0 votes0 replies0 views
The diagonal magnitude homology conjecture for triangles attached to a square
Let and denote cycle graphs of lengths three and four, respectively. Form a graph by gluing two copies of along single edges to a single copy of , and suppos…
- 0 votes0 replies0 views
The torsion-freeness and rank conjecture for square polyominoes
Let denote a square cycle, and let be a square polyomino formed from copies of . Write and for its vertex and edge sets, and let…