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

Parameterized Directed kk-Chinese Postman Problem and kk Arc-Disjoint Cycles Problem on Euler Digraphs

In the Directed $k$-Chinese Postman Problem ($k$-DCPP), we are given a connected weighted digraph $G$ and asked to find $k$ non-empty closed directed walks covering all arcs of $G$ such that the total weight of the walks is minimum. Gutin, Muciaccia and Yeo (Theor. Comput. Sci. 513 (2013) 124--128) asked for the parameterized complexity of $k$-DCPP when $k$ is the parameter. We prove that the $k$-DCPP is fixed-parameter tractable. We also consider a related problem of finding $k$ arc-disjoint directed cycles in an Euler digraph, parameterized by $k$. Slivkins (ESA 2003) showed that this problem is W[1]-hard for general digraphs. Generalizing another result by Slivkins, we prove that the problem is fixed-parameter tractable for Euler digraphs. The corresponding problem on vertex-disjoint cycles in Euler digraphs remains W[1]-hard even for Euler digraphs

Unchanged content of oxidative enzymes in fast-twitch muscle fibers and V˙O2 kinetics after intensified training in trained cyclists.

PublishedJournal ArticleThe present study examined if high intensity training (HIT) could increase the expression of oxidative enzymes in fast-twitch muscle fibers causing a faster oxygen uptake (V˙O2) response during intense (INT), but not moderate (MOD), exercise and reduce the V˙O2 slow component and muscle metabolic perturbation during INT. Pulmonary V˙O2 kinetics was determined in eight trained male cyclists (V˙O2-max: 59 ± 4 (means ± SD) mL min(-1) kg(-1)) during MOD (205 ± 12 W ~65% V˙O2-max) and INT (286 ± 17 W ~85% V˙O2-max) exercise before and after a 7-week HIT period (30-sec sprints and 4-min intervals) with a 50% reduction in volume. Both before and after HIT the content in fast-twitch fibers of CS (P < 0.05) and COX-4 (P < 0.01) was lower, whereas PFK was higher (P < 0.001) than in slow-twitch fibers. Content of CS, COX-4, and PFK in homogenate and fast-twitch fibers was unchanged with HIT. Maximal activity (μmol g DW(-1) min(-1)) of CS (56 ± 8 post-HIT vs. 59 ± 10 pre-HIT), HAD (27 ± 6 vs. 29 ± 3) and PFK (340 ± 69 vs. 318 ± 105) and the capillary to fiber ratio (2.30 ± 0.16 vs. 2.38 ± 0.20) was unaltered following HIT. V˙O2 kinetics was unchanged with HIT and the speed of the primary response did not differ between MOD and INT. Muscle creatine phosphate was lower (42 ± 15 vs. 66 ± 17 mmol kg DW(-1)) and muscle lactate was higher (40 ± 18 vs. 14 ± 5 mmol kg DW(-1)) at 6 min of INT (P < 0.05) after compared to before HIT. A period of intensified training with a volume reduction did not increase the content of oxidative enzymes in fast-twitch fibers, and did not change V˙O2 kinetics.The study was supported by Team Danmark (Danish Elite Sport Organization)

On vertex coloring without monochromatic triangles

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of classic and parametrized algorithms. Several computational complexity results are also presented, which improve on the previous results found in the literature. We propose the new structural parameter for undirected, simple graphs -- the triangle-free chromatic number $\chi_3$. We bound $\chi_3$ by other known structural parameters. We also present two classes of graphs with interesting coloring properties, that play pivotal role in proving useful observation about our problem. We give/ask several conjectures/questions throughout this paper to encourage new research in the area of graph coloring.Comment: Extended abstrac

On a Tree and a Path with no Geometric Simultaneous Embedding

