Right division in groups, dedekind-frobenius group matrices, and ward quasigroups

The variety of quasigroups satisfying the identity (xy)(zy) = xz mirrors the variety of groups, and offers a new look at groups and their multiplication tables. Such quasigroups are constructed from a group using right division instead of multiplication. Their multiplication tables consist of circulant blocks which have additional symmetries and have a concise presentation. These tables are a reincarnation of the group matrices which Frobenius used to give the first account of group representation theory. Our results imply that every group matrix may be written as a block circulant matrix and that this result leads to partial diagonalization of group matrices, which are present in modern applied mathematics. We also discuss right division in loops with the antiautomorphic inverse property.     

On the distance between non-isomorphic groups

A result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map between two groups is close to a homomorphism implies a tight lower bound on the distance between the multiplication tables of two non-isomorphic groups.     

Projective Character Degree Patterns of p-Groups for p Odd

In this article, we classify up to isomorphism the character tables of 2-generator p-groups of class two.     

Description of some classes of Leibniz algebras

In this paper we describe the isomorphism classes of finite-dimensional complex Leibniz algebras whose quotient algebra with respect to the ideal generated by squares is isomorphic to the direct sum of three-dimensional simple Lie algebra sl₂ and a three-dimensional solvable ideal. We choose a basis of the isomorphism classes’ representatives and give explicit multiplication tables.     

On the definition of word hyperbolic groups

Formal languages based on multiplication tables of finitely generated groups are investigated and used to give a linguistic characterization of word hyperbolic groups. Received: 19 October 2000 / in final version: 6 June 2001 / Published online: 1 February 2002     

Supplementary notes on medieval Islamic multiplication tables

The astronomical tables compiled by Muslim astronomers in the medieval period are based on the sexagesimal system, and to facilitate their computations these astronomers used multiplication tables displaying products expressed sexagesimally. In a recent publication these tables were described for the first time. The present paper points to the existence of more of these tables, as well as to tables displaying sexagesimal quotients and others for facilitating linear interpolation.     

Character tables of p-groups with derived subgroup of prime order I

Two character tables of finite groups are isomorphic if there exist a bijection for the irreducible characters and a bijection for the conjugacy classes that preserve all the character values. We give necessary and sufficient conditions for two finite groups to have isomorphic character tables. In the case of finite p-groups with derived subgroup of order p, we show that the character tables can be classified by equivalence classes of certain homomorphisms of abelian p-groups.     

Hecke algebras from groups acting on trees and HNN extensions

We study Hecke algebras of groups acting on trees with respect to geometrically defined subgroups. In particular, we consider Hecke algebras of groups of automorphisms of locally finite trees with respect to vertex and edge stabilizers and the stabilizer of an end relative to a vertex stabilizer, assuming that the actions are sufficiently transitive. We focus on identifying the structure of the resulting Hecke algebras, give explicit multiplication tables of the canonical generators and determine whether the Hecke algebra has a universal $C^1$-completion. The paper unifies algebraic and analytic approaches by focusing on the common geometric thread. The results have implications for the general theory of totally disconnected locally compact groups.     

Character tables of commutative hecke algebras associated with exceptional weyl groups

The purpose of this paper is to calculate all the character tables of Hecke algebras associated with exceptional Weyl groups and their maximal parabolic subgroups when they are commutative. In the case when Weyl groups are of classical type, they are already known in [D.1] and [D.2]. In §1, we discuss the structure of Hecke algebras and in §2, we calculate all the character tables of these commutative Hecke algebras associated with exceptional Weyl groups.     

Simple Bol Loops

In this article we investigate the Bol loops and connected with them groups. We prove an analog of the Doro's theorem for Moufang loops and find a criterion for simplicity of Bol loops. One of the main results obtained is the following: If the right multiplication group of a connected finite Bol loop S is a simple group, then S is a Moufang loop.     

Tensor product of C-injective modules

