Search results for " Abel"
showing 10 items of 49 documents
On Codimension Growth of Finitely Generated Associative Algebras
1998
Abstract LetAbe a PI-algebra over a fieldF. We study the asymptotic behavior of the sequence of codimensionscn(A) ofA. We show that ifAis finitely generated overFthenInv(A)=limn→∞ c n (A) always exists and is an integer. We also obtain the following characterization of simple algebras:Ais finite dimensional central simple overFif and only ifInv(A)=dim=A.
Hybrid bases for varieties of semigroups
2003
We consider the lower part of the lattice of varieties of semigroups. We present finite bases of hybrid identities for the varieties of normal bands, commutative bands and abelian groups of finite exponent. The variety A n,0 of abelian groups provides an example of a variety which has no finite base of hyperidentities (cf. [12]) but has a finite base of hybrid identities.
Identities of PI-Algebras Graded by a Finite Abelian Group
2011
We consider associative PI-algebras over an algebraically closed field of zero characteristic graded by a finite abelian group G. It is proved that in this case the ideal of graded identities of a G-graded finitely generated PI-algebra coincides with the ideal of graded identities of some finite dimensional G-graded algebra. This implies that the ideal of G-graded identities of any (not necessary finitely generated) G-graded PI-algebra coincides with the ideal of G-graded identities of the Grassmann envelope of a finite dimensional (G × ℤ2)-graded algebra, and is finitely generated as GT-ideal. Similar results take place for ideals of identities with automorphisms.
Partial Finitely Generated Bi-Ideals
2016
Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. This paper gives a solution for some problems for partial reccurrent words. This paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. The paper states that it is always possible to find a basis for a given finitely generated bi-ideal. The main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. This led to the st…
Algorithms for Computing Abelian Periods of Words
2012
Constantinescu and Ilie (Bulletin EATCS 89, 167--170, 2006) introduced the notion of an \emph{Abelian period} of a word. A word of length $n$ over an alphabet of size $\sigma$ can have $\Theta(n^{2})$ distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time $O(n^2 \times \sigma)$ using $O(n \times \sigma)$ space. We present an off-line algorithm based on a $\sel$ function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present on-line algorithms that also enable to compute all the Abelian periods of all the prefixes of $w$.
A note on easy and efficient computation of full abelian periods of a word
2016
Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.
Abelian Powers and Repetitions in Sturmian Words
2016
Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent $k$ for every $k > 0$. We improve on this result by studying the maximum exponents of abelian powers and abelian repetitions (an abelian repetition is an analogue of a fractional power) in Sturmian words. We give a formula for computing the maximum exponent of an abelian power of abelian period $m$ starting at a given position in any Sturmian word of rotation angle $\alpha$. vAs an analogue of the critical exponent, we introduce the abelian critical exponent $A(s_\alpha)$ of a Sturmian word $s_\alpha$ of angle $\alpha$ as the quantity $A(s_\a…
Fast computation of abelian runs
2016
Given a word $w$ and a Parikh vector $\mathcal{P}$, an abelian run of period $\mathcal{P}$ in $w$ is a maximal occurrence of a substring of $w$ having abelian period $\mathcal{P}$. Our main result is an online algorithm that, given a word $w$ of length $n$ over an alphabet of cardinality $\sigma$ and a Parikh vector $\mathcal{P}$, returns all the abelian runs of period $\mathcal{P}$ in $w$ in time $O(n)$ and space $O(\sigma+p)$, where $p$ is the norm of $\mathcal{P}$, i.e., the sum of its components. We also present an online algorithm that computes all the abelian runs with periods of norm $p$ in $w$ in time $O(np)$, for any given norm $p$. Finally, we give an $O(n^2)$-time offline randomi…
Henstock type integral in harmonic analysis on zero-dimensional groups
2006
AbstractA Henstock type integral is defined on compact subsets of a locally compact zero-dimensional abelian group. This integral is applied to obtain an inversion formula for the multiplicative integral transform.
Integration of functions ranging in complex Riesz space and some applications in harmonic analysis
2015
The theory of HenstockâKurzweil integral is generalized to the case of functions ranging in complex Riesz space R and defined on any zero-dimensional compact Abelian group. The constructed integral is used to solve the problem of recovering the R-valued coefficients of series in systems of characters of these groups by using generalized Fourier formulas.