Ground state energy and mass gap of a generalised quantum spin ladder

We show that a 2-leg ladder hamiltonian introduced recently by Albeverio and Fei (cond-mat/9807341) can be made to satisfy the Hecke algebra. As a result we have found an equivalent representation of the eigenspectrum in terms of the spin-1/2 antiferromagnetic XXZ chain at $\Delta = - 5/3$. The values of thermodynamic quantities such as the ground state energy and mass gap follow from the known XXZ results.Comment: 8 pages, Late

Exactly solvable su(N) mixed spin ladders

It is shown that solvable mixed spin ladder models can be constructed from su(N) permutators. Heisenberg rung interactions appear as chemical potential terms in the Bethe Ansatz solution. Explicit examples given are a mixed spin-1/2 spin-1 ladder, a mixed spin-1/2 spin-3/2 ladder and a spin-1 ladder with biquadratic interactions.Comment: 7 pages, Latex, Presented at the Baxter Revolution in Mathematical Physics Conference, Feb 13-19, 200

Alien Registration- Currier, Annie M. (Madison, Somerset County)

https://digitalmaine.com/alien_docs/6701/thumbnail.jp

Exactly solvable quantum spin tubes and ladders

We find families of integrable n-leg spin-1/2 ladders and tubes with general isotropic exchange interactions between spins. These models are equivalent to su(N) spin chains with N=2^n. Arbitrary rung interactions in the spin tubes and ladders induce chemical potentials in the equivalent spin chains. The potentials are n-dependent and differ for the tube and ladder models. The models are solvable by means of nested Bethe Ansatz.Comment: 6 pages, Latex, 1 eps fig, to appear in J. Phys.

Parallel Fast Legendre Transform

We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were implemented in ANSI C using the BSPlib communications library Furthermore we present a new algorithm for computing the Chebyshev transform of two vectors at the same tim

Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection between the equivalence classes of ordinary irreducible representations of the generalized iterated wreath product and orbits of labels on certain rooted trees. We find a recursion for the number of these labels and the degrees of irreducible representations of the generalized iterated wreath product. Finally, we give rough upper bound estimates for fast Fourier transforms.Comment: 18 pages, to appear in Advances in the Mathematical Sciences. arXiv admin note: text overlap with arXiv:1409.060

Sampling Theorem and Discrete Fourier Transform on the Riemann Sphere

Using coherent-state techniques, we prove a sampling theorem for Majorana's (holomorphic) functions on the Riemann sphere and we provide an exact reconstruction formula as a convolution product of $N$ samples and a given reconstruction kernel (a sinc-type function). We also discuss the effect of over- and under-sampling. Sample points are roots of unity, a fact which allows explicit inversion formulas for resolution and overlapping kernel operators through the theory of Circulant Matrices and Rectangular Fourier Matrices. The case of band-limited functions on the Riemann sphere, with spins up to $J$, is also considered. The connection with the standard Euler angle picture, in terms of spherical harmonics, is established through a discrete Bargmann transform.Comment: 26 latex pages. Final version published in J. Fourier Anal. App

Generalized iterated wreath products of cyclic groups and rooted trees correspondence

Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a certain type of rooted trees. This provides a Bratteli diagram for the generalized iterated wreath product, a simple recursion formula for the number of irreducible representations, and a strategy to calculate the dimension of each irreducible representation. We calculate explicitly fast Fourier transforms (FFT) for this class of groups, giving literature's fastest FFT upper bound estimate.Comment: 15 pages, to appear in Advances in the Mathematical Science

Molecular basis of APC/C regulation by the spindle assembly checkpoint.

In the dividing eukaryotic cell, the spindle assembly checkpoint (SAC) ensures that each daughter cell inherits an identical set of chromosomes. The SAC coordinates the correct attachment of sister chromatid kinetochores to the mitotic spindle with activation of the anaphase-promoting complex (APC/C), the E3 ubiquitin ligase responsible for initiating chromosome separation. In response to unattached kinetochores, the SAC generates the mitotic checkpoint complex (MCC), which inhibits the APC/C and delays chromosome segregation. By cryo-electron microscopy, here we determine the near-atomic resolution structure of a human APC/C–MCC complex (APC/C(MCC)). Degron-like sequences of the MCC subunit BubR1 block degron recognition sites on Cdc20, the APC/C coactivator subunit responsible for substrate interactions. BubR1 also obstructs binding of the initiating E2 enzyme UbcH10 to repress APC/C ubiquitination activity. Conformational variability of the complex enables UbcH10 association, and structural analysis shows how the Cdc20 subunit intrinsic to the MCC (Cdc20(MCC)) is ubiquitinated, a process that results in APC/C reactivation when the SAC is silenced