Uncontrolled cell survival, growth, angiogenesis and metastasis are essential hallmarks of cancer. Genetic and biochemical data have demonstrated that the growth and motility factor hepatocyte growth factor/scatter factor (HGF/SF) and its receptor, the tyrosine kinase MET, have a causal role in all of these processes, thus providing a strong rationale for targeting these molecules in cancer. Parallel progress in understanding the structure and function of HGF/SF, MET and associated signalling components has led to the successful development of blocking antibodies and a large number of small-molecule MET kinase inhibitors. In this Review, we discuss these advances, as well as results from recent clinical studies that demonstrate that inhibiting MET signalling in several types of solid human tumours has major therapeutic value.

/pdf/targeting-met-in-cancer-rationale-and-progress-36bsoy3dx8.pdf

Targeting MET in cancer: rationale and progress

* uschian groups of the first kind * Automorphic forms and functions * Hecke operators and the zeta-functions associated with modular forms * Elliptic curves * Abelian extensions of imaginary quadratic fields and complex multiplication of elliptic curves * Modular functions of higher level * Zeta-functions of algebraic curves and abelian varieties * The cohomology group assoicated with cusp forms * Arithmetic Fuschian groups

Introduction to the arithmetic theory of automorphic functions

A challenging goal in materials chemistry and physics is spontaneously to form intended superstructures from designed building blocks. In fields such as crystal engineering and the design of porous materials, this typically involves building blocks of organic molecules, sometimes operating together with metallic ions or clusters. The translation of such ideas to nanoparticles and colloidal-sized building blocks would potentially open doors to new materials and new properties, but the pathways to achieve this goal are still undetermined. Here we show how colloidal spheres can be induced to self-assemble into a complex predetermined colloidal crystal-in this case a colloidal kagome lattice-through decoration of their surfaces with a simple pattern of hydrophobic domains. The building blocks are simple micrometre-sized spheres with interactions (electrostatic repulsion in the middle, hydrophobic attraction at the poles, which we call 'triblock Janus') that are also simple, but the self-assembly of the spheres into an open kagome structure contrasts with previously known close-packed periodic arrangements of spheres. This open network is of interest for several theoretical reasons. With a view to possible enhanced functionality, the resulting lattice structure possesses two families of pores, one that is hydrophobic on the rims of the pores and another that is hydrophilic. This strategy of 'convergent' self-assembly from easily fabricated colloidal building blocks encodes the target supracolloidal architecture, not in localized attractive spots but instead in large redundantly attractive regions, and can be extended to form other supracolloidal networks.

/pdf/directed-self-assembly-of-a-colloidal-kagome-lattice-4w2pk64rbf.pdf

Directed self-assembly of a colloidal kagome lattice

Distance-Regular Graphs

19세기말 애국적 담론과 新小說의 정체성

We study configurations of points on the unit sphere that minimize potential energy for a broad class of potential functions (viewed as functions of the squared Euclidean distance between points). Call a configuration sharp if there are m distances between distinct points in it and it is a spherical (2m-1)-design. We prove that every sharp configuration minimizes potential energy for all completely monotonic potential functions. Examples include the minimal vectors of the E_8 and Leech lattices. We also prove the same result for the vertices of the 600-cell, which do not form a sharp configuration. For most known cases, we prove that they are the unique global minima for energy, as long as the potential function is strictly completely monotonic. For certain potential functions, some of these configurations were previously analyzed by Yudin, Kolushov, and Andreev; we build on their techniques. We also generalize our results to other compact two-point homogeneous spaces, and we conclude with an extension to Euclidean space.

/pdf/universally-optimal-distribution-of-points-on-spheres-292geyxxch.pdf

Universally optimal distribution of points on spheres

Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic packing. In particular, we find an optimal auxiliary function for the linear programming bounds, which is an analogue of Viazovska's function for the eight-dimensional case.

The sphere packing problem in dimension 24

We prove that the Leech lattice is the unique densest lattice in R24. The proof combines human reasoning with computer verification of the properties of certain explicit polynomials. We furthermore prove that no sphere packing in R24 can exceed the Leech lattice's density by a factor of more than 1 + 1.65 10-30, and we give a new proof that Es is the unique densest lattice in R8.

Optimality and uniqueness of the Leech lattice among lattices

We prove that the Leech lattice is the unique densest lattice in R^24. The proof combines human reasoning with computer verification of the properties of certain explicit polynomials. We furthermore prove that no sphere packing in R^24 can exceed the Leech lattice's density by a factor of more than 1+1.65*10^(-30), and we give a new proof that E_8 is the unique densest lattice in R^8.

Abhinav Kumar

Papers

Universally optimal distribution of points on spheres

The sphere packing problem in dimension 24

Universally optimal distribution of points on spheres

Optimality and uniqueness of the Leech lattice among lattices

Optimality and uniqueness of the Leech lattice among lattices