Differentiability of the Value Function of Nonclassical Optimal Growth Models

We consider an optimal growth (multi-sector) model with nonconvex technology. Using the Clarke results on generalized gradients, we prove that the value function has left and right derivatives with respect to the initial capital stock, without requiring supermodularity assumptions.     

Concerning the multiplicators of Fourier series in the trigonometric system

In this paper we prove theorems on multiplicators of Fourier series inL _p, where the conditions depend on a parameterp. An example illustrating the importance of these conditions is constructed. Translated fromMatematicheskie Zametki, Vol. 63, No. 2, pp. 235–247, February, 1998.     

Inverse filtering

Inverse filtering is a noninvasive method of producing a glottogram thought to reflect the vibratory motions of the vocal fold. The flow glottogram provides information related to the type of phonation, the sound pressure level, the regularity of vocal fold vibrations, and to the presence or absence of vocal fold closure. Limited data, speech samples, filter tuning, and lack of unanimity on waveform display and interpretation have contributed to slow application of the techniques to the clinical population. The author argues the technique has utility in both diagnosis and treatment     

Comment on “The Free Will Theorem”

In a recent paper Conway and Kochen, Found. Phys. 36, 2006, claim to have established that theories of the Ghirardi-Rimini-Weber (RW) type, i.e., of spontaneous wave function collapse, cannot be made relativistic. On the other hand, relativistic GRW-type theories have already been presented, in my recent paper, J. Stat. Phys. 125, 2006, and by Dowker and Henson, J. Stat. Phys. 115, 2004. Here, I elucidate why these are not excluded by the arguments of Conway and Kochen.      

代数体函数的定理

本文定义并研究了代数体函数的加法．结合杨乐的方法,将仪洪勋联系重值的亚纯函数唯一性定理推广到多值的代数体函数．     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.     

~ Transform Demonstration of Dark Soliton Solutions Found by Inverse Scattering

One of the basic problems about the inverse scattering transform for solving a completely integrable nonlinear evolutions equation is to demonstrate that the Jost solutions obtained from the inverse scattering equations of Cauchy integral satisfy the Lax equations. Such a basic problem still exists in the procedure of deriving the dark soliton solutions of the NLS equation in normal dispersion with non-vanishing boundary conditions through the inverse scattering transform. In this paper, a pair of Jost solutions with same analytic properties are composed to be a 2 × 2 matrix and then another pair are introduced to be its right inverse confirmed by the Liouville theorem. As they are both 2 × 2 matrices, the right inverse should be the left inverse too, based upon which it is not difficult to show that these Jost solutions satisfy both the first and second Lax equations. As a result of compatibility condition, the dark soliton solutions definitely satisfy the NLS equation in normal dispersion with non-vanishing boundary conditions.     

Enumeration of inequivalent irreducible Goppa codes

We consider irreducible Goppa codes over F_q of length qⁿ defined by polynomials of degree r, where q is a prime power and n,r are arbitrary positive integers. We obtain an upper bound on the number of such codes.