Modular arithmetic before C.F. Gauss: Systematizations and discussions on remainder problems in 18th-century Germany

Remainder problems have a long tradition and were widely disseminated in books on calculation, algebra, and recreational mathematics from the 13th century until the 18th century. Many singular solution methods for particular cases were known, but Bachet de Méziriac was the first to see how these methods connected with the Euclidean algorithm and with Diophantine analysis (1624). His general solution method contributed to the theory of equations in France, but went largely unnoticed elsewhere. Later Euler independently rediscovered similar methods, while von Clausberg generalized and systematized methods that used the greatest common divisor procedure. These were followed by Euler's and Lagrange's continued fraction solution methods and Hindenburg's combinatorial solution. Shortly afterwards, Gauss, in the Disquisitiones Arithmeticae, proposed a new formalism based on his method of congruences and created the modular arithmetic framework in which these problems are posed today.     

Practicing algebra in late antiquity: The problem-solving of Diophantus of Alexandria

Medieval algebra is distinguished from other arithmetical problem-solving techniques by its structure and technical vocabulary. In an algebraic solution one or several unknowns are named, and via operations on the unknowns the problem is transferred to the artificial setting of an equation expressed in terms of the named powers, which is then simplified and solved. In this article we examine Diophantus? Arithmetica from this perspective. We find that indeed Diophantus? method matches medieval algebra in both vocabulary and structure. Just as we see in medieval Arabic and Italian algebra, Diophantus worked out the operations expressed in the enunciation of a problem prior to setting up a polynomial equation. Further, his polynomials were regarded as aggregations with no operations present.     

Classification of the finite dimensional absolute valued algebras having a non-zero central idempotent or a one-sided unity

An absolute valued algebra is a non-zero real algebra that is equipped with a multiplicative norm. We classify all finite dimensional absolute valued algebras having a non-zero central idempotent or a one-sided unity, up to algebra isomorphism. This completes earlier results of Ramírez Álvarez and Rochdi which, in our self-contained presentation, are recovered from the wider context of composition k-algebras with an LR-bijective idempotent.     

On visualization scaling, subeigenvectors and Kleene stars in max algebra

The purpose of this paper is to investigate the interplay arising between max algebra, convexity and scaling problems. The latter, which have been studied in nonnegative matrix theory, are strongly related to max algebra. One problem is that of strict visualization scaling, defined as, for a given nonnegative matrix A, a diagonal matrix X such that all elements of X^-1AX are less than or equal to the maximum cycle geometric mean of A, with strict inequality for the entries which do not lie on critical cycles. In this paper such scalings are described by means of the max algebraic subeigenvectors and Kleene stars of nonnegative matrices as well as by some concepts of convex geometry.     

The banach algebra A and its properties

Beurling’s algebra is considered. A* arises quite naturally in problems of summability of the Fourier series at Lebesgue points, whereas Wiener’s algebra A of functions with absolutely convergent Fourier series arises when studying the norm convergence of linear means. Certainly, both algebras are used in some other areas. A* has many properties similar to those of A, but there are certain essential distinctions. A* is a regular Banach algebra, its space of maximal ideals coincides with[−π, π], and its dual space is indicated. Analogs of Herz’s and Wiener-Ditkin’s theorems hold. Quantitative parameters in an analog of the Beurling-Pollard theorem differ from those for A. Several inclusion results comparing the algebra A* with certain Banach spaces of smooth functions are given. Some special properties of the analogous space for Fourier transforms on the real axis are presented. The paper ends with a summary of some open problems.     

The hopf algebra of linearly recursive sequences

We explain how the space of linearly recursive sequences over a field can be considered as a Hopf algebra. The algebra structure is that of divided-power sequences, so we concentrate on the perhaps lesser-known coalgebra (diagonalization) structure. Such a sequence satisfies a minimal recursive relation, whose solution space is the subcoalgebra generated by the sequence. We discuss possible bases for the solution space from the point of view of diagonalization. In particular, we give an algorithm for diagonalizing a sequence in terms of the basis of the coalgebra it generates formed by its images under the difference-operator shift. The computation involves inverting the Hankel matrix of the sequence. We stress the classical connection (say over the real or complex numbers) with formal power series and the theory of linear homogeneous ordinary differential equations. It is hoped that this exposition will encourage the use of Hopf algebraic ideas in the study of certain combinatorial areas of mathematics.     

Simplifying equations in Arabic algebra

Historians have always seen jabr (restoration) and muqābala (confrontation) as technical terms for specific operations in Arabic algebra. This assumption clashes with the fact that the words were used in a variety of contexts. By examining the different uses of jabr, muqābala, ikmāl (completion), and radd (returning) in the worked-out problems of several medieval mathematics texts, we show that they are really nontechnical words used to name the immediate goals of particular steps. We also find that the phrase al-jabr wa'l-muqābala was first used within the solutions of problems to mean al-jabr and/or al-muqābala, and from there it became the name of the art of algebra.     

Binary homomorphisms and natural dualities

