For a real symmetric matrix $H$ and distinct vertices $a,b$, we classify exponents $k$ for which $H^k$ has perfect state transfer (PST) from $a$ to $b$. If their supported eigenvalues are integer multiples of a common positive number, every odd exponent reduces to $H$ and every positive even exponent reduces to $H^2$. We determine the minimum transfer times using a greatest common divisor of supported spectral differences. For rational symmetric matrices, symmetry of the source vertex support about zero implies the odd-power equivalence without a commensurability assumption; this includes all bipartite graphs. If the source vertex supports zero, PST under one positive even power implies PST under every positive even power. For a symmetric three-point quadratic spectrum whose outer projection signs agree and differ from the central sign, a nonzero rational shift leaves exactly one PST exponent. We classify all adjacency powers of hypercubes, cycles, and Johnson graphs, and all adjacency squares of paths. In particular, the adjacency matrix of $P_7$ has PST from vertex $2$ to vertex $6$ only at exponent $2$.
For a fixed positive integer $n>1$, we study the prime powers $q$ coprime to $n$ for which all monic irreducible factors of $\Phi_n$ over $\F_q$ have the same coefficient Hamming weight. Cyclotomic orbit coefficients give a finite, effective classification of these fields. Outside finitely many computable characteristi...
We study the minimum time for perfect state transfer under polynomial Hamiltonians with bounded degree and spectral width. For a strongly cospectral pair and width bound $W$, the optimum, when finite, is an integer multiple of $\pi/W$, determined by integer interpolation with prescribed parities. For equally spaced sup...
For a graph $G$, let $q(G)$ be the minimum number of distinct eigenvalues of a real symmetric matrix whose off-diagonal zero--nonzero pattern is $G$. We prove that $q(G)=2$ whenever the complement $H=\overline G$ of a graph of order $n\ge3$ has at most $n-3$ edges, resolving the sparse-complement conjecture of Fallat a...
Let $S_m(a)$ denote the sum of the least positive residues in one multiplicative period of $a$ modulo $m$, of length $k$. We study the equality $S_m(a)=mk/2$ for $m=pq$, where $p,q$ are distinct odd primes and $k$ is even. Complementary pairing settles subgroups containing $-1$; the remaining cases depend on their embe...
We classify the exact evaluation of $\operatorname{Holant}(f\mid=_3)$ for every fixed complex algebraic symmetric Boolean ternary signature $f$. An input is a cubic bipartite multigraph: every vertex on one side carries $f$, every vertex on the other side carries ternary equality, and no auxiliary signatures are freely...
Given a rational matrix $A$, is every sufficiently large power $A^n$ entrywise nonnegative? We prove that this problem is decidable in deterministic polynomial time. This is in contrast with deciding eventual nonnegativity of a single prescribed entry sequence $(A^n)_{ij}$, which amounts to the Ultimate Positivity Prob...
Julian D'Costa· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.