A unified switching construction produces E-cospectral uniform hypergraphs and shows that one standard method for computing E-characteristic polynomials is uninformative for almost all hypergraphs.
Linear and Multilinear Algebra0(0), 1–11 (2024)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Signed random combinatorial matrices with exactly n/2 zeros per row have smallest singular value at least order 1/sqrt(n) with probability 1 minus O(ε) minus exp(-cn).
A star-product reformulation of nonautonomous linear fractional DEs enables both closed-form solutions in special cases and a discretization scheme for numerical computation.
citing papers explorer
-
A general switching method for constructing E-cospectral hypergraphs
A unified switching construction produces E-cospectral uniform hypergraphs and shows that one standard method for computing E-characteristic polynomials is uninformative for almost all hypergraphs.
-
The smallest singular value of signed random combinatorial matrices
Signed random combinatorial matrices with exactly n/2 zeros per row have smallest singular value at least order 1/sqrt(n) with probability 1 minus O(ε) minus exp(-cn).
-
A $\star$-Product Approach for Analytical and Numerical Solutions of Nonautonomous Linear Fractional Differential Equations
A star-product reformulation of nonautonomous linear fractional DEs enables both closed-form solutions in special cases and a discretization scheme for numerical computation.