Continued fractions of Laurent series with partial quotients from a given set
1. Introduction. Van der Poorten and Shallit's paper [10] begins: " It is notorious that it is damnably difficult to explicitly compute the continued fraction of a quantity presented in some other form ". The quantity is usually presented either as a power series or as the root of a specific equation. There has been some success in the former case for continued fractions of real numbers, such as Euler's famous continued fraction for e [11] and more recent work [10] on " folded " continued fractions; however, other than the well-known results for quadratic real numbers, the only success with the latter has been for continued fractions of Laurent series rather than real numbers. In this paper we continue this line of investigation. We consider families of continued fractions of Laurent series whose partial quotients all lie in a given set. Following ideas of Baum and Sweet [2], we show that one may describe the zeros of certain collections of equations in terms of such families. The paragraphs that follow introduce the notation and definitions necessary to give a fuller description of our results. Let F q be the finite field with q elements and L q denote the field of formal Laurent series in x
Rubik's for cryptographers
Hard mathematical problems are at the core of security arguments in cryptography. In this paper, we study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. The factorization problem is also strongly related to a famous long-standing conjecture of Babai, at the intersection of group theory and graph theory. A constructive proof of Babai’s conjecture would make all Cayley hash functions insecure, but on the other hand it would have many positive applications in graph theory and computer science. In this paper, we classify existing attacks against Cayley hash functions and we review known results on Babai’s conjecture. Despite recent cryptanalytic progress on particular instances, we show that the factorization, representation and balance problems presumably remain good sources of cryptographic hard problems. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community.
AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVE S-ACTS
ABSTRACT This paper gives necessary and sufficient conditions on a monoid S that the class of flat left S-acts be (first order) axiomatisable. It presents also a streamlined version of the result of Stepanova that the class of projective left S-acts is axiomatisable if and only if the strongly flat left S-acts are axiomatisable and S is left perfect.