Convex family of meromorphically multivalent functions on connected sets
Abstract In this paper, by using a differential operator we have defined a new class of meromorphically multivalent functions. Also two useful subclasses of this class involving fixed points are investigated. Important properties of these classes like convex linear combination, coefficient estimates, convex family etc. are found.
New subclass of p-valent functions with negative coefficients
In this present paper, a certain differential operator Sα,β,λ,δ,pkf(z) and new subclass SMu, p(τ, γ, λ, α, p) for analytic functions with negative coefficients of the form f(z)=zp+∑n−p+1∞anzn are introduced. The main object of this paper is to investigate the various important properties of the class SMu, p(τ, γ, λ, α, p).
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.