A Law of Large Numbers for the Zeroes of Heine–Stieltjes Polynomials

We determine the limiting density of the zeroes of Heine–Stieltjes polynomials (or of any set of points satisfying the conclusion of Heine–Stieltjes Theorem) in the thermodynamic limit and use this to prove a strong law of large numbers for the zeroes.     

Strategic commitment to price to stimulate downstream innovation in a supply chain

It is generally in a firm’s interest for its supply chain partners to invest in innovations. To the extent that these innovations either reduce the partners’ variable costs or stimulate demand for the end product, they will tend to lead to higher levels of output for all of the firms in the chain. However, in response to the innovations of its partners, a firm may have an incentive to opportunistically increase its own prices. The possibility of such opportunistic behavior creates a hold-up problem that leads supply chain partners to underinvest in innovation. Clearly, this hold-up problem could be eliminated by a pre-commitment to price. However, by making an advance commitment to price, a firm sacrifices an important means of responding to demand uncertainty. In this paper we examine the trade-off that is faced when a firm’s channel partner has opportunities to invest in either cost reduction or quality improvement, i.e. demand enhancement. Should it commit to a price in order to encourage innovation, or should it remain flexible in order to respond to demand uncertainty. We discuss several simple wholesale pricing mechanisms with respect to this trade-off.     

基于突变论的林火蔓延分析

在对森林火灾进行能量和质量守恒分析的基础上,把尖点突变模型应用于森林火灾蔓延的预测,使突变理论在 森林火灾的模型中从理论上有了初步的应用。文中计算了林火发生突变时的一些分歧点,分析了林火突变的特点和变化规 律。     

Micromechanisms and Mechanics of Damage and Fracture in Thin Film/Substrate Systems

The purpose of this paper is to review the mechanisms and available theoretical methods for modeling the strength and failure of thin film/substrate systems     

Positive value of information in games

We exhibit a general class of interactive decision situations in which all the agents benefit from more information. This class includes as a special case the classical comparison of statistical experiments à la Blackwell. AMS 2000 Subject Classification:Primary 91A35.The work of Bruno Bassan and Marco Scarsini was partially supported by MIUR-COFIN. The authors express their thanks to Sylvain Sorin for enlightening comments.     

Lattice path combinatorics and asymptotics of multiplicities of weights in tensor powers

We give asymptotic formulas for the multiplicities of weights and irreducible summands in high-tensor powers V_λ^⊗N of an irreducible representation V_λ of a compact connected Lie group G. The weights are allowed to depend on N, and we obtain several regimes of pointwise asymptotics, ranging from a central limit region to a large deviations region. We use a complex steepest descent method that applies to general asymptotic counting problems for lattice paths with steps in a convex polytope.     

Weighted approximation of functions on the real line by Bernstein polynomials

The authors give error estimates, a Voronovskaya-type relation, strong converse results and saturation for the weighted approximation of functions on the real line with Freud weights by Bernstein-type operators.     

有向图上的随机游动

设G=(V,Г)是有向图,G上的随机游动X(G)定义如下:位于某个顶点上的一个粒子将以等概率转移到该顶点的所有后继顶点.令M(j,n)表示随机游动X(G)在前n步内访问顶点j的平均次数,用W(j)表示随机游动X(G)到达顶点j所需要的平均步效.我们对M(j,n)和W(j)的值进行了估计,证明了M(j,n)=O(n),并给出了W(j)的上界.     

New Results on the Queens_n 2 Graph Coloring Problem

For the Queens_n ² graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14.     

Evaluation of quadrature schemes for the discrete ordinates method

After reviewing the presently available quadrature schemes for the discrete ordinates method, the accuracy of different schemes is analyzed and evaluated. It is shown from a comprehensive error analysis that the moment conditions have to satisfied not only for the principal coordinates directions, as it is mostly carried out, but for any arbitrary test direction. Among the schemes with approximately 50 discrete ordinates the DCT-020-2468 quadrature was found to give the best accuracy. The highest accuracy among all schemes is achieved by the LC-11 quadrature which requires 96 discrete ordinates. This scheme is rarely used up to date and deserves more attention for high accuracy predictions.