Buscar
Mostrando ítems 1-5 de 5
Artículo
Borsuk Number for Planar Convex Bodies
(Springer, 2019-12-14)
By using some simple tools from graph theory, we obtain a characterization of the compact sets in Rn with Borsuk number equal to two. This result allows to give some examples of planar (convex) compact sets with Borsuk ...
Artículo
On permanents of Sylvester Hadamard matrices
(Cornell University, 2013)
It is well-known that the evaluation of the permanent of an arbitrary (−1, 1)- matrix is a formidable problem. Ryser’s formula is one of the fastest known general algorithms for computing permanents. In this paper, Ryser’s ...
Artículo
The maximal determinant of cocyclic (−1, 1)-matrices over D2t
(Elsevier, 2012)
Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices satisfy that and give the solution to the maximal determinant problem when or a multiple of 4. In this paper, we approach ...
Artículo
Irreductible Triangulations of the Once-Punctured Torus
(Sobolev Institute of Mathematics, 2018)
A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. ...
Artículo
Optimal preparation of graph states
(American Physical Society, 2011)
We show how to prepare any graph state of up to 12 qubits with (a) the minimum number of controlled-Z gates and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the ...