Consequence for Wavefunction Collapse Model of the Sudbury Neutrino Observatory Experiment

It is shown that data on the dissociation rate of deuterium obtained in an experiment at the Sudbury Neutrino Observatory provides evidence that the Continuous Spontaneous Localization wavefunction collapse model should have mass–proportional coupling to be viable.     

Second harmonic generation and polar order in thin films of polyesters

A series of optically active main chain polyesters were synthesized by high temperature polycondensation from biphenolic azo chromophores with azobenzene-4,4'-dicarbonylchloride and 1,4:3,6-dianhydro-D-sorbitol ([!]_D²⁵=+42.5°). The second harmonic generation of the polyesters is studied in thin films. The polar order in films is determined from the UV-visible absorption spectra. The variation in SHG intensity with chiral monomer concentration is explained as a function of polar order. The polymers with chiral units showed good second harmonic efficiency. The intensity of second harmonic light (532 nm) increased with angle of incidence and indicated the polar order in the plane of the film. The SH signal also showed good temporal stability.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Corner spontaneous magnetization

Details are given of a new method allowing an exact calculation of the spontaneous magnetization in the corner as well as along the edge at an arbitrary distance of the corner for a rectangular planar Ising ferromagnet.     

Mixed methods on quadrilaterals and hexahedra

We describe a new family of discrete spaces suitable for use with mixed methods on certain quadrilateral and hexahedral meshes. The new spaces are natural in the sense of differential geometry, so all the usual mixed method theory, including the hybrid formulation, carries over to these new elements with proofs unchanged. Because transforming general quadrilaterals into squares introduces nonlinearity and because mixed methods involve the divergence operator, the new spaces are more complicated than either the corresponding Raviart-Thomas spaces for rectangles or corresponding finite element spaces for quadrilaterals. The new spaces are also limited to meshes obtained from a rectangular mesh through the application of a single global bilinear transformation. Despite this limitation, the new elements may be useful in certain topologically regular problems, where initially rectangular grids are deformed to match features of the physical region. They also illustrate the difficulties introduced into the theory of mixed methods by nonlinear transformations.     

A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.     

On the local structure of doubly laced crystals

Let g be a Lie algebra all of whose regular subalgebras of rank 2 are type A₁×A₁, A₂, or C₂, and let B be a crystal graph corresponding to a representation of g. We explicitly describe the local structure of B, confirming a conjecture of Stembridge.     

The harmonic consistency index for the analytic hierarchy process

A new consistency measure, the harmonic consistency index, is obtained for any positive reciprocal matrix in the analytic hierarchy process. We show how this index varies with changes in any matrix element. A tight upper bound is provided for this new consistency measure when the entries of matrix are at most 9, as is often recommended. Using simulation, the harmonic consistency index is shown to give numerical values similar to the standard consistency index but it is easier to compute and interpret. In addition, new properties of the column sums of reciprocal matrices are obtained.