Scaling of particle trajectories on a lattice

The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. On both lattices, for most concentrations of the scatterers the trajectories close exponentially fast. For special critical concentrations infinitely extended trajectories can occur which exhibit a scaling behavior similar to that of the perimeters of percolation clusters.At criticality, in addition to the two critical exponents =15/7 andd _f=7/4 found before, the critical exponent =3/7 appears. This exponent determines structural scaling properties of closed trajectories of finite size when they approach infinity. New scaling behavior was found for the square lattice partially occupied by rotators, indicating a different universality class than that of percolation clusters.Near criticality, in the critical region, two scaling functions were determined numerically:f(x), related to the trajectory length (S) distributionn _s, andh(x), related to the trajectory sizeR _s (gyration radius) distribution, respectively. The scaling functionf(x) is in most cases found to be a symmetric double Gaussian with the same characteristic size exponent =0.433/7 as at criticality, leading to a stretched exponential dependence ofn _S onS, n_Sexp(–S ^6/7). However, for the rotator model on the partially occupied square lattice an alternative scaling function is found, leading to a new exponent =1.6±0.3 and a superexponential dependence ofn _S onS.h(x) is essentially a constant, which depends on the type of lattice and the concentration of the scatterers. The appearance of the same exponent =3/7 at and near a critical point is discussed.     

Shrinkage estimators of the location parameter for certain spherically symmetric distributions

We consider estimation of a location vector for particular subclasses of spherically symmetric distributions in the presence of a known or unknown scale parameter. Specifically, for these spherically symmetric distributions we obtain slightly more general conditions and larger classes of estimators than Brandwein and Strawderman (1991,Ann. Statist.,19, 1639–1650) under which estimators of the formX +ag(X) dominateX for quadratic loss, concave functions of quadratic loss and general quadratic loss.Research supported by NSF grant DMS-88-22622     

Gradient-echo imaging of hemorrhage at 1.5 Tesla

We report in vitro and in vivo MR studies of hemorrhage using the gradient-echo pulse sequence, FISP (steady state free precession) and FLASH (spoiling of transverse magnetization) at 1.5 Tesla. Phantoms containing methemoglobin, ferromagnetic particles, human serum and blood clot were scanned using both spin-echo and gradient-echo techniques. FLASH signal intensities were more sensitive to methemoglobin concentration than high T1-weighted spin-echo images. FISP showed little change in signal intensity with varying concentrations of methemoglobin and a contrast relationship similar to T2-weighted spin-echo techniques. FISP and FLASH showed intensity changes at lower concentrations of ferromagnetic material than T2-weighted spin-echo sequences. In vitro blood clot was less intense when observed by FISP and FLASH sequences than on the T2-weighted spin-echo sequences. Maximum contrast between clot and other blood components occurred at a flip angle of 45 degrees for FLASH and 60 degrees for FISP. FISP and FLASH scans of patients with hemorrhage demonstrated a marked decrease in signal intensity in the region of blood clot. This decrease was more pronounced with the gradient-echo sequences than with T2-weighted spin-echo images. We conclude that FLASH is useful for detecting methemoglobin and that both FISP and FLASH are useful for evaluating hemorrhage because of their sensitivity to methemoglobin.     

A rank-three condition for invariant (1, 2)-symplectic almost Hermitian structures on flag manifolds

This paper considers invariant (1, 2)-symplectic almost Hermitian structures on the maximal flag manifod associated to a complex semi-simple Lie group G. The concept of cone-free invariant almost complex structure is introduced. It involves the rank-three subgroups of G, and generalizes the cone-free property for tournaments related to 𝕊l (n,ℂ) case. It is proved that the cone-free property is necessary for an invariant almost-complex structure to take part in an invariant (1, 2)-symplectic almost Hermitian structure. It is also sufficient if the Lie group is not B _l , l ≥ 3, G ₂ or F ₄. For B _l and F ₄ a close condition turns out to be sufficient. Received: 28 October 2001     

Bivariate factorizations connecting Dickson polynomials and Galois theory

