Random Walks And The Colored Jones Function

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords. Electronic supplementary material to this article is available at and is accessible to authorized users. * S. G. was partially supported by an NSF and by an Israel-US BSF grant. † M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education.     

A gas-kinetic scheme for shallow-water equations with source terms

In this paper, the Kinetic Flux Vector Splitting (KFVS) scheme is extended to solving the shallow water equations with source terms. To develop a well-balanced scheme between the source term and the flow convection, the source term effect is accounted in the flux evaluation across cell interfaces. This leads to a modified gas-kinetic scheme with particular application to the shallow water equations with bottom topography. Numerical experiments show better resolution of the unsteady solution than conventional finite difference method and KFVS method with little additional cost. Moreover, some positivity properties of the gas-kinetic scheme is established.     

S[a,b]类中边界Nevanlinna-Pick插值(Ⅱ)

继续作者最近的研究,用所谓的Hankel向量方法建立S[a,b]函数类中带边界插值数据的Nevanlinna-Pick插值问题与[a,b]上的某种带约束条件的Hausdorff矩量问题之间解集之间明确的一一对应关系.通过N[a,b]函数类与S[a,b]函数类之间的联系,从而由BNP(N[a,b])问题的可解性准则和解的参数化描述获得BNP(S[a,b)问题的可解性准则和解的参数化表示.     

A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

A new preconditioned conjugate gradient (PCG)-based domain decomposition method is given for the solution of linear equations arising in the finite element method applied to the elliptic Neumann problem. The novelty of the proposed method is in the recommended preconditioner which is constructed by using cyclic matrix. The resulting preconditioned algorithms are well suited to parallel computation.     

Reliability and expectation bounds for coherent systems with exchangeable components

Sharp upper and lower bounds are obtained for the reliability functions and the expectations of lifetimes of coherent systems based on dependent exchangeable absolutely continuous components with a given marginal distribution function, by use of the concept of Samaniego's signature. We first show that the distribution of any coherent system based on exchangeable components with absolutely continuous joint distribution is a convex combination of distributions of order statistics (equivalent to the k-out-of-n systems) with the weights identical with the values of the Samaniego signature of the system. This extends the Samaniego representation valid for the case of independent and identically distributed components. Combining the representation with optimal bounds on linear combinations of distribution functions of order statistics from dependent identically distributed samples, we derive the corresponding reliability and expectation bounds, dependent on the signature of the system and marginal distribution of dependent components. We also present the sequences of exchangeable absolutely continuous joint distributions of components which attain the bounds in limit. As an application, we obtain the reliability bounds for all the coherent systems with three and four exchangeable components, expressed in terms of the parent marginal reliability function and specify the respective expectation bounds for exchangeable exponential components, comparing them with the lifetime expectations of systems with independent and identically distributed exponential components.     

Amine‐blocked polyisocyanates. I. Synthesis of novel N‐methylaniline‐blocked polyisocyanates and deblocking studies using hot‐stage fourier transform infrared spectroscopy

A series of substituted N‐methylaniline‐blocked polyisocyanates based on 4,4′‐methylenebis(phenyl isocyanate) and poly(tetrahydrofuran) were prepared and characterized thoroughly with FTIR, ¹H NMR, and ¹³C NMR spectroscopy methods. Compared with unsubstituted N‐methylaniline, a blocking agent with an electron‐releasing substituent at the para position took a shorter time, whereas those with an electron‐releasing substituent at the ortho position or an electron‐withdrawing substituent at the ortho and para positions took longer times for the blocking reaction. The thermal dissociation reactions of blocked polyisocyanates were carried out with an FTIR spectrophotometer attached to hot‐stage accessories under dynamic and isothermal conditions. The dynamic method was used to determine the deblocking temperature, and the isothermal method was used to calculate the deblocking kinetics and activation parameters. The cure times of blocked polyisocyanates with hydroxyl‐terminated polybutadiene were also determined. The deblocking temperatures, the results of cure‐time studies, and the kinetic parameters revealed that the thermal dissociation of the N‐methylaniline‐blocked polyisocyanates was retarded by electron‐donating substituents and facilitated by electron‐withdrawing substituents. The action of N‐methylanilines as blocking agents for isocyanate was explained by the formation of a four‐center, intramolecularly hydrogen‐bonded ring structure during the thermal dissociation of the blocked polyisocyanates. The formation of such a hydrogen‐bonded ring structure was confirmed and supported by variable‐temperature ¹H NMR studies and entropy parameters, respectively. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1557–1570, 2007     

Equivariant fixed-point indices of iterated maps

We describe an equivariant version (for actions of a finite group G) of Dold’s index theory, [10], for iterated maps. Equivariant Dold indices are defined, in general, for a G-map U → X defined on an open G-subset of a G-ANR X (and satisfying a suitable compactness condition). A local index for isolated fixed-points is introduced, and the theorem of Shub and Sullivan on the vanishing of all but finitely many Dold indices for a continuously differentiable map is extended to the equivariant case. Homotopy Dold indices, arising from the equivariant Reidemeister trace, are also considered.      

A fictitious domain approach to the numerical solution of PDEs in stochastic domains

We present an efficient method for the numerical realization of elliptic PDEs in domains depending on random variables. Domains are bounded, and have finite fluctuations. The key feature is the combination of a fictitious domain approach and a polynomial chaos expansion. The PDE is solved in a larger, fixed domain (the fictitious domain), with the original boundary condition enforced via a Lagrange multiplier acting on a random manifold inside the new domain. A (generalized) Wiener expansion is invoked to convert such a stochastic problem into a deterministic one, depending on an extra set of real variables (the stochastic variables). Discretization is accomplished by standard mixed finite elements in the physical variables and a Galerkin projection method with numerical integration (which coincides with a collocation scheme) in the stochastic variables. A stability and convergence analysis of the method, as well as numerical results, are provided. The convergence is “spectral” in the polynomial chaos order, in any subdomain which does not contain the random boundaries.     

A p-version finite element method for nonlinear elliptic variational inequalities in 2D

This article introduces and analyzes a p-version FEM for variational inequalities resulting from obstacle problems for some quasi-linear elliptic partial differential operators. We approximate the solution by controlling the obstacle condition in images of the Gauss–Lobatto points. We show existence and uniqueness for the discrete solution u _p from the p-version for the obstacle problem. We prove the convergence of u _p towards the solution with respect to the energy norm, and assuming some additional regularity for the solution we derive an a priori error estimate. In numerical experiments the p-version turns out to be superior to the h-version concerning the convergence rate and the number of unknowns needed to achieve a certain exactness of the approximation.     

Primes in quadratic progressions on average

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.