Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Matthew Hudelson"'
Publikováno v:
Journal of Mathematical Chemistry. 50:2342-2350
Polyhedral representations of the geometric arrangements of atoms and molecules is a pervasive tool in chemistry for understanding chemical bonding and electrostatic interactions. Yet the structural organization within very large systems is often dif
Autor:
Matthew Hudelson
Publikováno v:
Journal of Mathematical Chemistry. 47:219-228
We expand on the work of Hosoya to describe a generalization of continued fractions called “tree expressions.” Each rooted tree will be shown to correspond to a unique tree expression which can be evaluated as a rational number (not necessarily i
Autor:
Chi Chi Peng, Lawrence B. Holder, Matthew Hudelson, Nikhil S. Ketkar, Benjamin J. Waldher, Jeffrey P. Jones, Timothy J. Carlson
Publikováno v:
Journal of Medicinal Chemistry. 51:648-654
Four different models are used to predict whether a compound will bind to 2C9 with a K(i) value of less than 10 microM. A training set of 276 compounds and a diverse validation set of 50 compounds were used to build and assess each model. The modelin
Autor:
Matthew Hudelson, Jeffrey P. Jones
Publikováno v:
Journal of Medicinal Chemistry. 49:4367-4373
A new method, called line-walking recursive partitioning (LWRP), for partitioning diverse structures on the basis of chemical properties that uses only nine descriptors of the shape, polarizability, and charge of the molecule is described. We use a t
Autor:
Duane W. DeTemple, Matthew Hudelson
Publikováno v:
The American Mathematical Monthly. 108:100-114
Autor:
Matthew Hudelson
Publikováno v:
Journal of Combinatorial Theory, Series A. 88(2):297-305
In this paper, we examine the effect of dissecting an n-dimensional simplex using cevians (cross-sections passing through n−1 of the vertices of the simplex). We describe a formula for the number of pieces the simplex is dissected into using a poly
Autor:
Matthew Hudelson
Publikováno v:
Journal of Combinatorial Theory, Series A. 81(2):190-200
In this paper, we explore the following question: Given integersdandk, is it possible to subdivide ad-dimensional cube intoksmallerd-dimensional cubes? In particular, we investigate bounds on the integerc(d) which is the smallest integer for which it