混合范数空间中函数的Taylor系数

本文研究了混合范数空间Ｈ（ｐ，ｑ，ａ）中解析函数ｆ的Ｔａｙｌｏｒ系数，对０＜ｐ≤２，０＜ｑ＜∞，ａ＞０和２≤ｐ＜∞，０＜ｑ＜∞，ａ＞０两种情形，分别给出了ｆ属于Ｈ（ｐ，ｑ，ａ）的必要条件和充分条件。用上述结果我们还得到了几个关于混合范数空间的乘子定理，这些结果也推广了Ｈａｒｄｙ和Ｌｉｔｔｌｅｗｏｏｄ关于Ｈ＾ｐ空间的相应结论。     

高等代数与解析几何一体化教学思考

本探讨了高等代数与解析几何进行一体化教学的必要性，研究了高等代数与解析几何进行一体化教学以后教学内容的协调性与教学手段的合理性，强调了数学实验在高等代数与解析几何一体化教学中的重要性。     

States and Structure of von Neumann Algebras

We summarize and deepen recent results on the interplay between properties of states and the structure of von Neumann algebras. We treat Jauch–Piron states and the concept of independence in noncommutative probability theory.     

Asymptotic expansions of the Hurwitz-Lerch zeta function

The Hurwitz-Lerch zeta function Φ(z,s,a) is considered for large and small values of a∈C, and for large values of z∈C, with |Arg(a)|<π, z∉[1,∞) and s∈C. This function is originally defined as a power series in z, convergent for |z|<1, s∈C and 1−a∉N. An integral representation is obtained for Φ(z,s,a) which define the analytical continuation of the Hurwitz-Lerch zeta function to the cut complex z-plane C?[1,∞). From this integral we derive three complete asymptotic expansions for either large or small a and large z. These expansions are accompanied by error bounds at any order of the approximation. Numerical experiments show that these bounds are very accurate for real values of the asymptotic variables.     

Rigorous results in selection of steady needle crystals

This paper concerns the existence of solutions to a steady needle crystal growth problem in a one-sided model. We rigorously prove that for small nonzero anisotropy γ, analytic symmetric needle crystal solutions exist in the limit of surface tension ε² if only if the stokes constant S for a relatively simple nonlinear differential equation is zero. This Stokes constant S depends on the parameter β=2^9/7γε^−8/7 and earlier numerical calculations by a number of investigators have shown this to be zero for a discrete set of values of β. It is also proven that for γ=0, there can be no symmetric needle crystal solution in the considered space.The methodology consists of two steps. First, the original problem is reduced to a weak half-strip problem for any γ in a compact set of [0,1) by relaxation of the symmetry condition. The weak problem is shown to have a unique solution in the function space considered for any γ∈[0,γ_m] for some γ_m>0. When a symmetry is invoked, the weak problem is shown equivalent to the original needle crystal problem. Next, by considering the behavior of the solution in neighborhood of an appropriate complex turning point for γ∈(0,γ_m], we extract an exponentially small term in ε as ε→0⁺ that generally violates the symmetric condition. We prove that the symmetry condition is satisfied for small ε when the parameter β is constrained appropriately.     

一类广义Lanchester模型的数值解及若干结论

本讨论了一类广义的Lanchester模型在一些限制条件下的近似解，并给出了若干结论。     

Some remarks on indiscernible sequences

We prove a property of generic homogeneity of tuples starting an infinite indiscernible sequence in a simple theory and we use it to give a shorter proof of the Independence Theorem for Lascar strong types. We also characterize the relation of starting an infinite indiscernible sequence in terms of coheirs.     

A Relationship Among Gentzen's Proof-Reduction,Kirby-Paris' Hydra Game and Buchholz's Hydra Game

We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game (Section 1 and Appendix). Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game (which is two-dimensional but without labels), by a simple and natural interpretation (Section 2). Jervell proposed another type of a combinatorial game, by abstracting Gentzen's proof-reductions and showed that his game is independent of PA. We show (Section 3) that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φ_ω (0) (while that of PA or of Kirby-Paris' Game is φ₁ (0) = ?₀) in the Veblen hierarchy of ordinals.     

Martingale property of empirical processes

It is shown that for a large collection of independent martingales, the martingale property is preserved on the empirical processes. Under the assumptions of independence and identical finite-dimensional distributions, it is proved that a large collection of stochastic processes are martingales essentially if and only if the empirical processes are also martingales. These two results have implications on the testability of the martingale property in scientific modeling. Extensions to submartingales and supermartingales are given.

     

Decomposition of multiattribute expected-utility functions

This paper integrates and extends the theory of the decomposition of multiattribute expected-utility functions based on utility independence. In a preliminary section, the standard decision model of expected utility is briefly discussed, including the fact that the decision maker's preference forlotteries with two outcomes determines the utility function uniquely. The decomposition possibilities of a utility function are captured by the concept ofautonomous sets of attributes, an affine separability of some kind known as generalized utility independence.Overlapping autonomous sets lead to biaffine-associative, i.e.multiplicative oradditive decompositions. The multiplicative representation shows that autonomy has strongerclosure properties than utility independence, for instance with respect to set-theoretic difference. Autonomy is also a concept with a wider scope since it applies to the decomposition of Boolean functions, games and a number of other topics in combinatorial optimization. This relationship to the well-known theory ofsubstitution decomposition in discrete mathematics also reveals a kind of discrete core behind the decomposition of utility functions. The entirety of autonomous sets can be represented by a compact data structure, the so-calledcomposition tree, which frequently corresponds to a natural hierarchy of attributes. Multiplicative/additive ormulti-affine functions correspond to the hierarchy steps. The known representation of multi-affine functions is shown to be given by aMoebius inversion formula. The entire approach has the advantage that it allows the application of more sophisticated representation methods on a detailed level, whereas it employs onlyfinite set theory andarithmetic on the main levels in the hierarchy.