SearcharxivSearch

arXiv subjects

Boris Horvat

Publications and source records attributed to Boris Horvat.

3 recordsLinked to original sources

Completing the rank identity for Hadamard powers of Euclidean distance matrices

Horvat et al. (J. Math. Chem., 2014) showed that the rank of the $n$-th Hadamard power $D^{(n)}$ of a Euclidean distance matrix satisfies $\operatorname{rank}D^{(n)} \le R_d^n$, and proved that the inequality is strict whenever an annihilating polynomial exists. The converse - that the absence of annihilating polynomials forces $\operatorname{rank}D^{(n)} = R_d^n$ - was left as an open problem. We resolve it by exhibiting a kernel factorisation $D^{(n)} = \Phi_V\, M\, \Phi_V^T$, where $\Phi_V$ is the evaluation matrix on the polynomial space $V$ and $M$ is a universal matrix independent of the point configuration. A trinomial expansion of the kernel reveals that $M$ has a block-diagonal structure whose blocks are sums of Gram matrices with positive coefficients; this yields the non-singularity of~$M$ and completes the rank identity.

math.RA

On the computational complexity of degenerate unit distance representations of graphs

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent vertices are drawn in the same point, we say that the representation is degenerate. The dimension (the Euclidean dimension) of a graph is defined to be the minimum integer k needed that a given graph has non-degenerate k dimensional unit distance representation (with the property that non-adjacent vertices are mapped to points, that are not distance one appart). It is proved that deciding if an input graph is homomorphic to a graph with dimension k >= 2 (with the Euclidean dimension k >= 2) are NP-hard problems.

math.CO

On the Number of Hamiltonian Groups

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.

math.CO