Aging in subdiffusion generated by a deterministic dynamical system

We investigate aging behavior in a simple dynamical system: a nonlinear map which generates subdiffusion deterministically. Asymptotic behaviors of the diffusion process are described using aging continuous time random walks. We show how these processes are described by an aging diffusion equation which is of fractional order. Our work demonstrates that aging behavior can be found in deterministic low dimensional dynamical systems.     

Load-absorption by a discontinuous filament in a fiber-reinforced composite

Zusammenfassung Diese Arbeit befasst sich analytisch mit der statischen Kraftübertragung auf eine einzelne unendliche, elastische Faser, die an einem Querschnitt unterbroche ist. Die Faser ist vollständig in einem unendlich ausgedehnten Körper von anderen elastischen Eigenschaften eingebettet. Der Körper selbst ist im Unendlichen einer einachsigen Zugspannung parallel zur Faser ausgesetzt. Die Charakterisierung der gesuchten Faserkraft wird durch eine schon früher erprobte Annäherungsmethode auf eine Fredholmsche Integralgleichung zweiter Art zurückgeführt und die letztere wird auf numerischem Wege gelöst. Die Verteilung der Faserkraft ist für verschiedene Werte des Verhältnisses der beiden Elastizitätsmodulen dargestellt.

---

---

The results communicated in this paper were obtained in the course of an investigation conducted under Contract N00014-67-A-0094-0020 with the Office of Naval Research in Washington, D.C.     

Bijective proofs of two broken circuit theorems

We prove, by means of explicit bijections, theorems of Whitney and Stanley that express the coefficients of the chromatic polynomial of a graph G and the number of acyclic orientations of G in terms of numbers of sets of edges that contain no broken circuits of G.     

Randomized broadcast in networks

In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.     

Relative weak mixing is generic

A classical result of Halmos asserts that among measure preserving transformations the weak mixing property is generic. We extend Halmos' result to the collection of ergolic extensions of a fixed, but arbitrary,aperiodic transformation T_0. We then use a result of Ornstein and Weiss to extend this relative theorem to the general(countable) amenable group.     

Orthogonal polynomials for exponential weights on

Let I=[0,d), where d is finite or infinite. Let , where and Q is continuous and increasing on I, with limit ∞ at d. We study the orthonormal polynomials associated with the weight , obtaining bounds on the orthonormal polynomials, zeros, and Christoffel functions. In addition, we obtain restricted range inequalities.     

The Max-Flow Min-Cut theorem for countable networks

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does not contain infinite trails then this flow can be chosen to be mundane, i.e. to be a sum of flows along finite paths. We show that in the presence of infinite trails there may be no orthogonal pair of a cut and a mundane flow. We finally show that for locally finite networks there is an orthogonal pair of a cut and a flow that satisfies Kirchhoff's first law also for ends.     

Intersection of Isomorphic Linear Codes

Given an (n, k) linear code over GF(q), the intersection of with a codeπ( ), whereπS_n, is an (n, k₁) code, where max{0, 2k−n}k₁k. The intersection problem is to determine which integers in this range are attainable for a given code . We show that, depending on the structure of the generator matrix of the code, some of the values in this range are attainable. As a consequence we give a complete solution to the intersection problem for most of the interesting linear codes, e.g. cyclic codes, Reed–Muller codes, and most MDS codes.