Statistics on the multi-colored permutation groups.
Bagno, Eli, Butman, Ayelet, Garber, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bagno, Eli, Butman, Ayelet, Garber, David (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Grainger, Arthur D. (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Faliharimalala, Hilarion L.M., Zeng, Jiang (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Grosjean, Carl C. (1996)
Bulletin of the Belgian Mathematical Society - Simon Stevin
Similarity:
Vella, David C. (2008)
Integers
Similarity:
De Coster, C., Habets, P. (1996)
Portugaliae Mathematica
Similarity:
Wancang Ma, David Minda (1993)
Annales Polonici Mathematici
Similarity:
Recently, A. W. Goodman introduced the class UCV of normalized uniformly convex functions. We present some sharp coefficient bounds for functions f(z) = z + a₂z² + a₃z³ + ... ∈ UCV and their inverses . The series expansion for converges when , where depends on f. The sharp bounds on and all extremal functions were known for n = 2 and 3; the extremal functions consist of a certain function k ∈ UCV and its rotations. We obtain the sharp bounds on and all extremal functions for...
Mohmed H. Saleh, Samir M. Amer, Marwa H. Ahmed (2009)
Applications of Mathematics
Similarity:
A class of non-linear singular integral equations with Hilbert kernel and a related class of quasi-linear singular integro-differential equations are investigated by applying Schauder's fixed point theorem in Banach spaces.
Meng Xiao Yin, Jian Hua Yin (2007)
Czechoslovak Mathematical Journal
Similarity:
For given a graph , a graphic sequence is said to be potentially -graphic if there is a realization of containing as a subgraph. In this paper, we characterize the potentially -positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence to be potentially -graphic, where is a complete graph on vertices and is a graph obtained from by deleting one edge. Moreover, we also give a simple necessary and sufficient condition...