A note on the convexity number for complementary prisms

In the geodetic convexity, a set of vertices $S$ of a graph $G$ is $\textit{convex}$ if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$. The cardinality $con(G)$ of a maximum proper convex set $S$ of $G$ is the $\textit{convexity number}$ of $G$. The $\textit{complementary prism}$ $G\overline{G}$ of a graph $G$ arises from the disjoint union of the graph $G$ and $\overline{G}$ by adding the edges of a perfect matching between the corresponding vertices of $G$ and $\overline{G}$. In this work, we we prove that the decision problem related to the convexity number is NP-complete even restricted to complementary prisms, we determine $con(G\overline{G})$ when $G$ is disconnected or $G$ is a cograph, and we present a lower bound when $diam(G) \neq 3$.Comment: 10 pages, 2 figure

Chebyshev, Legendre, Hermite and other orthonormal polynomials in D-dimensions

We propose a general method to construct symmetric tensor polynomials in the D-dimensional Euclidean space which are orthonormal under a general weight. The D-dimensional Hermite polynomials are a particular case of the present ones for the case of a gaussian weight. Hence we obtain generalizations of the Legendre and of the Chebyshev polynomials in D dimensions that reduce to the respective well-known orthonormal polynomials in D=1 dimensions. We also obtain new D-dimensional polynomials orthonormal under other weights, such as the Fermi-Dirac, Bose-Einstein, Graphene equilibrium distribution functions and the Yukawa potential. We calculate the series expansion of an arbitrary function in terms of the new polynomials up to the fourth order and define orthonormal multipoles. The explicit orthonormalization of the polynomials up to the fifth order (N from 0 to 4) reveals an increasing number of orthonormalization equations that matches exactly the number of polynomial coefficients indication the correctness of the present procedure.Comment: 20 page