An Algebraic Approach to Physical Scales

This paper is aimed at introducing an algebraic model for physical scales and units of measurement. This goal is achieved by means of the concept of “positive space” and its rational powers. Positive spaces are “semi-vector spaces” on which the group of positive real numbers acts freely and transitively through the scalar multiplication. Their tensor multiplication with vector spaces yields “scaled spaces” that are suitable to describe spaces with physical dimensions mathematically. We also deal with scales regarded as fields over a given background (e.g., spacetime).     

Spherical Monogenics: An Algebraic Approach

The space of spherical monogenics in can be regarded as a model for the irreducible representation of Spin(m) with weight . In this paper we construct an orthonormal basis for . To describe the symmetry behind this procedure, we define certain Spin(m − 2)-invariant representations of the Lie algebra (2) on . Received: October, 2007. Accepted: February, 2008.     

Idempotent Functional Analysis: An Algebraic Approach

This paper is devoted to Idempotent Functional Analysis, which is an abstract version of Idempotent Analysis developed by V. P. Maslov and his collaborators. We give a brief survey of the basic ideas of Idempotent Analysis. The correspondence between concepts and theorems of traditional Functional Analysis and its idempotent version is discussed in the spirit of N. Bohr's correspondence principle in quantum theory. We present an algebraic approach to Idempotent Functional Analysis. Basic notions and results are formulated in algebraic terms; the essential point is that the operation of idempotent addition can be defined for arbitrary infinite sets of summands. We study idempotent analogs of the basic principles of linear functional analysis and results on the general form of a linear functional and scalar products in idempotent spaces.     

Schwarz交替方向法的代数处理

本文利用代数方法获得二子区域情形带松驰因子的加法型Ｓｃｈｗａｒｚ交替方向法的最优松驰因子，结果表明代数平均是最优的．接着通过反例说明该结果不可推广至多子区域情形．最后，本文将该代数技巧用于证明一些现有的重要结果,和原有证明相比，现证简单、直观     

An Algebraic Approach to Knowledge Base Models Informational Equivalence

In this paper we study the notion of knowledge from the positions of universal algebra and algebraic logic. We consider first order knowledge which is based on first order logic. We define categories of knowledge and knowledge base models. These notions are defined for the fixed subject of knowledge. The key notion of informational equivalence of two knowledge base models is introduced. We use the idea of equivalence of categories in this definition. We prove that for finite models there is a clear way to determine whether the knowledge base models are informationally equivalent.     

Christoffel Words and Markoff Triples: An Algebraic Approach

We introduce a family of modules, called Markoff modules, generated by a cluster-mutation-like iterative process. We show that these modules are combinatorially similar to Christoffel words. Furthermore, we construct a bijective map between the set of Markoff module triples and the set of proper Markoff triples. This allows us to interpret the uniqueness conjecture for Markoff numbers within an algebraic framework.     

An Algebraic Approach for Extending Hamiltonian Operators

An algebraic approach for extending Hamiltonian operators is proposed. A relevant sufficient condition for generating new Lie algebras from known ones is presented. Some special cases are discussed and several illustrative examples are given.     

An Algebraic Interpretation to the Operator-Theoretic Approach to Stabilizability. Part I: SISO Systems

The purpose of this paper is to show that a duality exists between the fractional ideal approach [23, 26] and the operator-theoretic approach [4, 6, 8, 9, 33, 34] to stabilization problems. In particular, this duality helps us to understand how the algebraic properties of systems are reflected by the operator-theoretic approach and conversely. In terms of modules, we characterize the domain and the graph of an internally stabilizable plant or that of a plant which admits a (weakly) coprime factorization. Moreover, we prove that internal stabilizability implies that the graph of the plant and the graph of a stabilizing controller are direct summands of the global signal space. These results generalize those obtained in [6, 8, 9, 33, 34]. Finally, we exhibit a class of signal spaces over which internal stabilizability is equivalent to the existence of a bounded inverse for the linear operator mapping the errors e₁ and e₂ of the closed-loop system to the inputs u₁ and u₂.Mathematics Subject Classifications (2000) 93C05, 93D25, 93B25, 93B28, 16D40, 30D55, 47A05.     

Statistical Algebraic Approach to Quantum Mechanics

A scheme for constructing quantum mechanics not based on the Hilbert space and linear operators as primary elements of the theory is proposed. A particular variant of the algebraic approach is discussed. The elements of a noncommutative algebra (i.e., the observables) and the nonlinear functionals on this algebra (i.e., the physical states) serve as the primary components of the theory. The functionals are associated with the results of a single measurement. The ensembles of physical states are suggested for the role of quantum states in the standard quantum mechanics. It is shown that the mathematical formalism of the standard quantum mechanics can be fully recovered within this scheme.     

