The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits classical information by sending only one qubit using a shared EPR pair. Our first result an arbitrary for achieving this task (where there are no assumptions on the sender’s encoding operations or dimension entangled state) locally equivalent canonical Bennett-Wiesner protocol....

We study rigidity of rational maps that come from Newton's root finding method for polynomials arbitrary degrees. establish dynamical these maps: each point in the Julia set a Newton map is either rigid (i.e. its orbit can be distinguished combinatorial terms all other orbits), or this eventually lands filled-in polynomial-like restriction original map. As corollary, we show sets many non-trivi...

The null curvature condition (NCC) is the requirement that Ricci of a Lorentzian manifold be nonnegative along directions, which ensures focusing geodesic congruences. In this note, we show NCC together with causal structure significantly constrain metric. particular, prove any conformal rescaling vacuum spacetime introduces either incompleteness or negative curvature, provided factor non-const...

Parkinsonian rigidity has been thought to be constant through a full range of joint angle. The aim of this study was to perform a detailed investigation of joint angle dependency of rigidity. We first measured muscle tone at the elbow joint in 20 healthy subjects and demonstrated that an angle of approximately 60° of flexion marks the division of two different angle-torque characteristics. Then...

Neuroleptic malignant syndrome (NMS) is a dangerous adverse response to antipsychotic drugs. It is characterized by the four major clinical symptoms of hyperthermia, severe muscle rigidity, autonomic dysfunction, and altered mental state. Serum creatine kinase (CK) elevation occurs in over 90% of NMS cases. In the present study, the detailed temporal changes in serum CK and degree of muscle rig...

The problem of combinatorially determining the rank of the 3-dimensional bar-joint rigidity matroid of a graph is an important open problem in combinatorial rigidity theory. Maxwell’s condition states that the edges of a graph G = (V,E) are independent in its d-dimensional generic rigidity matroid only if (a) the number of edges |E| ≤ d|V | − ( d+1 2 ) , and (b) this holds for every induced sub...