1,721,178 research outputs found
A note on repelling periodic points for meromorphic functions with bounded set of singular values
No full textLet be a meromorphic function with bounded set of singular values and for which infinity is a logarithmic singularity. Then we show that has infinitely many repelling periodic points for any minimal period , using a much simpler argument than the more general results for arbitrary entire transcendental functions
Expansivity properties and rigidity for non-recurrent exponential maps
No full textemphsmall We will set up and prove a rigidity statement for an exponential map such that the singular value is combinatorially non-recurrent, non-escaping and belongs to the Julia set.
We will also prove a theorem about expansivity of the postsingular set in the case that the singular value is non-recurrent, generalizing results of Rempe and van Strien to the case in which the postsingular set is not bounded
Triviality of fibers for Misiurewicz parameters in the exponential family
No full textWe consider the family of holomorphic maps and show that fibers of postsingularly finite parameters are trivial. This can be considered as the first and simplest class of non-escaping parameters for which we can obtain results about triviality of fibers in the exponential family
Improved Schwinger-DeWitt techniques for higher-derivative perturbations of operator determinants
No full textWe consider higher-derivative perturbations of quantum gravity and quantum field theories in curved space and investigate tools to calculate counterterms and short-distance expansions of Feynman diagrams. In the case of single higher-derivative insertions we derive a closed formula that relates the perturbed one-loop counterterms to the unperturbed Schwinger-DeWitt coefficients. In the more general case, we classify the contributions to the short-distance expansion and outline a number of simplification methods. Certain difficulties of the common differential technique in the presence of higher-derivative perturbations are avoided by a systematic use of the Campbell-Baker-Hausdorff formula, which in some cases reduces the computational effort considerably
Singular values and bounded Siegel disks
No full textLet f be an entire transcendental function of finite order and Delta be a forward invariant bounded Siegel disk for f with rotation number in Herman's class (Formula presented.). We show that if f has two singular values with bounded orbit, then the boundary of Δ contains a critical point. We also give a criterion under which the critical point in question is recurrent. We actually prove a more general theorem with less restrictive hypotheses, from which these results follow
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Down-linking(Kv,Γ)-designs to P3-designs
No full textLet Γ' be a subgraph of a graph Γ. We define a down-link from a(KvΓ)-design B to a(Kn,Γ')-design.B' as a map f: B → B' mapping any block of B into one of its subgraphs. This is a new concept,closely related with both the notion of metamorphosis and that of embedding. In the present paper we study down-links in general and prove that any(Kv,Γ)-design might be down-linked to a(K n,Γ')-design,provided that n is admissible and large enough. We also show that if Γ' = P3,it is always possible to find a down-link to a design of order at most v + 3. This bound is then improved for several classes of graphs Γ,by providing explicit constructions
- …
