Connectedness properties of the set where the iterates of an entire function are unbounded

We investigate the connectedness properties of the set I+(f) of points where the iterates of an entire function f are unbounded. In particular, we show that I+(f) is connected whenever iterates of the minimum modulus of f tend to ∞. For a general transcendental entire function f, we show that I+(f)∪ \{\infty\} is always connected and that, if I+(f) is disconnected, then it has uncountably many components, infinitely many of which are unbounded

An explanation of the Newman-Janis Algorithm

After the original discovery of the Kerr metric, Newman and Janis showed that this solution could be ``derived'' by making an elementary complex transformation to the Schwarzschild solution. The same method was then used to obtain a new stationary axisymmetric solution to Einstein's field equations now known as the Kerr-newman metric, representing a rotating massive charged black hole. However no clear reason has ever been given as to why the Newman-Janis algorithm works, many physicist considering it to be an ad hoc procedure or ``fluke'' and not worthy of further investigation. Contrary to this belief this paper shows why the Newman-Janis algorithm is successful in obtaining the Kerr-Newman metric by removing some of the ambiguities present in the original derivation. Finally we show that the only perfect fluid generated by the Newman-Janis algorithm is the (vacuum) Kerr metric and that the only Petrov typed D solution to the Einstein-Maxwell equations is the Kerr-Newman metric.Comment: 14 pages, no figures, submitted to Class. Quantum Gra

Bounds for the time to failure of hierarchical systems of fracture

For years limited Monte Carlo simulations have led to the suspicion that the time to failure of hierarchically organized load-transfer models of fracture is non-zero for sets of infinite size. This fact could have a profound significance in engineering practice and also in geophysics. Here, we develop an exact algebraic iterative method to compute the successive time intervals for individual breaking in systems of height $n$ in terms of the information calculated in the previous height $n-1$. As a byproduct of this method, rigorous lower and higher bounds for the time to failure of very large systems are easily obtained. The asymptotic behavior of the resulting lower bound leads to the evidence that the above mentioned suspicion is actually true.Comment: Final version. To appear in Phys. Rev. E, Feb 199

Thermoelectric properties of Zn_5Sb_4In_(2-δ)(δ=0.15)

The polymorphic intermetallic compound Zn_5Sb_4In_(2−δ) (δ = 0.15(3)) shows promising thermoelectric properties at low temperatures, approaching a figure of merit ZT of 0.3 at 300 K. However, thermopower and electrical resistivity changes discontinuously at around 220 K. Measurement of the specific heat locates the previously unknown temperature of the order-disorder phase transition at around 180 K. Investigation of the charge carrier concentration and mobility by Hall measurements and infrared reflection spectroscopy indicate a mixed conduction behavior and the activation of charge carriers at temperatures above 220 K. Zn_5Sb_4In_(2−δ) has a low thermal stability, and at temperatures above 470 K samples decompose into a mixture of Zn, InSb, and Zn_4Sb_3

Probabilistic Approach to Time-Dependent Load-Transfer Models of Fracture

A probabilistic method for solving time-dependent load-transfer models of fracture is developed. It is applicable to any rule of load redistribution, i.e, local, hierarchical, etc. In the new method, the fluctuations are generated during the breaking process (annealed randomness) while in the usual method, the random lifetimes are fixed at the beginning (quenched disorder). Both approaches are equivalent.Comment: 13 pages, 4 figures. To appear in Phys.Rev.

The Universal Cut Function and Type II Metrics

In analogy with classical electromagnetic theory, where one determines the total charge and both electric and magnetic multipole moments of a source from certain surface integrals of the asymptotic (or far) fields, it has been known for many years - from the work of Hermann Bondi - that energy and momentum of gravitational sources could be determined by similar integrals of the asymptotic Weyl tensor. Recently we observed that there were certain overlooked structures, {defined at future null infinity,} that allowed one to determine (or define) further properties of both electromagnetic and gravitating sources. These structures, families of {complex} `slices' or `cuts' of Penrose's null infinity, are referred to as Universal Cut Functions, (UCF). In particular, one can define from these structures a (complex) center of mass (and center of charge) and its equations of motion - with rather surprising consequences. It appears as if these asymptotic structures contain in their imaginary part, a well defined total spin-angular momentum of the source. We apply these ideas to the type II algebraically special metrics, both twisting and twist-free.Comment: 32 page

Observations on computational methodologies for use in large-scale, gradient-based, multidisciplinary design incorporating advanced CFD codes

How a combination of various computational methodologies could reduce the enormous computational costs envisioned in using advanced CFD codes in gradient based optimized multidisciplinary design (MdD) procedures is briefly outlined. Implications of these MdD requirements upon advanced CFD codes are somewhat different than those imposed by a single discipline design. A means for satisfying these MdD requirements for gradient information is presented which appear to permit: (1) some leeway in the CFD solution algorithms which can be used; (2) an extension to 3-D problems; and (3) straightforward use of other computational methodologies. Many of these observations have previously been discussed as possibilities for doing parts of the problem more efficiently; the contribution here is observing how they fit together in a mutually beneficial way

Effects of time window size and placement on the structure of aggregated networks

Complex networks are often constructed by aggregating empirical data over time, such that a link represents the existence of interactions between the endpoint nodes and the link weight represents the intensity of such interactions within the aggregation time window. The resulting networks are then often considered static. More often than not, the aggregation time window is dictated by the availability of data, and the effects of its length on the resulting networks are rarely considered. Here, we address this question by studying the structural features of networks emerging from aggregating empirical data over different time intervals, focussing on networks derived from time-stamped, anonymized mobile telephone call records. Our results show that short aggregation intervals yield networks where strong links associated with dense clusters dominate; the seeds of such clusters or communities become already visible for intervals of around one week. The degree and weight distributions are seen to become stationary around a few days and a few weeks, respectively. An aggregation interval of around 30 days results in the stablest similar networks when consecutive windows are compared. For longer intervals, the effects of weak or random links become increasingly stronger, and the average degree of the network keeps growing even for intervals up to 180 days. The placement of the time window is also seen to affect the outcome: for short windows, different behavioural patterns play a role during weekends and weekdays, and for longer windows it is seen that networks aggregated during holiday periods are significantly different.Comment: 19 pages, 11 figure

Signatures of currency vertices

Many real-world networks have broad degree distributions. For some systems, this means that the functional significance of the vertices is also broadly distributed, in other cases the vertices are equally significant, but in different ways. One example of the latter case is metabolic networks, where the high-degree vertices -- the currency metabolites -- supply the molecular groups to the low-degree metabolites, and the latter are responsible for the higher-order biological function, of vital importance to the organism. In this paper, we propose a generalization of currency metabolites to currency vertices. We investigate the network structural characteristics of such systems, both in model networks and in some empirical systems. In addition to metabolic networks, we find that a network of music collaborations and a network of e-mail exchange could be described by a division of the vertices into currency vertices and others.Comment: to appear in Journal of the Physical Society of Japa