Modular Synthetic Approach to Carboranyl‒Biomolecules Conjugates

The development of novel, tumor-selective and boron-rich compounds as potential agents for use in boron neutron capture therapy (BNCT) represents a very important field in cancer treatment by radiation therapy. Here, we report the design and synthesis of two promising compounds that combine meta-carborane, a water-soluble monosaccharide and a linking unit, namely glycine or ethylenediamine, for facile coupling with various tumor-selective biomolecules bearing a free amino or carboxylic acid group. In this work, coupling experiments with two selected biomolecules, a coumarin derivative and folic acid, were included. The task of every component in this approach was carefully chosen: the carborane moiety supplies ten boron atoms, which is a tenfold increase in boron content compared to the l-boronophenylalanine (l-BPA) presently used in BNCT; the sugar moiety compensates for the hydrophobic character of the carborane; the linking unit, depending on the chosen biomolecule, acts as the connection between the tumor-selective component and the boron-rich moiety; and the respective tumor-selective biomolecule provides the necessary selectivity. This approach makes it possible to develop a modular and feasible strategy for the synthesis of readily obtainable boron-rich agents with optimized properties for potential applications in BNCT.     

An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

The many proofs of an identity on the norm of oblique projections

Given an oblique projector P on a Hilbert space, i.e., an operator satisfying P ²=P, which is neither null nor the identity, it holds that ||P|| = ||I –P||. This useful equality, while not widely-known, has been proven repeatedly in the literature. Many published proofs are reviewed, and simpler ones are presented.     

关于NA情况下重对数律收敛速度的一般形式

研究了NA序列重对数律收敛速度的一般形式，把Davis和Gut的结果推广到了NA的情形，并使梁汉营等人关于对数律一个结果成为特例；作为推论，得到了关于NA序列重对数律收敛速度的充分条件．     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Analogue of the degree conjecture over function fields

Under a certain assumption, similar to Manin's conjecture, we prove an upper bound on the degree of modular parametrizations of elliptic curves by Drinfeld modular curves, which is the function field analogue of the conjectured bound over the rational numbers.

     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

On Modular Forms Arising from a Differential Equation of Hypergeometric Type

Modular and quasimodular solutions of a specific second order differential equation in the upper-half plane, which originates from a study of supersingular j-invariants in the first author's work with Don Zagier, are given explicitly. Positivity of Fourier coefficients of some of the solutions as well as a characterization of the differential equation are also discussed.