Quantum Group Covariance and the Braided Structure of Deformed Oscillators

The connection between braided Hopf algebra structure and the quantum group covariance of deformed oscillators is constructed explicitly. In this context we provide deformations of the Hopf algebra of functions on SU(1,1). Quantum subgroups and their representations are also discussed.Comment: 12 pages, to be published in JM

Symmetry Breaking in the Schr\"odinger Representation for Chern-Simons Theories

This paper discusses the phenomenon of spontaneous symmetry breaking in the Schr\"odinger representation formulation of quantum field theory. The analysis is presented for three-dimensional space-time abelian gauge theories with either Maxwell, Maxwell-Chern-Simons, or pure Chern-Simons terms as the gauge field contribution to the action, each of which leads to a different form of mass generation for the gauge fields.Comment: 16pp, LaTeX , UCONN-94-

Braided Oscillators

The braided Hopf algebra structure of the generalized oscillator is investigated. Using the solutions two types of braided Fibonacci oscillators are introduced. This leads to two types of braided Biedenharn-Macfarlane oscillators.Comment: 12 pages, latex, some references added, published versio

Coordinate noncommutativity in strong non-uniform magnetic fields

Noncommuting spatial coordinates are studied in the context of a charged particle moving in a strong non-uniform magnetic field. We derive a relation involving the commutators of the coordinates, which generalizes the one realized in a strong constant magnetic field. As an application, we discuss the noncommutativity in the magnetic field present in a magnetic mirror.Comment: 4 page

Numerical Investigation of Monopole Chains

We present numerical results for chains of SU(2) BPS monopoles constructed from Nahm data. The long chain limit reveals an asymmetric behavior transverse to the periodic direction, with the asymmetry becoming more pronounced at shorter separations. This analysis is motivated by a search for semiclassical finite temperature instantons in the 3D SU(2) Georgi-Glashow model, but it appears that in the periodic limit the instanton chains either have logarithmically divergent action or wash themselves out.Comment: 14 pages, 6 figures; v2 minor changes, published versio

Geometrical foundations of fractional supersymmetry

A deformed $q$-calculus is developed on the basis of an algebraic structure involving graded brackets. A number operator and left and right shift operators are constructed for this algebra, and the whole structure is related to the algebra of a $q$-deformed boson. The limit of this algebra when $q$ is a $n$-th root of unity is also studied in detail. By means of a chain rule expansion, the left and right derivatives are identified with the charge $Q$ and covariant derivative $D$ encountered in ordinary/fractional supersymmetry and this leads to new results for these operators. A generalized Berezin integral and fractional superspace measure arise as a natural part of our formalism. When $q$ is a root of unity the algebra is found to have a non-trivial Hopf structure, extending that associated with the anyonic line. One-dimensional ordinary/fractional superspace is identified with the braided line when $q$ is a root of unity, so that one-dimensional ordinary/fractional supersymmetry can be viewed as invariance under translation along this line. In our construction of fractional supersymmetry the $q$-deformed bosons play a role exactly analogous to that of the fermions in the familiar supersymmetric case.Comment: 42 pages, LaTeX. To appear in Int. J. Mod. Phys.

The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation

We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation framework F and a small positive integer k are given. - The Repair problem asks whether a given set of arguments can be modified into an extension by at most k elementary changes (i.e., the extension is of distance k from the given set). - The Adjust problem asks whether a given extension can be modified by at most k elementary changes into an extension that contains a specified argument. - The Center problem asks whether, given two extensions of distance k, whether there is a "center" extension that is a distance at most (k-1) from both given extensions. We study these problems in the framework of parameterized complexity, and take the distance k as the parameter. Our results covers several different semantics, including admissible, complete, preferred, semi-stable and stable semantics