Spectral synthesis and topologies on ideal spaces for Banach *-algebras

This paper continues the study of spectral synthesis and the topologies τ∞ and τr on the ideal space of a Banach algebra, concentrating on the class of Banach *-algebras, and in particular on L1-group algebras. It is shown that if a group G is a finite extension of an abelian group then τr is Hausdorff on the ideal space of L1(G) if and only if L1(G) has spectral synthesis, which in turn is equivalent to G being compact. The result is applied to nilpotent groups, [FD]−-groups, and Moore groups. An example is given of a non-compact, non-abelian group G for which L1(G) has spectral synthesis. It is also shown that if G is a non-discrete group then τr is not Hausdorff on the ideal lattice of the Fourier algebra A(G).

Simple components of the center of FG/J(FG)

Let G be a finite group, F a field, FG the group ring of G over F, and J(FG) the Jacobson radical of FG. Using a result of Berman and Witt, we give a method to determine the structure of the center of FG/J(FG), provided that F satisfies a field theoretical condition.

A SURVEY ON FREE OBJECTS IN DIVISION RINGS AND IN DIVISION RINGS WITH AN INVOLUTION

Let D be a division ring with center k, and let D-dagger be its multiplicative group. We investigate the existence of free groups in D-dagger, and free algebras and free group algebras in D. We also go through the case when D has an involution * and consider the existence of free symmetric and unitary pairs in D-dagger.

Generalized cluster states based on finite groups

We define generalized cluster states based on finite group algebras in analogy to the generalization of the toric code to the Kitaev quantum double models. We do this by showing a general correspondence between systems with CSS structure and finite group algebras, and applying this to the cluster states to derive their generalization. We then investigate properties of these states including their projected entangled pair state representations, global symmetries, and relationship to the Kitaev quantum double models. We also discuss possible applications of these states.

Crossed products by twisted partial actions and graded algebras

For a twisted partial action e of a group G on an (associative non-necessarily unital) algebra A over a commutative unital ring k, the crossed product A x(Theta) G is proved to be associative. Given a G-graded k-algebra B = circle plus(g is an element of G) B-g with the mild restriction of homogeneous non-degeneracy, a criteria is established for B to be isomorphic to the crossed product B-1 x(Theta) G for some twisted partial action of G on B-1. The equality BgBg-1 B-g = B-g (for all g is an element of G) is one of the ingredients of the criteria, and if it holds and, moreover, B has enough local units, then it is shown that B is stably isomorphic to a crossed product by a twisted partial action of G. (c) 2008 Elsevier Inc. All rights reserved.

An isomorphism between group C*-algebras of ax + b-like groups

We give a necessary and sufficient condition for two ax+b-like groups to have isomorphic C*-algebras. In particular, we show that there are many non-isomorphic ax+b -like Lie groups having isomorphic group C*-algebras.

TWISTED CONJUGACY CLASSES IN R. THOMPSON`S GROUP F

In this article, we prove that any automorphism of R. Thompson`s group F has infinitely many twisted conjugacy classes. The result follows from the work of Brin, together with standard facts about R. Thompson`s group F, and elementary properties of the Reidemeister numbers.

POLYNOMIAL AND GROUP IDENTITIES IN ALTERNATIVE LOOP ALGEBRAS

We investigate polynomial identities on an alternative loop algebra and group identities on its (Moufang) unit loop. An alternative loop ring always satisfies a polynomial identity, whereas whether or not a unit loop satisfies a group identity depends on factors such as characteristic and centrality of certain kinds of idempotents.

ON THE CONSISTENCY OF TWISTED GENERALIZED WEYL ALGEBRAS

A twisted generalized Weyl algebra A of degree n depends on a. base algebra R, n commuting automorphisms sigma(i) of R, n central elements t(i) of R and on some additional scalar parameters. In a paper by Mazorchuk and Turowska, it is claimed that certain consistency conditions for sigma(i) and t(i) are sufficient for the algebra to be nontrivial. However, in this paper we give all example which shows that this is false. We also correct the statement by finding a new set of consistency conditions and prove that the old and new conditions together are necessary and sufficient for the base algebra R to map injectively into A. In particular they are sufficient for the algebra A to be nontrivial. We speculate that these consistency relations may play a role in other areas of mathematics, analogous to the role played by the Yang-Baxter equation in the theory of integrable systems.

Norms of inner derivations for multiplier algebras of C ∗ -algebras and group C ∗ -algebras, II

Peer reviewed

Norms of inner derivations for multiplier algebras of C ∗ -algebras and group C ∗ -algebras, II

Peer reviewed

Twisted Edwards curves revisited

This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a wide range of applications. Notably, the new addition algorithm uses for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature use . It is also shown that the new addition algorithm can be implemented with four processors dropping the effective cost to . This implies an effective speed increase by the full factor of 4 over the sequential case. Our results allow faster implementation of elliptic curve scalar multiplication. In addition, the new point addition algorithm can be used to provide a natural protection from side channel attacks based on simple power analysis (SPA).

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.

Lie group symmetry analysis for granular media stress equations

The Airy stress function, although frequently employed in classical linear elasticity, does not receive similar usage for granular media problems. For plane strain quasi-static deformations of a cohesionless Coulomb–Mohr granular solid, a single nonlinear partial differential equation is formulated for the Airy stress function by combining the equilibrium equations with the yield condition. This has certain advantages from the usual approach, in which two stress invariants and a stress angle are introduced, and a system of two partial differential equations is needed to describe the flow. In the present study, the symmetry analysis of differential equations is utilised for our single partial differential equation, and by computing an optimal system of one-dimensional Lie algebras, a complete set of group-invariant solutions is derived. By this it is meant that any group-invariant solution of the governing partial differential equation (provided it can be derived via the classical symmetries method) may be obtained as a member of this set by a suitable group transformation. For general values of the parameters (angle of internal friction and gravity g) it is found there are three distinct classes of solutions which correspond to granular flows considered previously in the literature. For the two limiting cases of high angle of internal friction and zero gravity, the governing partial differential equation admit larger families of Lie point symmetries, and from these symmetries, further solutions are derived, many of which are new. Furthermore, the majority of these solutions are exact, which is rare for granular flow, especially in the case of gravity driven flows.

Multigroup-Decodable STBCs from Clifford Algebras

A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt=2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a2(a−1), which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of (2a−2)-group decodable with rate (a−1)2(a−2), i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.