相关论文: Forbidden lines are not quenched
Bound entanglement is the noisy entanglement which cannot be distilled to a singlet form. Thus it cannot be used alone for quantum communication purposes. Here we show that, nevertheless, the bound entanglement can be, in a sense, pumped…
We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.…
A subset of a Banach space is called equilateral if the distances between any two of its distinct elements are the same. It is proved that there exist non-separable Banach spaces (in fact of density continuum) with no infinite equilateral…
We prove the sharp bound of at most 64 lines on complex projective quartic surfaces (resp. affine quartics) that are not ruled by lines. We study configurations of lines on certain non-K3 surfaces of degree four and give various examples of…
It is shown that Smolin four-qubit bound entangled states [Phys. Rev. A, 63 032306 (2001)] can maximally violate two-setting Bell inequality similar to standard CHSH inequality. Surprisingly this entanglement does not allow for secure key…
Sequences diverge either because they head off to infinity or because they oscillate. Part 1 constructs a non-Archimedean framework of infinite numbers that is large enough to contain asymptotic limit points for non-oscillating sequences…
Some interesting consequences of spacelike matter shells are presented, in particular the possibility of travelling through Cauchy horizons and violating the strong cosmic censorship principle. These show that the weak energy condition does…
We prove a result on the existence of linear forms of a given Diophantine type.
In this paper, we study the problem of finding the largest possible set of s points and s lines in a projective plane of order q, such that that none of the s points lie on any of the s lines. We prove that s <= 1+(q+1)(\sqrt{q}-1). We also…
In his Comment on our recent paper ``The laws of physics do not prohibit counterfactual communication'', \textit{npj Quantum Information} (2022) 8:60, Popescu argues that the claims of the paper are invalid. Here, we refute his argument,…
We formulate quenched chiral perturbation theory for heavy-light mesons coupled to pions, and calculate the one-loop chiral logarithmic corrections to $f_B$, $f_{B_{s}}$, $B_B$ and $B_{B_{s}}$. We also calculate these corrections for…
We give a (consistent) example of a first-countable continuum that is not a remainder of the real line.
We study theoretically two coupled periodically-curved optical waveguides with Kerr nonlinearity. We find that the tunneling between the waveguides can be suppressed in a wide range of parameters due to nonlinearity. Such suppression of…
We consider a model for a polymer interacting with an attractive wall through a random sequence of charges. We focus on the so-called diluted limit, when the charges are very rare but have strong intensity. In this regime, we determine the…
We prove that a distance-regular graph with intersection array {56,36,9;1,3,48} does not exist. This intersection array is from the table of feasible parameters for distance-regular graphs in "Distance-regular graphs"\ by A.E. Brouwer, A.M.…
A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.
We show that there is a point on a computable arc that does not belong to any computable rectifiable curve. We also show that there is a point on a computable rectifiable curve with computable length that does not belong to any computable…
We present an analytical derivation of the winding number counting topological defects created by an O(N) symmetry-breaking quantum quench in N spatial dimensions. Our approach is universal in the sense that we do not employ any…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
In this note, we disprove two Romanov type conjectures posed by Chen.