We derive recursive relations of the characteristic polynomials for extended Sierpiński graphs at two successive iterations, based on which we determine all the eigenvalues, their corresponding ...

Karl Dilcher, Rob Noble, and Chris Smyth, Minimal polynomials of algebraic numbers with rational parameters. Acta Arith. 148 (2011), no. 3, 281-308. John B. Cosgrave, and Karl Dilcher, Mod p 3 ...

While the distinction between computationally infeasible and feasible problems has classically been “NP-hard vs. polynomial-time solvable,” in the big data era it becomes “polynomial-time vs. (quasi-) ...

Cycle multiplicity of a graph G is the maximum number of edge disjoint cycles in G. In this paper, we determine the cycle multiplicity of and then obtain the formula of cycle multiplicity of total ...

Among these, models relying on polynomial graph filters have shown promise. We observe that solutions to these polynomial graph filter models are also solutions to an overdetermined system of ...

Whether you’re passing secret notes in class or downloading images from a space probe, Reed-Solomon codes offer an ingenious way to embed information and correct for errors.

Multiplicity is the number of times a sequence occurs in the underlying sequence. Single-copy contigs (those with a multiplicity of one, occurring only once in the underlying sequence) are ...

The multiplicity will be the number of times of particular factor will appear in the factors of a polynomial. When a zero has the multiplicity of one that function will pass through the X intercept.