相关论文: Thirty-six officers, artisanally entangled

The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

We introduce perfect tangles for modular tensor categories. These are intended to generalise the perfect tensors first introduced in the context of a toy model for the AdS/CFT correspondence. We construct perfect tangles for several…

A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. Such cuboids are not yet discovered and their non-existence is also not proved. Perfect Euler cuboids…

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

We study symmetric tensor decompositions, i.e. decompositions of the input symmetric tensor T of order 3 as sum of r 3rd-order tensor powers of u_i where u_i are vectors in \C^n. In order to obtain efficient decomposition algorithms, it is…

A perfect Euler cuboid is a rectangular parallelepiped with integer edges, with integer face diagonals, and with integer space diagonal as well. Finding such parallelepipeds or proving their non-existence is an old unsolved mathematical…

We prove, in ZFC, that there is an infinite strictly descending chain of classes of theories in Keisler's order. Thus Keisler's order is infinite and not a well order. Moreover, this chain occurs within the simple unstable theories,…

A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…

The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The third cuboid conjecture is the last of the three propositions suggested as intermediate stages in proving the…

A universal entangler (UE) is a unitary operation which maps all pure product states to entangled states. It is known that for a bipartite system of particles $1,2$ with a Hilbert space $\mathbb{C}^{d_1}\otimes\mathbb{C}^{d_2}$, a UE exists…

We consider bipartite exact entanglement embezzlement with a catalyst state vector $\psi$ in a Hilbert space $\mathcal{H}$ using unitaries (or more generally, contractions). If $\mathcal{M} \subseteq \mathcal{B}(\mathcal{H})$ is a von…

Octupolar tensors are third order, completely symmetric and traceless tensors. Whereas in 2D an octupolar tensor has the same symmetries as an equilateral triangle and can ultimately be identified with a vector in the plane, the symmetries…

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…

We study orthogonal decompositions of symmetric and ordinary tensors using methods from linear algebra. For the field of real numbers we show that the sets of decomposable tensors can be defined be equations of degree 2. This gives a new…

One of the most challenging problems in quantum physics is to quantify the entanglement of $d$-partite states and their separability. We show here that these problems are best addressed using tensors. The geometric measure of entanglement…

The main challenge with the tensor completion problem is a fundamental tension between computation power and the information-theoretic sample complexity rate. Past approaches either achieve the information-theoretic rate but lack practical…

The purpose of this article is to give a complete and general answer to the recurrent problem in continuum mechanics of the determination of the number and the type of symmetry classes of an even-order tensor space. This kind of…

We study the rank one completion problem for tensors of arbitrary orders. The notion of rank one determinable tensors is introduced. We explore its properties and propose a recursive algorithm for computing rank one tensor completion. This…

We obtain a correspondence between pairs of $N\times N$ orthogonal Latin squares and pairs of disconnected maximal cliques in the derangement graph with $N$ symbols. Motivated by methods in spectral clustering, we also obtain modular…