Two graphs $G_1=(V,E_1)$ and $G_2=(V,E_2)$ admit a geometric simultaneous embedding if there exists a set of points P and a bijection M: P -> V that induce planar straight-line embeddings both for $G_1$ and for $G_2$. While it is known that two caterpillars always admit a geometric simultaneous embedding and that two trees not always admit one, the question about a tree and a path is still open and is often regarded as the most prominent open problem in this area. We answer this question in the negative by providing a counterexample. Additionally, since the counterexample uses disjoint edge sets for the two graphs, we also negatively answer another open question, that is, whether it is possible to simultaneously embed two edge-disjoint trees. As a final result, we study the same problem when some constraints on the tree are imposed. Namely, we show that a tree of depth 2 and a path always admit a geometric simultaneous embedding. In fact, such a strong constraint is not so far from closing the gap with the instances not admitting any solution, as the tree used in our counterexample has depth 4.Comment: 42 pages, 33 figure

Can GPR4 be a potential therapeutic target for COVID-19?

This study was supported in part by the North Carolina COVID-19 Special State Appropriations. Research in the author's laboratory was also supported by a grant from the National Institutes of Health (R15DK109484, to LY).Coronavirus disease 19 (COVID-19), caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), first emerged in late 2019 and has since rapidly become a global pandemic. SARS-CoV-2 infection causes damages to the lung and other organs. The clinical manifestations of COVID-19 range widely from asymptomatic infection, mild respiratory illness to severe pneumonia with respiratory failure and death. Autopsy studies demonstrate that diffuse alveolar damage, inflammatory cell infiltration, edema, proteinaceous exudates, and vascular thromboembolism in the lung as well as extrapulmonary injuries in other organs represent key pathological findings. Herein, we hypothesize that GPR4 plays an integral role in COVID-19 pathophysiology and is a potential therapeutic target for the treatment of COVID-19. GPR4 is a pro-inflammatory G protein-coupled receptor (GPCR) highly expressed in vascular endothelial cells and serves as a “gatekeeper� to regulate endothelium-blood cell interaction and leukocyte infiltration. GPR4 also regulates vascular permeability and tissue edema under inflammatory conditions. Therefore, we hypothesize that GPR4 antagonism can potentially be exploited to mitigate the hyper-inflammatory response, vessel hyper-permeability, pulmonary edema, exudate formation, vascular thromboembolism and tissue injury associated with COVID-19.ECU Open Access Publishing Support Fun

Structural parameterizations for boxicity

The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for every fixed $d \ge 2$. We show that boxicity is fixed-parameter tractable when parameterized by the cluster vertex deletion number of the input graph. This generalizes the result of Adiga et al., that boxicity is fixed-parameter tractable in the vertex cover number. Moreover, we show that boxicity admits an additive $1$-approximation when parameterized by the pathwidth of the input graph. Finally, we provide evidence in favor of a conjecture of Adiga et al. that boxicity remains NP-complete when parameterized by the treewidth.Comment: 19 page

Crystallographic structure of ultrathin Fe films on Cu(100)

We report bcc-like crystal structures in 2-4 ML Fe films grown on fcc Cu(100) using scanning tunneling microscopy. The local bcc structure provides a straightforward explanation for their frequently reported outstanding magnetic properties, i.e., ferromagnetic ordering in all layers with a Curie temperature above 300 K. The non-pseudomorphic structure, which becomes pseudomorphic above 4 ML film thickness is unexpected in terms of conventional rules of thin film growth and stresses the importance of finite thickness effects in ferromagnetic ultrathin films.Comment: 4 pages, 3 figures, RevTeX/LaTeX2.0

Size effect on magnetism of Fe thin films in Fe/Ir superlattices

In ferromagnetic thin films, the Curie temperature variation with the thickness is always considered as continuous when the thickness is varied from $n$ to $n+1$ atomic planes. We show that it is not the case for Fe in Fe/Ir superlattices. For an integer number of atomic planes, a unique magnetic transition is observed by susceptibility measurements, whereas two magnetic transitions are observed for fractional numbers of planes. This behavior is attributed to successive transitions of areas with $n$ and $n+1$ atomic planes, for which the $T_c$'s are not the same. Indeed, the magnetic correlation length is presumably shorter than the average size of the terraces. Monte carlo simulations are performed to support this explanation.Comment: LaTeX file with Revtex, 5 pages, 5 eps figures, to appear in Phys. Rev. Let