3,509,714 research outputs found
Polarization Elements-A Group Theoretical Study
The Classification of Polarization elements, the polarization affecting
optical devices which have a Jones matrix representation, according to the
types of eigenvectors they possess, is given a new visit through the
Group-theoretical connection of polarization elements. The diattenuators and
retarders are recognized as the elements corresponding to boosts and rotations
respectively. The structure of homogeneous elements other than diattenuators
and retarders are identified by giving the quaternion corresponding to these
elements. The set of degenerate polarization elements is identified with the so
called `null' elements of the Lorentz Group. Singular polarization elements are
examined in their more illustrative Mueller matrix representation and finally
the eigenstructure of a special class of singular Mueller matrices is studied.Comment: 7 pages, 2 tables, submitted to `Optics Communications
Elements of the Continuous Renormalization Group
These two lectures cover some of the advances that underpin recent progress
in deriving continuum solutions from the exact renormalization group. We
concentrate on concepts and on exact non-perturbative statements, but in the
process will describe how real non-perturbative calculations can be done,
particularly within derivative expansion approximations. An effort has been
made to keep the lectures pedagogical and self-contained. Topics covered are
the derivation of the flow equations, their equivalence, continuum limits,
perturbation theory, truncations, derivative expansions, identification of
fixed points and eigenoperators, and the role of reparametrization invariance.
Some new material is included, in particular a demonstration of
non-perturbative renormalizability, and a discussion of ultraviolet
renormalons.Comment: Invited lectures at the Yukawa International Seminar '97. 20 pages
including 6 eps figs. LaTeX. PTPTeX style files include
Computing simplicial representatives of homotopy group elements
A central problem of algebraic topology is to understand the homotopy groups
of a topological space . For the computational version of the
problem, it is well known that there is no algorithm to decide whether the
fundamental group of a given finite simplicial complex is
trivial. On the other hand, there are several algorithms that, given a finite
simplicial complex that is simply connected (i.e., with
trivial), compute the higher homotopy group for any given .
%The first such algorithm was given by Brown, and more recently, \v{C}adek et
al.
However, these algorithms come with a caveat: They compute the isomorphism
type of , as an \emph{abstract} finitely generated abelian
group given by generators and relations, but they work with very implicit
representations of the elements of . Converting elements of this
abstract group into explicit geometric maps from the -dimensional sphere
to has been one of the main unsolved problems in the emerging field
of computational homotopy theory.
Here we present an algorithm that, given a~simply connected space ,
computes and represents its elements as simplicial maps from a
suitable triangulation of the -sphere to . For fixed , the
algorithm runs in time exponential in , the number of simplices of
. Moreover, we prove that this is optimal: For every fixed , we
construct a family of simply connected spaces such that for any simplicial
map representing a generator of , the size of the triangulation of
on which the map is defined, is exponential in
Group ring elements with large spectral density
Given an arbitrary d>0 we construct a group G and a group ring element S in
Z[G] such that the spectral measure mu of S has the property that mu((0,eps)) >
C/|log(eps)|^(1+d) for small eps. In particular the Novikov-Shubin invariant of
any such S is 0. The constructed examples show that the best known upper bounds
on mu((0,eps)) are not far from being optimal.Comment: 19 pages, v3: Changes suggested by a referee; Essentially this is the
version published in Math. An
- …