In search of hyperpaths

DOI10.1007/s00454-021-00360-xOpenAlexW4206544374MaRDI QIDQ2690124

Amir Dahari, Nathan Linial

Publication date: 15 March 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.09936

zbMATH Keywords

finite fieldssimplicial complexeslinear algebramatrix multiplicationhigh-dimensional combinatoricshypertrees

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Direct numerical methods for linear systems and matrix inversion (65F05) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the phase transition in random simplicial complexes
• Sum complexes---a new family of hypertrees
• Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
• Generalized matrix inversion is not harder than matrix multiplication
• Effective algorithms with circulant-block matrices
• Lower bounds for the multiplicative complexity of matrix multiplication
• Extremal hypercuts and shadows of simplicial complexes
• Collapsibility and vanishing of top homology in random simplicial complexes
• Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
• A recursive algorithm for the inversion of matrices with circulant blocks
• Powers of tensors and fast matrix multiplication
• Enumeration and randomized constructions of hypertrees

This page was built for publication: In search of hyperpaths