Related papers: Combinatoric of H-primes in quantum matrices

Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…

We study intertwining relations for matrix one-dimensional, in general, non-Hermitian Hamiltonians by matrix differential operators of arbitrary order. It is established that for any matrix intertwining operator Q_N^- of minimal order N…

We provide a simple and natural solution to the problem of generating all $2^n \cdot n!$ signed permutations of $[n] = \{1,2,\ldots,n\}$. Our solution provides a pleasing generalization of the most famous ordering of permutations: plain…

Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these objects had a natural involution which was carried equivariantly by the known bijections, and the…

We show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over…

Let $H$ be either a complex inner product space of dimension at least two, or a real inner product space of dimension at least three. Let us fix an $\alpha\in \left(0,\tfrac{\pi}{2}\right)$. The purpose of this paper is to characterize all…

Two elements $g$ and $h$ of a permutation group $G$ acting on a set $V$ are said to be intersecting if $g(v) = h(v)$ for some $v \in V$. More generally, a subset ${\cal F}$ of $G$ is an intersecting set if every pair of elements of ${\cal…

Bertrand's postulate establishes that for all positive integers $n>1$ there exists a prime number between $n$ and $2n$. We consider a generalization of this theorem as: for integers $n\geq k\geq 2$ is there a prime number between $kn$ and…

In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on $S_n$, giving rise to differing notions of up-sets. Our…

There are numerous combinatorial objects associated to a Grassmannian permutation $w_\lambda$ that index cells of the totally nonnegative Grassmannian. We study several of these objects and their $q$-analogues in the case of permutations…

In this paper, we represent $n$-qubits as hypermatrices and consider various applications to quantum entanglement. In particular, we use the higher-order singular value decomposition of hypermatrices to prove that the $\pi$-transpose is an…

A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…

Let X be a "nice" space with an action of a torus T. We consider the Atiyah-Bredon sequence of equivariant cohomology modules arising from the filtration of X by orbit dimension. We show that a front piece of this sequence is exact if and…

We consider the problem of finding a bijection between the sets of alternating sign matrices and of totally symmetric self complementary plane partitions, which can be reformulated using Gog and Magog triangles. In a previous work we…

In the conventional Schr\"{o}dinger's formulation of quantum mechanics the unitary evolution of a state $\psi$ is controlled, in Hilbert space ${\cal L}$, by a Hamiltonian $\mathfrak{h}$ which must be self-adjoint. In the recent,…

We present an equivariant bijection between two actions--promotion and rowmotion--on order ideals in certain posets. This bijection simultaneously generalizes a result of R. Stanley concerning promotion on the linear extensions of two…

The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem.…

Following the footprints of what have been done with the algorithm Stacksort, we investigate the preimages of the map associated with a slightly less well known algorithm, called Queuesort. After having described an equivalent version of…

The concept of quantum superposition is reconsidered and discussed from the viewpoint of Bohmian mechanics, the hydrodynamic formulation of quantum mechanics, in order to elucidate some physical consequences that go beyond the simple…

We study the set $\sncb (p,q)$ of annular non-crossing permutations of type B, and we introduce a corresponding set $\ncb (p,q)$ of annular non-crossing partitions of type B, where $p$ and $q$ are two positive integers. We prove that the…