Search results for "COD"

Exponential Codimension Growth of PI Algebras: An Exact Estimate

1999

Abstract LetAbe an associative PI-algebra over a fieldFof characteristic zero. By studying the exponential behavior of the sequence of codimensions {cn(A)} ofA, we prove thatInv(A)=limn→∞  c n ( A ) always exists and is an integer. We also give an explicit way for computing such integer: letBbe a finite dimensionalZ2-graded algebra whose Grassmann envelopeG(B) satisfies the same identities ofA; thenInv(A)=Inv(G(B))=dim C(0)+dim C(1)whereC(0)+C(1)is a suitableZ2-graded semisimple subalgebra ofB.

Symbolic Dynamics of Geodesic Flows on Trees

2019

In this chapter, we give a coding of the discrete-time geodesic ow on the nonwandering sets of quotients of locally finite simplicial trees X without terminal vertices by nonelementary discrete subgroups of Aut(X) by a subshift of finite type on a countable alphabet.

Coding with traces

1994

We prove that the existence of a coding between two trace monoids is decidable for some families of trace monoids. Decidability heavily depends on the structure of the dependence graphs. The concept of coding is based on the new notion of strong morphism between trace monoids.

Polyomino Number Theory (II)

2003

Polyominoes are connected plane figures formed of joining unit squares edge to edge. We have a monomino, a domino, two trominoes named I and V, five tetrominoes named I, L, N, O and T, respectively, and twelve pentominoes (a registered trademark of Solomon W. Golomb) named F, I, L, N, P, T, U, V, W, X, Y and Z respectively.

Growth of polynomial identities: is the sequence of codimensions eventually non-decreasing?

2014

Varieties with at most quadratic growth

2010

Let V be a variety of non necessarily associative algebras over a field of characteristic zero. The growth of V is determined by the asymptotic behavior of the sequence of codimensions cn(V); n = 1; 2, … and here we study varieties of polynomial growth. Recently, for any real number a, 3 < a < 4, a variety V was constructed satisfying C1n^a < cn(V) < C2n^a; for some constants C1;C2. Motivated by this result here we try to classify all possible growth of varieties V such that cn(V) < Cn^a; with 0 < a < 2, for some constant C. We prove that if 0 < a < 1 then, for n large, cn(V) ≤ 1, whereas if V is a commutative variety and 1 < a < 2, then lim logn cn(V) = 1 o…

A generalization of Sardinas and Patterson's algorithm to z-codes

1993

Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.

Un cortijo para multinacionales

2007

Commento agli artt. 2, 15, 16, 68, 81, 84.

2011

Commento ad alcuni articoli del codice penale.

CAPO II - DEI DELITTI DEI PRIVATI CONTRO LA PUBBLICA AMMINISTRAZIONE

2014

Commento giurisprudenziale sistematico, con annotazioni dell'Autore, degli artt. da 336 a 360 cod. pen.