A two dimensional, experimental study on the evolution of the detachment and its time-behavior in filled rubber

Summary The detachment of a rubber matrix from a rigid inclusion under monotonic loading and at subsequent relaxation is investigated within two dimensional analysis. Examined are stress–strain experimental data acquired with the help of a test bed equipped with a digital image-acquisition device. The influence of the interfacial bonding strength and the particle size on the detachment process is analyzed. The influence of the interfacial bonding strength is visible in the stress–strain diagram of loading and in the recorded images. The relaxation test reveals no influence of the bonding strength on the stress-relaxation. However, the image analysis indicates a secondary transient creep of the contour of detachment, which depends on the interfacial bonding.     

Densest packings of eleven congruent circles in a circle

In 1969 Pirl provided the densest packings ofn equal circles in a circle forn 10. We will prove the optimality for the packings that were conjectured forn=11. The proof is based on elementary combinatorial and analytical techniques.     

Incomplete idempotent Schröder quasigroups and related packing designs

Summary In this paper it is proved that, for any positive integern 2, 3 (mod 4),n 7, there exists an incomplete idempotent Schröder quasigroup with one hole of size two IISQ(n, 2) except forn = 10. It is also proved that for any positive integern 0, 1 (mod 4), there exists an idempotent Schröder quasigroup ISQ(n) except forn = 5 and 9. These results completely determine the spectrum of ISQ(n) and provide an application to the packing of a class of edge-coloured block designs.Research supported by NSERC grant A-5320.Research supported by NSFC grant 19231060-2.     

Self-intersections of curves on surfaces

Let M be a compact orientable surface with nonempty boundary (x(M)<0) and fundamental group . Let be a geodesic on M (with a fixed hyperbolic structure), and let W be a (cyclically reduced) word in a fixed set of generators of which represents . In this paper, we give an algorithm to count the number of self-intersections of in terms of W, generalizing a result of Birman and Series, where an algorithm was given to decide if was simple. Some applications of the algorithm to surfaces with one boundary and the Markoff spectrum are also given.     

Counterexamples in optimal quadrature

It is widely believed that order of exactness is a good measure of the quality of an algorithm for numerical quadrature. We show that this is not the case, by exhibiting a situation in which the optimal algorithm does not even integrate constants exactly. We also show that there are situations in which the penalty for using equidistant nodes is unbounded. Finally, we show that the complexity of obtaining an -approximation can be an arbitrary function of , i.e., there is no hardest quadrature problem.     

Characterization of the normal distribution by constant regression of quadratic statistics on linear statistics

This paper contains applications of theorems of [1] for quadratic statistics which have constant regression on linear statistics. Two theorems are proved. The first is a sufficient condition which assumes that the characteristic function of a sample is an entire function. The second gives a new characterization of the normal distribution.     

Sur la forme canonique des formes extérieures

Sans résumé

---

The article is the text of a talk given at the Symposium on Differential Geometry in Debrecen, Hungary, on August 28–September 3, 1975.     

Factorial regular representation of groups in complete graphs

A necessary and sufficient condition for the group of isomorphisms involved in a factorization of a complete graph into isomorphic factors is established.     

On bounds for the range of ordered variates II

Letx ₁, ,x _n be real numbers with ₁ ⁿ x _j =0, |x ₁ ||x ₂ ||x _n |, and ₁ ⁿ f(|x _i |)=A>0, wheref is a continuous, strictly increasing function on [0, ) withf(0)=0. Using a generalized Chebycheff inequality (or directly) it is easy to see that an upper bound for |x _m | isf ^–1 (A/(n–m+1)). If (n–m+1) is even, this bound is best possible, but not otherwise. Best upper bounds are obtained in case (n–m+1) is odd provided either (i)f is strictly convex on [0, ), or (ii)f is strictly concave on [0, ). Explicit best bounds are given as examples of (i) and (ii), namely the casesf(x)=x ^p forp>1 and 0<p<1 respectively.