Rumen Dangovski

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The concepts of unitary evolution matrices and associative memory have boosted the field of Recurrent Neural Networks (RNN) to state-of-the-art performance in a variety of sequential tasks. However, RNN still have a limited capacity to manipulate long-term memory. To bypass this weakness the most successful applications of RNN use external techniques such(More)
The Cookie Monster Problem supposes that the Cookie Monster wants to empty a set S of jars filled with various numbers of cookies. On each of his moves, he may choose any subset of jars and take the same number of cookies from each of those jars. The Cookie Monster number of S, CM(S), is the minimum number of moves the Cookie Monster must use to empty all(More)
In this paper we study the lower central series {Li}i≥1 of algebras with polynomial identities. More specifically, we investigate the properties of the quotients Ni = Mi/Mi+1 of successive ideals generated by the elements Li. We give a complete description of the structure of these quotients for the free metabelian associative algebra A/(A[A,A][A,A]). With(More)
  • 1