In his Ph.D. Thesis of 1897, Dickson introduced certain permutation polynomials whose Galois groups are essentially the dihedral groups. These are now called Dickson polynomials of the first kind, to distinguish them from their variations introduced by Schur in 1923, which are now called Dickson polynomials of the second kind. In the last few decades there have been extensive investigations of both of these types, which are related to the classical Chebyshev polynomials. We give new bivariate factorizations involving both types of Dickson polynomials. These factorizations demonstrate certain isomorphisms between dihedral groups and orthogonal groups, and lead to the construction of explicit equations with orthogonal groups as Galois groups.

     

All-Pairs Small-Stretch Paths

Let G = (V, E) be a weighted undirected graph. A path between u, v  V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding small-stretch paths between all pairs of vertices in the graph G.It is easy to see that finding paths of stretch less than 2 between all pairs of vertices in an undirected graph with n vertices is at least as hard as the Boolean multiplication of two n × n matrices. We describe three algorithms for finding small-stretch paths between all pairs of vertices in a weighted graph with n vertices and m edges. The first algorithm, STRETCH₂, runs in Õ(n^3/2m^1/2) time and finds stretch 2 paths. The second algorithm, STRETCH_7/3, runs in Õ(n^7/3) time and finds stretch 7/3 paths. Finally, the third algorithm, STRETCH₃, runs in Õ(n²) and finds stretch 3 paths.Our algorithms are simpler, more efficient and more accurate than the previously best algorithms for finding small-stretch paths. Unlike all previous algorithms, our algorithms are not based on the construction of sparse spanners or sparse neighborhood covers.     

Hermite and Smith normal form algorithms over Dedekind domains

We show how the usual algorithms valid over Euclidean domains, such as the Hermite Normal Form, the modular Hermite Normal Form and the Smith Normal Form can be extended to Dedekind rings. In a sequel to this paper, we will explain the use of these algorithms for computing in relative extensions of number fields.

     

Characteristics of Second Graders' Mathematical Writing

This study compared the characteristics of second graders' mathematical writing between an intervention and comparison group. Two six‐week Project M2 units were implemented with students in the intervention group. The units position students to communicate in ways similar to mathematicians, including engaging in verbal discourse where they themselves make sense of the mathematics through discussion and debate, writing about their reasoning on an ongoing basis, and utilizing mathematical vocabulary while communicating in any medium. Students in the comparison group learned from the regular school curriculum. Students in both the intervention and comparison groups conveyed high and low levels of content knowledge as indicated in archived data from an open‐response end‐of‐the‐year assessment. A multivariate analysis of variance indicated several differences favoring the intervention group. Both the high‐ and low‐level intervention subgroups outperformed the comparison group in their ability to (a) provide reasoning, (b) attempt to use formal mathematical vocabulary, and (c) correctly use formal mathematical vocabulary in their writing. The low‐level intervention subgroup also outperformed the respective comparison subgroup in their use of (a) complete sentences and (b) linking words. There were no differences between groups in their attempt at writing and attempts at and usage of informal mathematical vocabulary.     

An international round-robin calibration protocol for nanoindentation measurements

Nanoindentation has become a common technique for measuring the hardness and elastic-plastic properties of materials, including coatings and thin films. In recent years, different nanoindenter instruments have been commercialised and used for this purpose. Each instrument is equipped with its own analysis software for the derivation of the hardness and reduced Young's modulus from the raw data. These data are mostly analysed through the Oliver and Pharr method. In all cases, the calibration of compliance and area function is mandatory. The present work illustrates and describes a calibration procedure and an approach to raw data analysis carried out for six different nanoindentation instruments through several round-robin experiments. Three different indenters were used, Berkovich, cube corner, spherical, and three standardised reference samples were chosen, hard fused quartz, soft polycarbonate, and sapphire. It was clearly shown that the use of these common procedures consistently limited the hardness and reduced the Young's modulus data spread compared to the same measurements performed using instrument-specific procedures. The following recommendations for nanoindentation calibration must be followed: (a) use only sharp indenters, (b) set an upper cut-off value for the penetration depth below which measurements must be considered unreliable, (c) perform nanoindentation measurements with limited thermal drift, (d) ensure that the load-displacement curves are as smooth as possible, (e) perform stiffness measurements specific to each instrument/indenter couple, (f) use Fq and Sa as calibration reference samples for stiffness and area function determination, (g) use a function, rather than a single value, for the stiffness and (h) adopt a unique protocol and software for raw data analysis in order to limit the data spread related to the instruments (i.e. the level of drift or noise, defects of a given probe) and to make the H and E(r) data intercomparable.