Global existence of analytic solutions to the Cauchy problem in a complex domain

We present results on the global existence of analytic solutions to the Cauchy problem in starshaped or convex complex domains. No growth conditions are imposed. Our results rely on a notion of solution-tube that we introduce. à la mémoire de Jean Leray     

Chemical Constituents of Ligusticum sinensis Oliv.

The new phenylpropanoid diglycoside ligusinenoside A ( 1 ), and the two new 8,4′‐oxyneolignan(‘8‐O‐4′‐neolignan’) diglycosides ligusinenosides B ( 2 ) and C ( 3 ), together with nine known compounds, were isolated from the rhizomes of Ligusticum sinensis Oliv. The structures of 1 – 3 were elucidated on the basis of spectroscopic analyses.     

Unions of three starshaped sets in R2

LetS be a compact, simply connected set inR ². If every boundary point ofS is clearly visible viaS from at least one of the three pointsa, b, c, thenS is a union of three starshaped sets whose kernels containa, b, c, respectively. The result fails when the number three is replaced by four.As a partial converse, ifS is a union of three starshaped sets whose kernels containa, b, c, respectively, then the set of points in the boundary ofS clearly visible from at least one ofa, b, orc is dense in the boundary ofS.Supported in part by NSF grant DMS-8705336.     

Optimal Control in Heterogeneous Domain Decomposition Methods for Advection-Diffusion Equations

New domain decomposition methods (DDM) based on optimal control approach are introduced for the coupling of first and second order equations on overlapping subdomains. Several cost functionals and control functions are proposed. Uniqueness and existence results are proved for the coupled problem, and the convergence of iterative processes is analyzed. The work was supported by the Russian Foundation for Basic Research (04-01-00615) and it was partly carried out while the first author was visiting the IACS at EPFL.     

Resolvability properties via independent families

The authors give a consistent affirmative response to a question of Juhász, Soukup and Szentmiklóssy: If GCH fails, there are (many) extraresolvable, not maximally resolvable Tychonoff spaces. They show also in ZFC that for ω<λ?κ, no maximal λ-independent family of λ-partitions of κ is ω-resolvable. In topological language, that theorem translates to this: A dense, ω-resolvable subset of a space of the form (DI(λ)) is λ-resolvable.     

Chromatic polynomial, q-binomial counting and colored Jones function

We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh.     

Simplifying equations in Arabic algebra

Historians have always seen jabr (restoration) and muqābala (confrontation) as technical terms for specific operations in Arabic algebra. This assumption clashes with the fact that the words were used in a variety of contexts. By examining the different uses of jabr, muqābala, ikmāl (completion), and radd (returning) in the worked-out problems of several medieval mathematics texts, we show that they are really nontechnical words used to name the immediate goals of particular steps. We also find that the phrase al-jabr wa'l-muqābala was first used within the solutions of problems to mean al-jabr and/or al-muqābala, and from there it became the name of the art of algebra.     

Almost sure estimates for the concentration neighborhood of Sinai’s walk

We consider Sinai’s random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is bounded almost surely. We also get that i.o. the maximal distance between two favorite sites is bounded almost surely.     

Some new topological cardinal inequalities

In this paper we make use of the Pol-Šapirovski?'s technique to prove several cardinal inequalities, which generalize other well-known inequalities.     

A Note on Log-Convexity of q-Catalan Numbers

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q = 1, to the Catalan numbers: 1, 1, 2, 5, 14,…, a log-convex sequence. We use a combinatorial interpretation of these polynomials to prove a q-log-convexity result. The sequence of q-Catalan numbers is not q-log-convex in the narrow sense used by other authors, so our work suggests a more flexible definition of q-log convex be adopted. Received January 2, 2007