On the unreasonable effectiveness of Gutzmer's formula

In this article we plan to demonstrate the usefulness of `Gutzmer's formula' in the study of various problems related to the Segal-Bargmann transform. Gutzmer's formula is known in several contexts: compact Lie groups, symmetric spaces of compact and noncompact type, Heisenberg groups and Hermite expansions. We apply Gutzmer's formula to study holomorphic Sobolev spaces, local Peter-Weyl theorems, Paley-Wiener theorems and Poisson semigroups.

Ideal Structure of the Silver Code

The Silver code has captured a lot of attention in the recent past,because of its nice structure and fast decodability. In their recent paper, Hollanti et al. show that the Silver code forms a subset of the natural order of a particular cyclic division algebra (CDA). In this paper, the algebraic structure of this subset is characterized. It is shown that the Silver code is not an ideal in the natural order but a right ideal generated by two elements in a particular order of this CDA. The exact minimum determinant of the normalized Silver code is computed using the ideal structure of the code. The construction of Silver code is then extended to CDAs over other number fields.

A note on the Berry phase for systems having one degree of freedom

A one-dimensional arbitrary system with quantum Hamiltonian H(q, p) is shown to acquire the 'geometric' phase gamma (C)=(1/2) contour integral c(Podqo-qodpo) under adiabatic transport q to q+q+qo(t) and p to p+po(t) along a closed circuit C in the parameter space (qo(t), po(t)). The non-vanishing nature of this phase, despite only one degree of freedom (q), is due ultimately to the underlying non-Abelian Weyl group. A physical realisation in which this Berry phase results in a line spread is briefly discussed.

On The Ground State Properties Of The +/-J Ising Model

In the combinatorial method or Grassmann algebra formalism the ground state properties of the f J Ising model can be expressed in terms of the behaviour of the eigenvectors of a matrix. It is shown that a transition from localized to extended eigenvectors signals the breakdown of ferromagnetic rigidity.

Poincaré invariance of anomalous gauge theories

We establish the Poincaré invariance of anomalous gauge theories in two dimensions, for both the Abelian and non-Abelian cases, in the canonical Hamiltonian formalism. It is shown that, despite the noncovariant appearance of the constraints of these theories, Poincaré generators can be constructed which obey the correct algebra and yield the correct transformations in the constrained space.

Superconformal transformations of theN=4 supersymmetric Yang-Mills theory

We obtain the superconformal transformation laws of theN=4 supersymmetric Yang-Mills theory and explicitly demonstrate the closure of the algebra.

Effects of Parasitics and Interface Traps on Ballistic Nanowire FET in the Ultimate Quantum Capacitance Limit

In this paper, we focus on the performance of a nanowire field-effect transistor in the ultimate quantum capacitance limit (UQCL) (where only one subband is occupied) in the presence of interface traps (D-it), parasitic capacitance (C-L), and source/drain series resistance (R-s,R-d), using a ballistic transport model and compare the performance with its classical capacitance limit (CCL) counterpart. We discuss four different aspects relevant to the present scenario, namely: 1) gate capacitance; 2) drain-current saturation; 3) subthreshold slope; and 4) scaling performance. To gain physical insights into these effects, we also develop a set of semianalytical equations. The key observations are as follows: 1) A strongly energy-quantized nanowire shows nonmonotonic multiple-peak C-V characteristics due to discrete contributions from individual subbands; 2) the ballistic drain current saturates better in the UQCL than in the CCL, both in the presence and absence of D-it and R-s,R-d; 3) the subthreshold slope does not suffer any relative degradation in the UQCL compared to the CCL, even with Dit and R-s,R-d; 4) the UQCL scaling outperforms the CCL in the ideal condition; and 5) the UQCL scaling is more immune to R-s,R-d, but the presence of D-it and C-L significantly degrades the scaling advantages in the UQCL.

Descriptions of operators in quantum mechanics

The problem of expressing a general dynamical variable in quantum mechanics as a function of a primitive set of operators is studied from several points of view. In the context of the Heisenberg commutation relation, the Weyl representation for operators and a new Fourier-Mellin representation are related to the Heisenberg group and the groupSL(2,R) respectively. The description of unitary transformations via generating functions is analysed in detail. The relation between functions and ordered functions of noncommuting operators is discussed, and results closely paralleling classical results are obtained.

Wigner distribution for angle coordinates in quantum mechanics

The method of Wigner distribution functions, and the Weyl correspondence between quantum and classical variables, are extended from the usual kind of canonically conjugate position and momentum operators to the case of an angle and angular momentum operator pair. The sense in which one has a description of quantum mechanics using classical phase‐space language is much clarified by this extension.

A functional style of programming with CSP-like communication mechanisms

This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.

An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models

In this paper we study representation of KL-divergence minimization, in the cases where integer sufficient statistics exists, using tools from polynomial algebra. We show that the estimation of parametric statistical models in this case can be transformed to solving a system of polynomial equations. In particular, we also study the case of Kullback-Csiszar iteration scheme. We present implicit descriptions of these models and show that implicitization preserves specialization of prior distribution. This result leads us to a Grobner bases method to compute an implicit representation of minimum KL-divergence models.

New results on systems with second-class constraints

We show how, for large classes of systems with purely second-class constraints, further information can be obtained about the constraint algebra. In particular, a subset consisting of half the full set of constraints is shown to have vanishing mutual brackets. Some other constraint brackets are also shown to be zero. The class of systems for which our results hold includes examples from non-relativistic particle mechanics as well as relativistic field theory. The results are derived at the classical level for Poisson brackets, but in the absence of commutator anomalies the same results will hold for the commutators of the constraint operators in the corresponding quantised theories.

Accelerating frequency-domain diffuse optical tomographic image reconstruction using graphics processing units

Diffuse optical tomographic image reconstruction uses advanced numerical models that are computationally costly to be implemented in the real time. The graphics processing units (GPUs) offer desktop massive parallelization that can accelerate these computations. An open-source GPU-accelerated linear algebra library package is used to compute the most intensive matrix-matrix calculations and matrix decompositions that are used in solving the system of linear equations. These open-source functions were integrated into the existing frequency-domain diffuse optical image reconstruction algorithms to evaluate the acceleration capability of the GPUs (NVIDIA Tesla C 1060) with increasing reconstruction problem sizes. These studies indicate that single precision computations are sufficient for diffuse optical tomographic image reconstruction. The acceleration per iteration can be up to 40, using GPUs compared to traditional CPUs in case of three-dimensional reconstruction, where the reconstruction problem is more underdetermined, making the GPUs more attractive in the clinical settings. The current limitation of these GPUs in the available onboard memory (4 GB) that restricts the reconstruction of a large set of optical parameters, more than 13, 377. (C) 2010 Society of Photo-Optical Instrumentation Engineers. DOI: 10.1117/1.3506216]

Affine Hall-Littlewood Functions for A(1)((1)) And Some Constant Term Identities of Cherednik-Macdonald-Mehta Type

We study t-analogs of string functions for integrable highest weight representations of the affine Kac-Moody algebra A(1)((1)). We obtain closed form formulas for certain t-string functions of levels 2 and 4. As corollaries, we obtain explicit identities for the corresponding affine Hall-Littlewood functions, as well as higher level generalizations of Cherednik's Macdonald and Macdonald-Mehta constant term identities.

On Computation of Minimum Distance of Linear Block Codes Above 1/2 Rate Coding

The minimum distance of linear block codes is one of the important parameter that indicates the error performance of the code. When the code rate is less than 1/2, efficient algorithms are available for finding minimum distance using the concept of information sets. When the code rate is greater than 1/2, only one information set is available and efficiency suffers. In this paper, we investigate and propose a novel algorithm to find the minimum distance of linear block codes with the code rate greater than 1/2. We propose to reverse the roles of information set and parity set to get virtually another information set to improve the efficiency. This method is 67.7 times faster than the minimum distance algorithm implemented in MAGMA Computational Algebra System for a (80, 45) linear block code.