Search results for "algebra"
showing 10 items of 4129 documents
Properties of a matrix group associated to a {K,s+1}-potent matrix
2012
In a previous paper, the authors introduced and characterized a new kind of matrices called {K,s+1}-potent. In this paper, an associated group to a {K, s+1}-potent matrix is explicitly constructed and its properties are studied. Moreover, it is shown that the group is a semidirect product of Z_2 acting on Z_{(s+1)^2-1}. For some values of s, more specifications on the group are derived. In addition, some illustrative examples are given.
A Mushroom Bodies inspired spiking network for classification and sequence learning
2015
Sequence learning is a complex capability shown by living beings, able to extract information from the environment. Looking into the insect world, there are several examples where the presentation time of specific stimuli is considered to select the proper behavioural response. On the basis of previously developed neural models for sequence learning, inspired by the Drosophila melanogaster, a new formalization of key brain structures involved in the process is here provided. The input classification is performed through resonant neurons, stimulated by the complex dynamics generated in a lattice of recurrent spiking neurons modelling the Mushroom Bodies neuropile in the insect brain. The net…
A Variational Formulation of the BEM for Elastic-Plastic Analysis
1990
The quasi-static elastic perfectly plastic analysis problem is approached by the boundary element method (BEM). To this purpose, a time semidiscretization is first achieved by finite intervals (Fl) in order to transform, through a variationally consistent procedure, the evolutive problem into a discrete sequence of inelastic holonomic-type “weighted” problems for each of which a mixed boundary/domain min-max principle is established. This principle is then discretized by means of boundary elements (BE) and cell elements (CE), the latter having the only purpose of suitably interpolating the FI weighted yielding laws within the domain. The algebraic governing equations obtained show symmetry …
A closed-form solution for natural frequencies of thin-walled cylinders with clamped edges
2016
Abstract This paper presents an approximate closed-form solution for the free-vibration problem of thin-walled clamped–clamped cylinders. The used indefinite equations of motion are classic. They derive from Reissner׳s version of Love׳s theory, properly modified with Donnell׳s assumptions, but an innovative approach has been used to find the equations of natural frequencies, based on a solving technique similar to Rayleigh׳s method, on the Hamilton׳s principle and on a proper constructions of the eigenfuctions. Thanks to the used approach, given the geometric and mechanical characteristics of the cylinder, the model provides the natural frequencies via a sequence of explicit algebraic equat…
Algebras with intermediate growth of the codimensions
2006
AbstractLet F be a field of characteristic zero and let A be an F-algebra. The polynomial identities satisfied by A can be measured through the asymptotic behavior of the sequence of codimensions and the sequence of colengths of A. For finite dimensional algebras we show that the colength sequence of A is polynomially bounded and the codimension sequence cannot have intermediate growth. We then prove that for general nonassociative algebras intermediate growth of the codimensions is allowed. In fact, for any real number 0<β<1, we construct an algebra A whose sequence of codimensions grows like nnβ.
Varieties of Algebras with Superinvolution of Almost Polynomial Growth
2015
Let A be an associative algebra with superinvolution ∗ over a field of characteristic zero and let $c_{n}^{\ast }(A)$ be its sequence of corresponding ∗-codimensions. In case A is finite dimensional, we prove that such sequence is polynomially bounded if and only if the variety generated by A does not contain three explicitly described algebras with superinvolution. As a consequence we find out that no intermediate growth of the ∗-codimensions between polynomial and exponential is allowed.
Space of signatures as inverse limits of Carnot groups
2021
We formalize the notion of limit of an inverse system of metric spaces with 1-Lipschitz projections having unbounded fibers. The construction is applied to the sequence of free Carnot groups of fixed rank n and increasing step. In this case, the limit space is in correspondence with the space of signatures of rectifiable paths in ℝn, as introduced by Chen. Hambly-Lyons’s result on the uniqueness of signature implies that this space is a geodesic metric tree. As a particular consequence we deduce that every path in ℝn can be approximated by projections of some geodesics in some Carnot group of rank n, giving an evidence that the complexity of sub-Riemannian geodesics increases with the step.
Asymptotics for Capelli polynomials with involution
2021
Let F be the free associative algebra with involution ∗ over a field F of characteristic zero. We study the asymptotic behavior of the sequence of ∗- codimensions of the T-∗-ideal Γ∗ M+1,L+1 of F generated by the ∗-Capelli polynomials Cap∗ M+1[Y, X] and Cap∗ L+1[Z, X] alternanting on M + 1 symmetric variables and L + 1 skew variables, respectively. It is well known that, if F is an algebraic closed field of characteristic zero, every finite dimensional ∗-simple algebra is isomorphic to one of the following algebras: · (Mk(F ), t) the algebra of k × k matrices with the transpose involution; · (M2m(F ), s) the algebra of 2m × 2m matrices with the symplectic involution; · (Mh(F ) ⊕ Mh(F )op, e…
Optimal selection of thek best of a sequence withk stops
1997
We first consider the situation in which the decision-maker is allowed to have five choices with purpose to choose exactly the five absolute best candidates fromN applicants. The optimal stopping rule and the maximum probability of making the right five-choice are given for largeN eN, the maximum asymptotic value of the probability of the best choice being limN→∝P (win) ≈ 0.104305. Then, we study the general problem of selecting thek best of a sequence withk stops, constructing first a rough solution for this problem. Using this suboptimal solution, we find an approximation for the optimal probability valuesPk of the form $$P_k \approx \frac{1}{{(e - 1)k + 1}}$$ for any k eN.
A Geometric Algebra Based Distributional Model to Encode Sentences Semantics
2013
Word space models are used to encode the semantics of natural language elements by means of high dimensional vectors [23]. Latent Semantic Analysis (LSA) methodology [15] is well known and widely used for its generalization properties. Despite of its good performance in several applications, the model induced by LSA ignores dynamic changes in sentences meaning that depend on the order of the words, because it is based on a bag of words analysis. In this chapter we present a technique that exploits LSA-based semantic spaces and geometric algebra in order to obtain a sub-symbolic encoding of sentences taking into account the words sequence in the sentence. © 2014 Springer-Verlag Berlin Heidel…