An Algebraic Approach to Invariant Preserving Integators: The Case of Quadratic and Hamiltonian Invariants

In this article, conditions for the preservation of quadratic and Hamiltonian invariants by numerical methods which can be written as B-series are derived in a purely algebraical way. The existence of a modified invariant is also investigated and turns out to be equivalent, up to a conjugation, to the preservation of the exact invariant. A striking corollary is that a symplectic method is formally conjugate to a method that preserves the Hamitonian exactly. Another surprising consequence is that the underlying one-step method of a symmetric multistep scheme is formally conjugate to a symplectic P-series when applied to Newton’s equations of motion.     

Tannakian Approach to Linear Differential Algebraic Groups

Tannaka’s theorem states that a linear algebraic group G is determined by the category of finite-dimensional G-modules and the forgetful functor. We extend this result to linear differential algebraic groups by introducing a category corresponding to their representations and show how this category determines such a group. This work was partially supported by NSF Grant CCR-0096842 and by the Russian Foundation for Basic Research, project no. 05-01-00671.     

A Clifford Algebraic Approach to Line Geometry

In this paper we combine methods from projective geometry, Klein’s model, and Clifford algebra. We develop a Clifford algebra whose Pin group is a double cover of the group of regular projective transformations. The Clifford algebra we use is constructed as homogeneous model for the five-dimensional real projective space \({\mathbb {P}^5 (\mathbb{R})}\) where Klein’s quadric \({M^4_2}\) defines the quadratic form. We discuss all entities that can be represented naturally in this homogeneous Clifford algebra model. Projective automorphisms of Klein’s quadric induce projective transformations of \({\mathbb {P}^3 (\mathbb{R})}\) and vice versa. Cayley-Klein geometries can be represented by Clifford algebras, where the group of Cayley-Klein isometries is given by the Pin group of the corresponding Clifford algebra. Therefore, we examine the versor group and study the correspondence between versors and regular projective transformations represented as 4 × 4 matrices. Furthermore, we give methods to compute a versor corresponding to a given projective transformation.     

A Linear Algebraic Approach to Metering Schemes

A metering scheme is a method by which an audit agency is able to measure the interaction between servers and clients during a certain number of time frames. Naor and Pinkas (Vol. 1403 of LNCS, pp. 576–590) proposed metering schemes where any server is able to compute a proof (i.e., a value to be shown to the audit agency at the end of each time frame), if and only if it has been visited by a number of clients larger than or equal to some threshold h during the time frame. Masucci and Stinson (Vol. 1895 of LNCS, pp. 72–87) showed how to construct a metering scheme realizing any access structure, where the access structure is the family of all subsets of clients which enable a server to compute its proof. They also provided lower bounds on the communication complexity of metering schemes. In this paper we describe a linear algebraic approach to design metering schemes realizing any access structure. Namely, given any access structure, we present a method to construct a metering scheme realizing it from any linear secret sharing scheme with the same access structure. Besides, we prove some properties about the relationship between metering schemes and secret sharing schemes. These properties provide some new bounds on the information distributed to clients and servers in a metering scheme. According to these bounds, the optimality of the metering schemes obtained by our method relies upon the optimality of the linear secret sharing schemes for the given access structure.     

A Metric Approach to Elastic Reformations

We study a variational framework to compare shapes, modeled as Radon measures on \({\mathbb{R}}^{N}\) , in order to quantify how they differ from isometric copies. To this purpose we discuss some notions of weak deformations termed reformations as well as integral functionals having some kind of isometries as minimizers. The approach pursued is based on the notion of pointwise Lipschitz constant leading to a matric space framework. In particular, to compare general shapes, we study this reformation problem by using the notion of transport plan and Wasserstein distances as in optimal mass transportation theory.     

Algebraic Approach to Duality in Optimization and Applications

Set-Valued and Variational Analysis - This paper studies duality of optimization problems in a vector space without topological structure. A strong duality relation is established by means of...     

A New Approach to the Algebraic Structures for Integration Methods

The analysis of compositions of Runge-Kutta methods involves manipulations of functions defined on rooted trees. Existing formulations due to Butcher [1972], Hairer and Wanner [1974], and Murua and Sanz-Serna [1999], while equivalent, differ in details. The subject of the present paper is a new recursive formulation of the composition rules. This both simplifies and extends the existing approaches. Instead of using the order conditions based on trees, we propose the construction of the order conditions using a suitably chosen basis on the tree space. In particular, the linear structure of the tree space gives a representation of the C and D simplifying assumptions on trees which is not restricted to Runge-Kutta methods. A proof of the group structure of the set of elementary weight functions satisfying the D simplifying assumptions is also given is this paper.