On a new class of dynamic Hardy-type inequalities and some related generalizations

Aequationes mathematicae - In this paper, we establish a new class of dynamic inequalities of Hardy’s type which generalize and improve some recent results given in the literature. More...     

Epoxy-silica/clay nanocomposite for silver-based antibacterial thin coatings: structure and ionic mobility

Journal of Solid State Electrochemistry - A novel material was developed using sol-gel chemistry and an environmental-friendly grafting process of clay nanoparticles. In a previous work of our...     

Resolution of Some Open Problems Concerning Multiple Zeta Evaluations of Arbitrary Depth

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst–Zagier formula. Other results we provide settle three of the remaining outstanding conjectures of Borwein, Bradley, and Broadhurst. A complete treatment of a certain arbitrary depth class of periodic alternating unit Euler sums is also given.     

An improved synthesis of rhinocerotinoic acid

The stereoselective synthesis of E-rhinocerotinoic acid has been achieved in five steps from (−)-sclareol in an overall yield of 32%. This constitutes a significant improvement on the previous synthesis of this anti-inflammatory compound.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

Ishihara's proof technique in constructive analysis

Two surprising constructive lemmas of Ishihara, with extremely useful proof techniques, are placed in a general setting. This both clarifies the ideas underlying those lemmas and raises the possibility that some other applications of their proof techniques in constructive analysis are, in fact, corollaries of our general results.     

Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings

Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field.     

Point load determination of static elastic moduli using laser speckle interferometry

Electronic speckle interferometry (ESPI) is used to determine the Young's modulus E and Poisson ratio ν of an isotropic material. Micron scale deformations of the surface of the block of polymethyl-methacrylate (PMMA) are induced by normal application of a known near-point force. These deformations are recorded in speckle interferometric fringe patterns. An iterative minimum error inversion technique is developed to obtain the elastic properties from the positions of fringe peaks and troughs observed in the fringe patterns. Sensitivity tests of the method on calculated fringe patterns using measured experimental uncertainties suggest the technique will provide measures of the elastic moduli to better than 5%. In an experimental test on a bloc of PMMA (acrylic) the technique gave values of E and ν that differed from corresponding measures obtained using more conventional strain-gauge methods by less than 4%.     

Diameter graphs of polygons and the proof of a conjecture of Graham

We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle. We then apply this theorem to prove Graham's 1975 conjecture that the diameter graph of a maximal 2m-gon (m?3) must be a cycle of length 2m−1 with one additional edge attached to it.