182 research outputs found
Gr\"obner-Shirshov bases for categories
In this paper we establish Composition-Diamond lemma for small categories. We
give Gr\"obner-Shirshov bases for simplicial category and cyclic category.Comment: 20 page
Subexponential estimations in Shirshov's height theorem
In 1993 E. I. Zelmanov asked the following question in Dniester Notebook:
"Suppose that F_{2, m} is a 2-generated associative ring with the identity
x^m=0. Is it true, that the nilpotency degree of F_{2, m} has exponential
growth?"
We show that the nilpotency degree of l-generated associative algebra with
the identity x^d=0 is smaller than Psi(d,d,l), where Psi(n,d,l)=2^{18} l
(nd)^{3 log_3 (nd)+13}d^2. We give the definitive answer to E. I. Zelmanov by
this result. It is the consequence of one fact, which is based on combinatorics
of words. Let l, n and d>n be positive integers. Then all the words over
alphabet of cardinality l which length is greater than Psi(n,d,l) are either
n-divided or contain d-th power of subword, where a word W is n-divided, if it
can be represented in the following form W=W_0 W_1...W_n such that W_1 >'
W_2>'...>'W_n. The symbol >' means lexicographical order here. A. I. Shirshov
proved that the set of non n-divided words over alphabet of cardinality l has
bounded height h over the set Y consisting of all the words of degree <n.
Original Shirshov's estimation was just recursive, in 1982 double exponent was
obtained by A.G.Kolotov and in 1993 A.Ya.Belov obtained exponential estimation.
We show, that h<Phi(n,l), where Phi(n,l) = 2^{87} n^{12 log_3 n + 48} l. Our
proof uses Latyshev idea of Dilworth theorem application.Comment: In Russian, 22 pages. The current version of this paper differs from
the previous versions by the better estimation. English version of the
article is located at http://arxiv.org/abs/1207.298
Subexponential estimations in Shirshov's height theorem (in English)
In 1993 E. I. Zelmanov asked the following question in Dniester Notebook:
"Suppose that F_{2, m} is a 2-generated associative ring with the identity
x^m=0. Is it true, that the nilpotency degree of F_{2, m} has exponential
growth?" We show that the nilpotency degree of l-generated associative algebra
with the identity x^d=0 is smaller than Psi(d,d,l), where Psi(n,d,l)=2^{18} l
(nd)^{3 log_3 (nd)+13}d^2. We give the definitive answer to E. I. Zelmanov by
this result. It is the consequence of one fact, which is based on combinatorics
of words. Let l, n and d>n be positive integers. Then all the words over
alphabet of cardinality l which length is greater than Psi(n,d,l) are either
n-divided or contain d-th power of subword, where a word W is n-divided, if it
can be represented in the following form W=W_0 W_1...W_n such that W_1 >'
W_2>'...>'W_n. The symbol >' means lexicographical order here. A. I. Shirshov
proved that the set of non n-divided words over alphabet of cardinality l has
bounded height h over the set Y consisting of all the words of degree <n.
Original Shirshov's estimation was just recursive, in 1982 double exponent was
obtained by A.G.Kolotov and in 1993 A.Ya.Belov obtained exponential estimation.
We show, that h<Phi(n,l), where Phi(n,l) = 2^{87} n^{12 log_3 n + 48} l. Our
proof uses Latyshev idea of Dilworth theorem application.Comment: 21 pages, Russian version of the article is located at the link
arXiv:1101.4909; Sbornik: Mathematics, 203:4 (2012), 534 -- 55
Poincare-Birkhoff-Witt Theorems
We sample some Poincare-Birkhoff-Witt theorems appearing in mathematics.
Along the way, we compare modern techniques used to establish such results, for
example, the Composition-Diamond Lemma, Groebner basis theory, and the
homological approaches of Braverman and Gaitsgory and of Polishchuk and
Positselski. We discuss several contexts for PBW theorems and their
applications, such as Drinfeld-Jimbo quantum groups, graded Hecke algebras, and
symplectic reflection and related algebras.Comment: 30 pages; survey article to appear in Mathematical Sciences Research
Institute Proceeding
On the presentation of pointed Hopf algebras
We give a presentation in terms of generators and relations of Hopf algebras
generated by skew-primitive elements and abelian group of group-like elements
with action given via characters. This class of pointed Hopf algebras has shown
great importance in the classification theory and can be seen as generalized
quantum groups. As a consequence we get an analog presentation of Nichols
algebras of diagonal type
Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions
Classically in combinatorics on words one studies unavoidable regularities
that appear in sufficiently long strings of symbols over a fixed size alphabet.
In this paper we take another viewpoint and focus on combinatorial properties
of long words in which the number of occurrences of any symbol is restritced by
a fixed constant. We then demonstrate the connection of these properties to
constructing multicollision attacks on so called generalized iterated hash
functions.Comment: In Proceedings WORDS 2011, arXiv:1108.341
- …