We investigate ways in which certain binary homomorphisms of a finite algebra can guarantee its dualisability. Of particular interest are those binary homomorphisms which are lattice, flat-semilattice or group operations. We prove that a finite algebra which has a pair of lattice operations amongst its binary homomorphisms is dualisable. As an application of this result, we find that every finite unary algebra can be embedded into a dualisable algebra. We develop some general tools which we use to prove the dualisability of a large number of unary algebras. For example, we show that the endomorphisms of a finite cyclic group are the operations of a dualisable unary algebra.     

关于数学分析在线性代数中某些应用的数学札记

线性代数中有不少难度较高的问题,若从代数学内部系统出发处理起来,相当繁冗.但是若从另一角度出发,运用数学分析的方法去处理这些代数问题,可能有着事半功倍之效.为此,本文运用数学分析的有关知识和方法论证线性代数中的某些问题.供大家在教学时参考,不妥之处,敬请斧正.     

Extended Grassmann and Clifford Algebras

This paper is intended to investigate Grassmann and Clifford algebras over Peano spaces, introducing their respective associated extended algebras, and to explore these concepts also from the counterspace viewpoint. The presented formalism explains how the concept of chirality stems from the bracket, as defined by Rota et all [1]. The exterior (regressive) algebra is shown to share the exterior (progressive) algebra in the direct sum of chiral and achiral subspaces. The duality between scalars and volume elements, respectively under the progressive and the regressive products is shown to have chirality, in the case when the dimension n of the Peano space is even. In other words, the counterspace volume element is shown to be a scalar or a pseudoscalar, depending on the dimension of the vector space to be respectively odd or even. The de Rham cochain associated with the differential operator is constituted by a sequence of exterior algebra homogeneous subspaces subsequently chiral and achiral. Thus we prove that the exterior algebra over the space and the exterior algebra constructed on the counterspace are only pseudoduals each other, if we introduce chirality. The extended Clifford algebra is introduced in the light of the periodicity theorem of Clifford algebras context, wherein the Clifford and extended Clifford algebras can be embedded in which is shown to be exactly the extended Clifford algebra. We present the essential character of the Rota’s bracket, relating it to the formalism exposed by Conradt [25], introducing the regressive product and subsequently the counterspace. Clifford algebras are constructed over the counterspace, and the duality between progressive and regressive products is presented using the dual Hodge star operator. The differential and codifferential operators are also defined for the extended exterior algebras from the regressive product viewpoint, and it is shown they uniquely tumble right out progressive and regressive exterior products of 1-forms. R. da Rocha is supported by CAPES     

Clifford algebra valued boundary integral equations for three-dimensional elasticity

Applications of Clifford analysis to three-dimensional elasticity are addressed in the present paper. The governing equation for the displacement field is formulated in terms of the Dirac operator and Clifford algebra valued functions so that a general solution is obtained analytically in terms of one monogenic function and one multiple-component spatial harmonic function together with its derivative. In order to solve numerically the three-dimensional problems of elasticity for an arbitrary domain with complicated boundary conditions, Clifford algebra valued boundary integral equations (BIEs) for multiple-component spatial harmonic functions at an observation point, either inside the domain, on the boundary, or outside the domain, are constructed. Both smooth and non-smooth boundaries are considered in the construction. Moreover, the singularities of the integrals are evaluated exactly so that in the end singularity-free BIEs for the observation point on the boundary taking values on Clifford numbers can be obtained. A Clifford algebra valued boundary element method (BEM) based on the singularity-free BIEs is then developed for solving three-dimensional problems of elasticity. The accuracy of the Clifford algebra valued BEM is demonstrated numerically.     

The degree of an eight-dimensional real quadratic division algebra is 1, 3, or 5

A celebrated theorem of Hopf (1940) [11], Bott and Milnor (1958) [1], and Kervaire (1958) [12] states that every finite-dimensional real division algebra has dimension 1, 2, 4, or 8. While the real division algebras of dimension 1 or 2 and the real quadratic division algebras of dimension 4 have been classified (Dieterich (2005) [6], Dieterich (1998) [3], Dieterich and Öhman (2002) [9]), the problem of classifying all 8-dimensional real quadratic division algebras is still open. We contribute to a solution of that problem by proving that every 8-dimensional real quadratic division algebra has degree 1, 3, or 5. This statement is sharp. It was conjectured in Dieterich et al. (2006) [7].     

Regular Fréchet-Lie groups of invertible elements in some inverse limits of unital involutive Banach algebras

We consider a wide class of unital involutive topological algebras provided with aC ^*-norm and which are inverse limits of sequences of unital involutive Banach algebras; these algebra sare taking a prominent position in noncommutative differential geometry, where they are often called unital smooth algebras. In this paper we prove that the group of invertible elements of such a unital solution smooth algebra and the subgroup of its unitary elements are regular analytic Fréchet-Lie groups of Campbell-Baker-Hausdorff type and fulfill a nice infinite-dimensional version of Lie's second fundamental theorem.     

Algebra word problem solving approaches in a chemistry context: Equation worked examples versus text editing

