(Acetato-κO)bis­(2,2′-bipyridyl-κ2 N,N′)copper(II)–ethyl sulfate–methyl sulfate (1/0.5/0.5)

In the title complex, [Cu(C2H3O2)(C10H8N2)2](CH3CH2OSO3)0.5(CH3OSO3)0.5, the CuII ion is bis-chelated by two 2,2′-bipyridine lignds and coordinated by an O atom of an acetate ligand in a CuN4O disorted square-pyramidal environment. In the structure, equal amounts of methyl sulfate and ethyl sulfate anions are disordered on the same crystallographic sites. The crystal structure is stabilized by weak inter­molecular C—H⋯O inter­actions

PHL 6625: A Minor Merger-Associated QSO Behind NGC 247

PHL 6625 is a luminous quasi-stellar object (QSO) at z = 0.3954 located behind the nearby galaxy NGC 247 (z = 0.0005). Hubble Space Telescope (HST) observations revealed an arc structure associated with it. We report on spectroscopic observations with the Very Large Telescope (VLT) and multiwavelength observations from the radio to the X-ray band for the system, suggesting that PHL 6625 and the arc are a close pair of merging galaxies, instead of a strong gravitational lens system. The QSO host galaxy is estimated to be (4-28) x 10^10 M_sun, and the mass of the companion galaxy of is estimated to be M_* = (6.8 +/- 2.4) x 10^9 M_sun, suggesting that this is a minor merger system. The QSO displays typical broad emission lines, from which a black hole mass of about (2-5) x 10^8 M_sun and an Eddington ratio of about 0.01-0.05 can be inferred. The system represents an interesting and rare case where a QSO is associated with an ongoing minor merger, analogous to Arp 142.Comment: ApJ to appea

Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results

We investigate pseudopolynomial-time algorithms for Bounded Knapsack and Bounded Subset Sum. Recent years have seen a growing interest in settling their fine-grained complexity with respect to various parameters. For Bounded Knapsack, the number of items $n$ and the maximum item weight $w_{\max}$ are two of the most natural parameters that have been studied extensively in the literature. The previous best running time in terms of $n$ and $w_{\max}$ is $O(n + w^3_{\max})$ [Polak, Rohwedder, Wegrzycki '21]. There is a conditional lower bound of $O((n + w_{\max})^{2-o(1)})$ based on $(\min,+)$-convolution hypothesis [Cygan, Mucha, Wegrzycki, Wlodarczyk '17]. We narrow the gap significantly by proposing a $\tilde{O}(n + w^{12/5}_{\max})$-time algorithm. Note that in the regime where $w_{\max} \approx n$, our algorithm runs in $\tilde{O}(n^{12/5})$ time, while all the previous algorithms require $\Omega(n^3)$ time in the worst case. For Bounded Subset Sum, we give two algorithms running in $\tilde{O}(nw_{\max})$ and $\tilde{O}(n + w^{3/2}_{\max})$ time, respectively. These results match the currently best running time for 0-1 Subset Sum. Prior to our work, the best running times (in terms of $n$ and $w_{\max}$) for Bounded Subset Sum is $\tilde{O}(n + w^{5/3}_{\max})$ [Polak, Rohwedder, Wegrzycki '21] and $\tilde{O}(n + \mu_{\max}^{1/2}w_{\max}^{3/2})$ [implied by Bringmann '19 and Bringmann, Wellnitz '21], where $\mu_{\max}$ refers to the maximum multiplicity of item weights

A Nearly Quadratic-Time FPTAS for Knapsack

We investigate polynomial-time approximation schemes for the classic 0-1 knapsack problem. The previous algorithm by Deng, Jin, and Mao (SODA'23) has approximation factor 1 + \eps with running time \widetilde{O}(n + \frac{1}{\eps^{2.2}}). There is a lower Bound of (n + \frac{1}{\eps})^{2-o(1)} conditioned on the hypothesis that $(\min, +)$ has no truly subquadratic algorithm. We close the gap by proposing an approximation scheme that runs in \widetilde{O}(n + \frac{1}{\eps^2}) time

Methylenetetrahydrofolate reductase polymorphism and capecitabine-induced toxicity in patients with gastric cancer

Purpose: To evaluate the effect of methylenetetrahydrofolate reductase (MTHFR) polymorphism on toxicity in gastric cancer (GC) patients treated with capecitabine. Methods: One hundred and twenty-six GC patients were treated with capecitabine in the study. DNA from GC patients was genotyped for MTHFR A1298C using direct sequencing. Toxicity evaluations were graded. Clinical response was assessed. Results: In 87.3 % of the patients, capecitabine toxicity was observed. As for MTHFR A1298C polymorphism, 55.6 % patients who exhibited it were associated with reduced MTHFR activity. MTHFR A1298C was associated with capecitabine-related toxicity (p = 0.008); in addition, MTHFR A1298C was significantly associated with gastrointestinal toxicity (p = 0.026), but not with other types of toxicity. Conclusion: The findings suggest that MTHFR A1298C may be useful for predicting toxicity in GC patients receiving capecitabine treatment, especially gastrointestinal toxicity. Keywords: MTHFR, Polymorphism, Gastric cancer, Toxicit

Bis(2-methoxy­phenolato-κ2 O,O′)copper(II)

In the title compound, [Cu(C7H7O2)2], the asymmetric unit contains one and a half molecules with the central Cu(II) atoms situated on a general position and on a centre of inversion, respectively. Both Cu(II) atoms show a similar slightly distorted square-planar coordination, resulting from four O atoms of two 2-methoxyphenolate anions