Pith. sign in

REVIEW 2 cited by

On the spectrum of directed uniform and non-uniform hypergraphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.06367 v3 pith:7MODMD5E submitted 2017-10-17 math.SP cs.NAmath.COmath.NA

Anirban Banerjee , Arnab Char This is my paper · ORCID
classification math.SPcs.NAmath.COmath.NA
keywords directedhypergraphsconnectivityuniformgeneralnon-uniformspectralbetter
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Here, we suggest a method to represent general directed uniform and non-uniform hypergraphs by different connectivity tensors. We show many results on spectral properties of undirected hypergraphs also hold for general directed uniform hypergraphs. Our representation of a connectivity tensor will be very useful for the further development in spectral theory of directed hypergraphs. At the end, we have also introduced the concept of weak* irreducible hypermatrix to better explain connectivity of a directed hypergraph.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Framework for Directed Hypergraph Signal Processing via tensor t-SVD

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    DHGSP extends graph signal processing to directed hypergraphs via t-SVD, defining adjacency tensor, shift operator, and t-DHGFT, outperforming baselines in traffic denoising.

  2. Spectral Theory of Hypergraphs: A Survey

    math.HO 2025-07 conditional

    A survey of hypergraph spectral theory via tensors, compiling known bounds, characteristic polynomials, and Turán-type results without new mathematical contributions.

Pith tools