Let f and g be two permutable transcendental entire functions. In this paper, we first prove that J(fg)=J(f n g m) for any positive integers n and m . Then we prove that the function h(p(z))+az ∈/ B , where h(z) is...Let f and g be two permutable transcendental entire functions. In this paper, we first prove that J(fg)=J(f n g m) for any positive integers n and m . Then we prove that the function h(p(z))+az ∈/ B , where h(z) is any transcendental entire function with h′(z)=0 having infinitely many solutions, p(z) is a polynomial with deg p ≥2 and a(≠0) ∈ C .展开更多
In 1958, Baker posed the question that if f and g are two permutable transcendental entire functions, must their Julia sets be the same? In order to study this problem of permutable transcendental entire functions, by...In 1958, Baker posed the question that if f and g are two permutable transcendental entire functions, must their Julia sets be the same? In order to study this problem of permutable transcendental entire functions, by the properties of permutable transcendental entire functions, we prove that if f and g are permutable transcendental entire functions, then mes (J(f)) = mes (J(g)). Moreover, we give some results about the zero measure of the Julia sets of the permutable transcendental entire functions family.展开更多
This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptog...This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptographic properties. The proposed method is algebraic in nature. As a by-product, the authors correct and generalize the corresponding results of St^nic~ and Maitra （2008）. Further, the authors give a complete classification of block-symmetric bent functions based on the results of Zhao and Li （2006）, and the result is the only one classification of a certain class of permutation symmetric bent functions after the classification of symmetric bent functions proposed by Savicky （1994）.展开更多
文摘Let f and g be two permutable transcendental entire functions. In this paper, we first prove that J(fg)=J(f n g m) for any positive integers n and m . Then we prove that the function h(p(z))+az ∈/ B , where h(z) is any transcendental entire function with h′(z)=0 having infinitely many solutions, p(z) is a polynomial with deg p ≥2 and a(≠0) ∈ C .
文摘In 1958, Baker posed the question that if f and g are two permutable transcendental entire functions, must their Julia sets be the same? In order to study this problem of permutable transcendental entire functions, by the properties of permutable transcendental entire functions, we prove that if f and g are permutable transcendental entire functions, then mes (J(f)) = mes (J(g)). Moreover, we give some results about the zero measure of the Julia sets of the permutable transcendental entire functions family.
基金supported by the National Natural Science Foundation of China under Grant Nos.11071285 and 61121062973 Project under Grant No.2011CB302401the National Center for Mathematics and Interdisciplinary Sciences,Chinese Academy of Sciences
文摘This paper provides a systematic method on the enumeration of various permutation symmetric Boolean functions. The results play a crucial role on the search of permutation symmetric Boolean functions with good cryptographic properties. The proposed method is algebraic in nature. As a by-product, the authors correct and generalize the corresponding results of St^nic~ and Maitra （2008）. Further, the authors give a complete classification of block-symmetric bent functions based on the results of Zhao and Li （2006）, and the result is the only one classification of a certain class of permutation symmetric bent functions after the classification of symmetric bent functions proposed by Savicky （1994）.
