Stevenson, Dobriner, and Rhoads (5) reported that p-dimethylaminoazobenzene when fed to rats is decomposed and metabolized to several simpler compounds. One of these split products, N,N-dimethylp-phenylenediamine, has been found by us ( i ) to be toxic to the glandular epithelium of the rat liver at concentrations of o.oooI M, while equivalent effects on the ductal epithelium were produced only...

Gaussian split Ewald (GSE) is a versatile Ewald mesh method that is fast and accurate when used with both real-space and k-space Poisson solvers. While real-space methods are known to be asymptotically superior to k-space methods in terms of both computational cost and parallelization efficiency, k-space methods such as smooth particle-mesh Ewald (SPME) have thus far remained dominant because t...

Let A and B be separable C∗-algebras, A unital and B stable. It is shown that there is a natural six-terms exact sequence which relates the group which arises by considering all semi-split extensions of A by B to the group which arises by restricting the attention to unital semi-split extensions of A by B. The six-terms exact sequence is an unpublished result of G. Skandalis. Let A,B be separab...

The discrete reliability states that the difference of the discrete solutions on two arbitrary levels u` and u`+m with respect to triangulations T` and T`+m is bounded by the contributions of the residual-based error estimator on the refined simplices T` \ T`+m only. After some natural split of the error, the additional difficulty for the nonconforming FEMs is to bound min v`+m∈CR(T`+m) ‖∇NC(u`...

We introduce I/O-effiient certifying algorithms for bipartite graphs, as well the classes of split, threshold, chain, and trivially perfect graphs. When input graph is a member respective class, algorithm returns certificate that characterizes this class. Otherwise, it forbidden induced subgraph non-membership. On with n vertices m edges, our take $$O( {\textsc {sort}(n + m)} ) $$ I/Os in worst...

The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this paper, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two-round game played against an adversary. We show that the techniques used and bounds obtained on the extremal (r,m)-split coloring problem...

We prove that on a generic hypersurface in P of dimension at least 3, a vector bundle with r ≤ m generators must be split if m is odd. If m is even, then the same is true if the degree of X is at least 3.

In this paper, we discuss an extension of split cuts that is based on widening the underlying disjunctions. That the formula for deriving intersection cuts based on splits can be adapted to this case has been known for a decade now. For the first time though, we present applications and computational results. We further discuss extensions of the existing theory with respect to cut strengthening...

We consider the following generalization of split graphs: A graph is said to be a (k, l)-graph if its vertex set can be partitioned into k independent sets and l cliques. (Split graphs are obtained by setting k = l = 1). Much of the appeal of split graphs is due to the fact that they are chordal, a property not shared by (k, l)-graphs in general. (For instance, being a (k, 0)-graph is equivalen...

suppose $g$ is a split connected‎ ‎reductive orthogonal or symplectic group over an infinite field‎ ‎$f,$ $p=mn$ is a maximal parabolic subgroup of $g,$ $frak{n}$ is‎ ‎the lie algebra of the unipotent radical $n.$ under the adjoint‎ ‎action of its stabilizer in $m,$ every maximal prehomogeneous‎ ‎subspaces of $frak{n}$ is determined‎.