942 resultados para Univalent polynomial
Resumo:
∗ Partially supported by INTAS grant 97-1644
Resumo:
In this paper an alternative characterization of the class of functions called k -uniformly convex is found. Various relations concerning connections with other classes of univalent functions are given. Moreover a new class of univalent functions, analogous to the ’Mocanu class’ of functions, is introduced. Some results concerning this class are derived.
Resumo:
* Partially supported by Universita` di Bari: progetto “Strutture algebriche, geometriche e descrizione degli invarianti ad esse associate”.
Resumo:
It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).
Resumo:
Dubrovin type equations for the N -gap solution of a completely integrable system associated with a polynomial pencil is constructed and then integrated to a system of functional equations. The approach used to derive those results is a generalization of the familiar process of finding the 1-soliton (1-gap) solution by integrating the ODE obtained from the soliton equation via the substitution u = u(x + λt).
Resumo:
* Dedicated to the memory of Prof. N. Obreshkoff
Resumo:
2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35
Resumo:
Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90
Resumo:
The eccentric connectivity index of a graph G, ξ^C, was proposed by Sharma, Goswami and Madan. It is defined as ξ^C(G) = ∑ u ∈ V(G) degG(u)εG(u), where degG(u) denotes the degree of the vertex x in G and εG(u) = Max{d(u, x) | x ∈ V (G)}. The eccentric connectivity polynomial is a polynomial version of this topological index. In this paper, exact formulas for the eccentric connectivity polynomial of Cartesian product, symmetric difference, disjunction and join of graphs are presented.
Resumo:
MSC 2010: 30C45, 30C50
Resumo:
MSC 2010: 30C45
Resumo:
MSC 2010: 30C45, 30C50
Resumo:
2000 Mathematics Subject Classification: 12D10.
Resumo:
2000 Mathematics Subject Classification: 30C25, 30C45.
Resumo:
000 Mathematics Subject Classification: Primary 16R50, Secondary 16W55.