Related papers: Transformation brackets between U(n+1) -> U(n) -> …
We calculate the deconfining temperature of SO(N) gauge theories in 2+1 dimensions, and determine the order of the phase transition as a function of N, for various values of N in the range [4,16]. We do so by extrapolating our lattice…
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…
Systems of nonlinear ordinary differential equations are constructed, for which the general solution is algebraically expressed in terms of a finite number of particular solutions. Expressions of that type are called the nonlinear…
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…
We perform an exploratory investigation of how rapidly the physics of SO(2N) gauge theories approaches its N=oo limit. This question has recently become topical because SO(2N) gauge theories are orbifold equivalent to SU(N) gauge theories,…
Consider the example of the relationship of the group O(3) of rotations in 3-space to the special unitary group SU(2). Given other unitary groups, what transformations can we find? In this paper we describe a method of constructing…
We study the decomposition as an $\textrm{SO}(3)$-module of the multiplicity space corresponding to the branching from $\textrm{SO}(n+3)$ to $\textrm{SO}(n)$. Here, $\textrm{SO}(n)$ (resp.\ $\textrm{SO}(3)$) is considered embedded in…
We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…
In this note we give a presentation for the monoid $IO_n$ of all order-preserving transformations of a $n$-chain whose ranges are intervals. We also consider the submonoid $IO_n^-$ of $IO_n$ consisting of order-decreasing transformations,…
Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at…
A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…
In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the…
An explicit and simple correspondence, between the basis of the model space of $SU(3)$ on one hand and that of $SU(2)\otimes SU(2)$ or $SO(1,3)$ on the other, is exhibited for the first time. This is done by considering the generating…
We present our current results for the deconfining temperatures in SO(N) gauge theories in 2+1 dimensions. SO(2N) theories may help us to understand QCD at finite chemical potential since there is a large-N orbifold equivalence between…
Partitions of [n]={1,2,...,n} into sets of lists are counted by sequence number A000262 in the On-Line Encyclopedia of Integer Sequences. They are somewhat less numerous than partitions of [n] into lists of sets, A000670. Here we observe…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
A universally L^1 good sequence n_k is constructed with n_{k+1}-n_k tending to infinity. For ergodic transformations non-conventional ergodic averages of L^1 functions computed by using this sequence converge to the integral of the…
In this paper we explore the structure of certain generalized isometries of the special orthogonal group $SO(n)$ which are transformations that leave any member of a large class of generalized distance measures invariant. This gives us a…
Principal axis transformation is performed for a Lagrangian with a U(1)-SU(2) mixing term, that can cause a SU(2) deconfining transition.
A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this paper, we use natural encodings of these objects to show the existence of u-cycles for collections of subsets, matroids, restricted…