The purpose of this paper is to calculate all the character tables of Hecke algebras associated with finite Chevalley groups of exceptional type and their maximal parabolic subgroups when they are commutative. In the case when the groups are of classical type, the character values of Hecke algebras are expressed by using the q-Krawtchouk polynomials and the q-Hahn polynomials (See [10] and [15]). On the other hand, the character tables of commutative Hecke algebras associated with exceptional Weyl groups and their maximal parabolic subgroups are given in [12]. In §1, we discuss the structure of Hecke algebras and in §2, we calculate all the character tables of these commutative Hecke algebras associated with finite Chevalley groups of exceptional type. Although some of them are well known, we include them for completeness     

Improving and estimating the accuracy of Strassen's algorithm

Fast matrix multiplication algorithms of Strassen and Winograd are known to have weaker numerical accuracy than usual (inner product) multiplication. In this paper, we show that scaling usually improves accuracy when operands have elements of widely varying magnitude. We also propose estimators for numerical errors, based on samples of the result. All these estimators can be computed in operations. Experiments prove the effectiveness of the scaling idea and of the absolute error estimator. Received February 20, 1996/ Revised version received July 1, 1997     

有限域上最优正规基的乘法表

本文给出了有限域上最优正规基乘法表的一个计算方法,改进了孙琦的相应结果.在有限域上椭圆曲线密码体制的应用中,本文给出的算法是非常有效的.     

Billiards and Teichmüller curves on Hilbert modular surfaces

This paper exhibits an infinite collection of algebraic curves isometrically embedded in the moduli space of Riemann surfaces of genus two. These Teichmüller curves lie on Hilbert modular surfaces parameterizing Abelian varieties with real multiplication. Explicit examples, constructed from L-shaped polygons, give billiard tables with optimal dynamical properties.

     

On self-adjoint subloops of moufang loops

In this paper we give a combinatorial rule to compute the composition of two convolution products of endomorphisms of a free associative algebra and deduce the construction of a subalgebra of QB _n (the group algebra of Hyperoctahedral group) which contains the descent algebra X#?. We also deduce a proof of the multiplication rule in the algebra ∑QB _n- Finally, we generalize this construction to other wreath products of symmetric groups by abelian groups.     

Multiplication operators on Cesàro second order function spaces

Positivity - In this article, we investigate bounded, invertible and compact multiplication operators on the second order Cesàro function spaces.     

Forcing Linearity Numbers for Multiplication Modules

In this article, we prove that for any multiplication module M, the forcing linearity number of M, fln(M), belongs to {0,1,2}, and if M is finitely generated whose annihilator is contained in only finitely many maximal ideals, then fln(M) = 0. Also, the forcing linearity numbers of multiplication modules over some special rings are given. We also show that every multiplication module is semi-endomorphal.     

Cache-independent algorithms

The memory in modern computer systems has a highly complex hierarchy. The farther the memory from the processor, the larger it is, but also the slower. Each computer has its own architecture and its own cache memory, and it is not easy to write an algorithm that will run with equal efficiency on all computers. In this article we consider the simplest model of a two-level memory for which two cacheindependent algorithms are proposed: multiplication of full matrices and multiplication of a sparse matrix by a block vector.     

Developing the concept of linear function: one student’s experiences with dynamic physical models

Developing a view of functions as systematic processes involving co-variation among variables has been identified as a goal for mathematics learners at the pre-university level. In this investigation I examined the processes used by an eighth-grade student to interpret linear functions originating in dynamic physical models and the processed he used to link his interpretations to tables, equations, and graphs. The student deepened his understanding of functions by generalizing his view of multiplication beyond that of products resulting from the multiplication of individual factors or from repeated addition. He was enabled to do this by building links between graphic and tabular representations of the functions generated from his exploration with dynamic physical models and by comparing tables of different linear functions. This paper suggests that the development of a student’s reasoning about functions originating in dynamic physical models can be interpreted in terms of generalized multiplicative processes that may occur thorough mapping variations and that a student who interprets such functions as generalized multiplicative processes may use notational variations to generate representing equations.     

On the conjecture of Birch and Swinnerton-Dyer

In this paper we complete Rubin's partial verification of the conjecture for a large class of elliptic curves with complex multiplication by .