Iridium Corroles Exhibit Weak Near-Infrared Phosphorescence but Efficiently Sensitize Singlet Oxygen Formation.

Six-coordinate iridium(III) triarylcorrole derivatives, Ir[TpXPC)]L2, where TpXPC = tris(para-X-phenyl)corrole (X = CF3, H, Me, and OCH3) and L = pyridine (py), trimethylamine (tma), isoquinoline (isoq), 4-dimethylaminopyridine (dmap), and 4-picolinic acid (4pa), have been examined, with a view to identifying axial ligands most conducive to near-infrared phosphorescence. Disappointingly, the phosphorescence quantum yield invariably turned out to be very low, about 0.02 - 0.04% at ambient temperature, with about a two-fold increase at 77 K. Phosphorescence decay times were found to be around ~5 µs at 295 K and ~10 µs at 77 K. Fortunately, two of the Ir[TpCF3PC)]L2 derivatives, which were tested for their ability to sensitize singlet oxygen formation, were found to do so efficiently with quantum yields Φ(1O2) = 0.71 and 0.38 for L = py and 4pa, respectively. Iridium corroles thus may hold promise as photosensitizers in photodynamic therapy (PDT). The possibility of varying the axial ligand and of attaching biotargeting groups at the axial positions makes iridium corroles particularly exciting as PDT drug candidates

BIOMECHANICAL PROFILE OF SOCCER GOALKEEPERS

Although the soccer goalkeeper often plays a decisive role in the outcome of a match, research on the goalkeeper’s actions or the qualities required of a top class goalkeeper is scarce. With this study we attempted to define a biomechanical profile of the goalkeeper. We tested whether the skill level of 6 goalkeepers, determined by the league they played in, correlated with a number of biomechanical tests. The tests were devised as standardized measurements of typical goalkeeper actions; they comprised various jumps, a short sprint and a leg strength measurement. We found no correlation between the goalkeepers’ skill level and their score in any of the tests. Thus, with reservation for the limited number of subjects, we conclude that the measured biomechanical parameters are of minor importance compared to skills as tactical understanding, perception and anticipation

Two-Dimensional Bosonization from Variable Shifts in the Path Integral

A method to perform bosonization of a fermionic theory in (1+1) dimensions in a path integral framework is developed. The method relies exclusively on the path integral property of allowing variable shifts, and does not depend on the explicit form of Greens functions. Two examples, the Schwinger model and the massless Thirring model, are worked out.Comment: 4 page

Hamiltonicity of 3-arc graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two arcs $uv, xy$ are adjacent if and only if $(v,u,x,y)$ is a 3-arc of $G$. In this paper we prove that any connected 3-arc graph is Hamiltonian, and all iterative 3-arc graphs of any connected graph of minimum degree at least three are Hamiltonian. As a consequence we obtain that if a vertex-transitive graph is isomorphic to the 3-arc graph of a connected arc-transitive graph of degree at least three, then it is Hamiltonian. This confirms the well known conjecture, that all vertex-transitive graphs with finitely many exceptions are Hamiltonian, for a large family of vertex-transitive graphs. We also prove that if a graph with at least four vertices is Hamilton-connected, then so are its iterative 3-arc graphs.Comment: in press Graphs and Combinatorics, 201

Straight-line Drawability of a Planar Graph Plus an Edge

We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The characterization enables a linear-time testing algorithm to determine whether an almost-planar graph admits a straight-line drawing, and a linear-time drawing algorithm that constructs such a drawing, if it exists. We also show that some almost-planar graphs require exponential area for a straight-line drawing

Introduction to the Special Issue on Liminal Hotspots

This article introduces a special issue of Theory and Psychology on liminal hotspots. A liminal hotspot is an occasion during which people feel they are caught suspended in the circumstances of a transition that has become permanent. The liminal experiences of ambiguity and uncertainty that are typically at play in transitional circumstances acquire an enduring quality that can be described as a “hotspot”. Liminal hotspots are characterized by dynamics of paradox, paralysis, and polarization, but they also intensify the potential for pattern shift. The origins of the concept are described followed by an overview of the contributions to this special issue

Placing regenerators in optical networks to satisfy multiple sets of requests.

The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [10], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d,p ≥ 2 it does not admit a PTASUnknown control sequence '\textsc', even if G has maximum degree at most 3 and the lightpaths have length O(d)(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln (d ·p). We then study the case where G is a path, proving that the problem is NP-hard for any d,p ≥ 2, even if there are two edges of the path such that any lightpath uses at least one of them. Interestingly, we show that the problem is polynomial-time solvable in paths when all the lightpaths share the first edge of the path, as well as when the number of lightpaths sharing an edge is bounded. Finally, we generalize our model in two natural directions, which allows us to capture the model of [10] as a particular case, and we settle some questions that were left open in [10]