Isolation and On‐Line LC/CD Analysis of 3,8″‐Linked Biflavonoids from Gnidia involucrata

Investigation of the methanol extract of the roots of Gnidia involucrata (Thymelaeaceae) led to the isolation and characterization of two new 3,8″‐biflavonoid diastereoisomers, named GB‐4 ( 6a ) and GB‐4a ( 6b ). Their absolute configurations were determined in mixture by on‐line LC/CD measurements, which also allowed the revision of absolute configurations of the biflavanoids GB‐1 and GB‐2, and the configurational assignment of GB‐3.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

A Verified Optimization Technique to Locate Chaotic Regions of Hénon Systems

We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located by the new technique.     

Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs

A two-dimensional framework (G,p) is a graph G = (V,E) together with a map p: V → ℝ². We view (G,p) as a straight line realization of G in ℝ². Two realizations of G are equivalent if the corresponding edges in the two frameworks have the same length. A pair of vertices {u,v} is globally linked in G if %and for all equivalent frameworks (G,q), the distance between the points corresponding to u and v is the same in all pairs of equivalent generic realizations of G. The graph G is globally rigid if all of its pairs of vertices are globally linked. We extend the characterization of globally rigid graphs given by the first two authors [13] by characterizing globally linked pairs in M-connected graphs, an important family of rigid graphs. As a byproduct we simplify the proof of a result of Connelly [6] which is a key step in the characterization of globally rigid graphs. We also determine the number of distinct realizations of an M-connected graph, each of which is equivalent to a given generic realization. Bounds on this number for minimally rigid graphs were obtained by Borcea and Streinu in [3].     

Projectivep-algebras

Presented by R. Freese.     

Avoider-Enforcer games

Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K2n for every q?cn/logn for an appropriate constant c, and the (1,q) Hamilton cycle game on Kn for every q?cnloglogloglogn/lognlogloglogn for an appropriate constant c. We also determine exactly those values of q for which Enforcer can win the (1,q) connectivity game on Kn. This result is quite surprising as it substantially differs from its Maker-Breaker analog. Our method extends easily to improve a result of Lu [X. Lu, A note on biased and non-biased games, Discrete Appl. Math. 60 (1995) 285-291], regarding forcing an opponent to pack many pairwise edge disjoint spanning trees in his graph.     

Dynamics of a pair of coupled nonlinear oscillators

A pair of coupled classical oscillators with a general potential and general form of coupling is investigated. For general potentials, the single-frequency solution is shown to be stable for small excitations. For special potentials, such system remains stable for an arbitrary excitation. In both cases, the stability does not depend on the form of coupling. Transition to the instability regime follows from the way how nonlinear potential entrains the energy transfer between the oscillators. Relation between the existence of multi-frequency quasi-periodic or periodic solutions and the instability of single-frequency ones is discussed.     

Charge-transfer chromatographic study of the interaction of anticancer drugs with acetyl-β-cyclodextrin

The interaction between 23 anticancer drugs and acetyl-β-cyclodextrin (acetyl-β-CD) was studied by reversed-phase charge-transfer thin-layer chromatography and the relative strength of interaction was calculated. Acetyl-β-CD formed inclusion complexes with 16 compounds, the complex always being more hydrophilic than the uncomplexed drug. The inclusion forming capacity of drugs differed considerably according to their chemical structure. The significant linear correlation between the hydrophobicity and specific hydrophobic surface area of anticancer drugs indicated that they can be considered as a homologous series of compounds, however, their chemical structures are highly different.     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003