Search results for "algebra"

Embedded Coprocessors for Native Execution of Geometric Algebra Operations

2016

Clifford algebra or geometric algebra (GA) is a simple and intuitive way to model geometric objects and their transformations. Operating in high-dimensional vector spaces with significant computational costs, the practical use of GA requires dedicated software and/or hardware architectures to directly support Clifford data types and operators. In this paper, a family of embedded coprocessors for the native execution of GA operations is presented. The paper shows the evolution of the coprocessor family focusing on the latest two architectures that offer direct hardware support to up to five-dimensional Clifford operations. The proposed coprocessors exploit hardware-oriented representations o…

Frequency format facilitates reasoning in simple numerical tasks.

2005

This study examined whether it is easier to reason in terms of frequencies or with percentages for simple numerical tasks. Research on probabilistic reasoning has shown that humans can draw correct inferences when problems are presented in terms of natural frequencies but not when in percentages. Whether the same effect can be observed in other numerically simple tasks which are not probabilistic was studied with 40 undergraduate students who volunteered for the experiment (13 men, 27 women; M age of 23 yr.). In a simple numerical task involving frequencies or percentages ( N = 20), their performance showed representation in frequencies facilitates the task.

Central polynomials of graded algebras: Capturing their exponential growth

2022

Let G be a finite abelian group and let A be an associative G-graded algebra over a field of characteristic zero. A central G-polynomial is a polynomial of the free associative G-graded algebra that takes central values for all graded substitutions of homogeneous elements of A. We prove the existence and the integrability of two limits called the central G-exponent and the proper central G-exponent that give a quantitative measure of the growth of the central G-polynomials and the proper central G-polynomials, respectively. Moreover, we compare them with the G-exponent of the algebra.

Superalgebras: Polynomial identities and asymptotics

2022

To any superalgebra A is attached a numerical sequence cnsup(A), n≥1, called the sequence of supercodimensions of A. In characteristic zero its asymptotics are an invariant of the superidentities satisfied by A. It is well-known that for a PI-superalgebra such sequence is exponentially bounded and expsup(A)=limn→∞⁡cnsup(A)n is an integer that can be explicitly computed. Here we introduce a notion of fundamental superalgebra over a field of characteristic zero. We prove that if A is such an algebra, then C1ntexpsup(A)n≤cnsup(A)≤C2ntexpsup(A)n, where C1>0,C2,t are constants and t is a half integer that can be explicitly written as a linear function of the dimension of the even part of A an…

ON THE ASYMPTOTICS OF CAPELLI POLYNOMIALS

2021

Abstract. We present old and new results about Capelli polynomials, Z2-graded Capelli polynomials and Capelli polynomials with involution and their asymptotics. Let Capm = Pσ2Sm (sgnσ)tσ(1)x1tσ(2) · · · tσ(m−1)xm−1tσ(m) be the m-th Capelli polynomial of rank m. In the ordinary case (see [33]) it was proved the asymptotic equality between the codimensions of the T -ideal generated by the Capelli polynomial Capk2+1 and the codimensions of the matrix algebra Mk(F ). In [9] this result was extended to superalgebras proving that the Z2-graded codimensions of the T2-ideal generated by the Z2-graded Capelli polynomials Cap0 M+1 and Cap1 L+1 for some fixed M, L, are asymptotically equal to the Z2-g…

The nonabelian tensor product of two soluble minimax groups

2010

Finite Commutative Rings and Their Applications

2002

Finite Commutative Rings and their Applications is the first to address both theoretical and practical aspects of finite ring theory. The authors provide a practical approach to finite rings through explanatory examples, thereby avoiding an abstract presentation of the subject. The section on Quasi-Galois rings presents new and unpublished results as well. The authors then introduce some applications of finite rings, in particular Galois rings, to coding theory, using a solid algebraic and geometric theoretical background.

A generalization of groups with many almost normal subgroups

2010

A subgroup $H$ of a group $G$ is called almost normal in $G$ if it has finitely many conjugates in $G$. A classic result of B. H. Neumann informs us that $|G : Z(G)|$ is finite if and only if each $H$ is almost normal in $G$. Starting from this result, we investigate the structure of a group in which each non- finitely generated subgroup satisfies a property, which is weaker to be almost normal.

On Pseudofunctors Sending Groups to 2-Groups

2023

For a category B with finite products, we first characterize pseudofunctors from B to Cat whose corresponding opfibration is cartesian monoidal. Among those, we then characterize the ones which extend to pseudofunctors from internal groups to 2-groups. If B is additive, this is the case precisely when the corresponding opfibration has groupoidal fibres.

Nilpotent varieties and metabelian varieties

2022

We deal with varieties of nonassociative algebras having polynomial growth of codimensions. We describe some results obtained in recent years in the class of left nilpotent algebras of index two. Recently the authors established a correspondence between the growth rates for left nilpotent algebras of index two and the growth rates for commutative or anticommutative metabelian algebras that allows to transfer the results concerning varieties of left nilpotent algebras of index two to varieties of commutative or anticommutative metabelian algebras.