Related papers: Eigenvalue bounds and alternating rank-metric code…
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…
We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
We compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte…
In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposition. This method is based on the computation of maximal singular values and the…
The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander…
A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are…
We prove an elementary yet useful inequality bounding the maximal value of certain linear programs. This leads directly to a bound on the martingale difference for arbitrarily dependent random variables, providing a generalization of some…
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…
We obtain tight upper and lower bounds to the eigenvalues of an anharmonic oscillator with a rational potential. We compare our bounds with results given by other approaches.
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
We investigate the asymptotic rates of length-$n$ binary codes with VC-dimension at most $dn$ and minimum distance at least $\delta n$. Two upper bounds are obtained, one as a simple corollary of a result by Haussler and the other via a…
We find an asymptotic expression for the first eigenvalue of the biharmonic operator on a long thin rectangle. This is done by finding lower and upper bounds which become increasingly accurate with increasing length. The lower bound is…
We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…
The relative distance between eigenvalues of the compression of a not necessarily semibounded self-adjoint operator to a closed subspace and some of the eigenvalues of the original operator in a gap of the essential spectrum is considered.…