Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

David Hull

Journal of Optimization Theory and Applications -     

A new family of proximity graphs: Class cover catch digraphs

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.     

Activity of microemulsion-based nanoparticles at the human bio-nano interface: concentration-dependent effects on thrombosis and hemolysis in whole blood

Background: Although microemulsion-based nanoparticles (MEs) may be useful for drug delivery or scavenging, these benefits must be balanced against potential nanotoxicological effects in biological tissue (bio-nano interface). We investigated the actions of assembled MEs and their individual components at the bio-nano interface of thrombosis and hemolysis in human blood. Methods: Oil-in-water MEs were synthesized using ethylbutyrate, sodium caprylate, and pluronic F-68 (ME4) or F-127 (ME6) in 0.9% NaCl_w/v. The effects of MEs or components on thrombosis were determined using thrombo-elastography, platelet contractile force, clot elastic modulus, and platelet counting. For hemolysis, ME or components were incubated with erythrocytes, centrifuged, and washed for measurement of free hemoglobin by spectroscopy. Results and conclusions: The mean particle diameters (polydispersity index) for ME6 and ME4 were 23.6 ± 2.5 nm (0.362) and 14.0 ± 1.0 nm (0.008), respectively. MEs (0, 0.03, 0.3, 3 mM) markedly reduced the thromboelastograph maximal amplitude in a concentration-dependent manner (49.0 ± 4.2, 39.0 ± 5.6, 15.0 ± 8.7, 3.8 ± 1.3 mm, respectively), an effect highly correlated (r2 = 0.94) with similar changes caused by pluronic surfactants (48.7 ± 10.9, 30.7 ± 15.8, 20.0 ± 11.3, 2.0 ± 0.5) alone. Neither oil nor sodium caprylate alone affected the thromboelastograph. The clot contractile force was reduced by ME (27.3 ± 11.1–6.7 ± 3.4 kdynes/cm², P = 0.02, n = 5) whereas the platelet population not affected (175 ± 28–182 ± 23 10⁶/ml, P = 0.12, n = 6). This data suggests that MEs reduced platelet activity due to associated pluronic surfactants, but caused minimal changes in protein function necessary for coagulation. Although pharmacological concentrations of sodium caprylate caused hemolysis (EC₅₀ = 213 mM), MEs and pluronic surfactants did not disrupt erythrocytes. Knowledge of nanoparticle activity and potential associated nanotoxicity at this bio-nano interface enables rational ME design for in vivo applications.     

Ein neues nichtmetallisches Element

Ohne Zusammenfassung     

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms

We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6].