143,751 research outputs found
Zero patterns and unitary similarity
A subspace of the space, L(n), of traceless complex matrices can
be specified by requiring that the entries at some positions be zero.
The set, , of these positions is a (zero) pattern and the corresponding
subspace of L(n) is denoted by . A pattern is universal if every
matrix in L(n) is unitarily similar to some matrix in . The problem of
describing the universal patterns is raised, solved in full for , and
partial results obtained for . Two infinite families of universal patterns
are constructed. They give two analogues of Schur's triangularization theorem.Comment: 39 page
Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study
Widely used complex code refactoring tools lack a solid reasoning about the
correctness of the transformations they implement, whilst interest in proven
correct refactoring is ever increasing as only formal verification can provide
true confidence in applying tool-automated refactoring to industrial-scale
code. By using our strategic rewriting based refactoring specification
language, we present the decomposition of a complex transformation into smaller
steps that can be expressed as instances of refactoring schemes, then we
demonstrate the semi-automatic formal verification of the components based on a
theoretical understanding of the semantics of the programming language. The
extensible and verifiable refactoring definitions can be executed in our
interpreter built on top of a static analyser framework.Comment: In Proceedings VPT 2017, arXiv:1708.0688
Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem
We consider the well-known one dimensional cutting stock problem (1CSP).
Based on the pattern structure of the classical ILP formulation of Gilmore and
Gomory, we can decompose the infinite set of 1CSP instances, with a fixed
demand n, into a finite number of equivalence classes. We show up a strong
relation to weighted simple games. Studying the integer round-up property we
computationally show that all 1CSP instances with are proper IRUP,
while we give examples of a proper non-IRUP instances with . A gap larger
than 1 occurs for . The worst known gap is raised from 1.003 to 1.0625.
The used algorithmic approaches are based on exhaustive enumeration and integer
linear programming. Additionally we give some theoretical bounds showing that
all 1CSP instances with some specific parameters have the proper IRUP.Comment: 14 pages, 2 figures, 2 table
The LU-LC conjecture is false
The LU-LC conjecture is an important open problem concerning the structure of
entanglement of states described in the stabilizer formalism. It states that
two local unitary equivalent stabilizer states are also local Clifford
equivalent. If this conjecture were true, the local equivalence of stabilizer
states would be extremely easy to characterize. Unfortunately, however, based
on the recent progress made by Gross and Van den Nest, we find that the
conjecture is false.Comment: Added a new part explaining how the counterexamples are foun
- …