Text editing directs students’ attention to the problem structure as they classify whether the texts of word problems contain sufficient, missing or irrelevant information for working out a solution. Equation worked examples emphasize the formation of a coherent problem structure to generate a solution. Its focus is on the construction of three equation steps each of which comprises essential units of relevant information. In an experiment, students were randomly assigned to either text editing or equation worked examples condition in a regular classroom setting to learn how to solve algebra word problems in a chemistry context. The equation worked examples group outperformed the text editing group for molarity problems, which were more difficult than dilution problems. Empirical evidence supports the theoretical rationale in using equation worked examples to facilitate students’ construction of a coherent problem structure so as to develop problem skills and expertise to solve molarity problems.     

Récréations et mathématiques mondaines au XVIII siècle: le cas de Guyot

In this paper, we study the most popular book of recreational mathematics published in the second half of the 18th century: The Nouvelles Récréations by Guyot. We indicate the motivations of the author, a simple postman, and the conditions which led him to write this book. We describe the spirit of the book and the public at which it aims. The success of the Nouvelles Récréations illustrates the rise of a science in polite society whose main goal is to amaze and amuse. Then, we examine the place of mathematics in this project and analyze the repertoire of problems and tricks. We focus on problems of combinatorics proposed by Guyot, like anagrams and card shuffles, which inspired some real mathematical work on the part of Monge and Gergonne.     

Parallel interior-point solver for structured quadratic programs: Application to financial planning problems

Many practical large-scale optimization problems are not only sparse, but also display some form of block-structure such as primal or dual block angular structure. Often these structures are nested: each block of the coarse top level structure is block-structured itself. Problems with these characteristics appear frequently in stochastic programming but also in other areas such as telecommunication network modelling. We present a linear algebra library tailored for problems with such structure that is used inside an interior point solver for convex quadratic programming problems. Due to its object-oriented design it can be used to exploit virtually any nested block structure arising in practical problems, eliminating the need for highly specialised linear algebra modules needing to be written for every type of problem separately. Through a careful implementation we achieve almost automatic parallelisation of the linear algebra. The efficiency of the approach is illustrated on several problems arising in the financial planning, namely in the asset and liability management. The problems are modelled as multistage decision processes and by nature lead to nested block-structured problems. By taking the variance of the random variables into account the problems become non-separable quadratic programs. A reformulation of the problem is proposed which reduces density of matrices involved and by these means significantly simplifies its solution by an interior point method. The object-oriented parallel solver achieves high efficiency by careful exploitation of the block sparsity of these problems. As a result a problem with over 50 million decision variables is solved in just over 2 hours on a parallel computer with 16 processors. The approach is by nature scalable and the parallel implementation achieves nearly perfect speed-ups on a range of problems. Supported by the Engineering and Physical Sciences Research Council of UK, EPSRC grant GR/R99683/01     

Algebraic and multiple integral identities

In this paper we develop some identities involving symmetric products in an abstract algebra which was formerly introduced by Rimark Ree to investigate the shuffle product and relations with skew symmetric (Lie) products. His motivation was partially the characterization of homogeneous Lie polynomials in noncommuting variables, while our motivation is derived from problems in systems theory. The main link in these applications is the need for identities involving multiple integrals of functions of many variables. The relation between these identities and some of the abstract identities developed here is also worked out and some of the applications to systems theory reviewed.     

Solutions of the Hom-Yang–Baxter Equation from Monoidal Hom-(Co)Algebra Structures

A method for constructing solutions of the Hom-Yang–Baxter equations is presented. Thus, methods yields a so-called α-involutory solution of the Hom-Yang–Baxter equation for every monoidal Hom-(co)algebra structure on a space. Characterizations for solutions of Hom-Yang–Baxter equations arising from monoidal Hom-(co)algebra structures are given, and a monoidal Hom-(co)algebra structure which produces such a solution is constructed.     

Valuations of terms

Let be a type of algebras. There are several commonly used measurements of the complexity of terms of type , including the depth or height of a term and the number of variable symbols appearing in a term. In this paper we formalize these various measurements, by defining a complexity or valuation mapping on terms. A valuation of terms is thus a mapping from the absolutely free term algebra of type into another algebra of the same type on which an order relation is defined. We develop the interconnections between such term valuations and the equational theory of Universal Algebra. The collection of all varieties of a given type forms a complete lattice which is very complex and difficult to study; valuations of terms offer a new method to study complete sublattices of this lattice.     

Building Complex Solutions From Simple Solutions in the Animation Tutor: Task Completion

The goal of this project, an animation-based tutor for algebra word problems, is to build instructional software to improve estimation, reasoning, and problem-solving skills. In this study, we focused on the 2nd (task completion) module, which uses tank-filling problems in which the unknown variable is the time it will take to fill a tank. Students build on the answers to a simple (no leak) problem to estimate, and then calculate, answers to problems in which there is a leak in the bottom of the tank, a leak in the side of the tank, and a delay in starting one of the pipes. We evaluated the software in an intermediate algebra class consisting of a diverse group of students at a community college. We use the findings to discuss what works (estimation and the solution of the simpler problems) and to make recommendations on how to improve use of the decomposition method for solving the more complex problems.