More on the complexity of cover graphs
In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.
In response to [3] and [4] we prove that the recognition of cover graphs of finite posets is an NP-hard problem.
We introduce a very weak version of the square principle which may hold even under failure of the generalized continuum hypothesis. Under this weak square principle, we give a new characterization (Theorem 10) of partial orderings with κ-Freese-Nation property (see below for the definition). The characterization is not a ZFC theorem: assuming Chang’s Conjecture for , we can find a counter-example to the characterization (Theorem 12). We then show that, in the model obtained by adding Cohen reals,...
In this paper we study -EP matrices, as a generalization of EP-matrices in indefinite inner product spaces, with respect to indefinite matrix product. We give some properties concerning EP and -EP matrices and find connection between them. Also, we present some results for reverse order law for Moore-Penrose inverse in indefinite setting. Finally, we deal with the star partial ordering and improve some results given in the “EP matrices in indefinite inner product spaces” (2012), by relaxing some...