Second Order Nonlinear Evolution Inclusions Ⅰ： Existence and Relaxation Results

This is the first part of a work on second order nonlinear, nonmonotone evolution inclusions defined in the framework of an evolution triple of spaces and with a multivalued nonlinearity depending on both x（t） and x（t）. In this first part we prove existence and relaxation theorems. We consider the case of an usc, convex valued nonlinearity and we show that for this problem the solution set is nonempty and compact in C^1 （T, H）. Also we examine the Isc, nonconvex case and again we prove the existence of solutions. In addition we establish the existence of extremal solutions and by strengthening our hypotheses, we show that the extremal solutions are dense in C^1 （T, H） to the solutions of the original convex problem （strong relaxation）. An example of a nonlinear hyperbolic optimal control problem is also discussed.     

Nonlinear Time Series Analysis Since 1990:Some Personal Reflections

Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series.     

On exactness and isoperimetric profiles of discrete groups

We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

Embedding partial Steiner triple systems so that their automorphisms extend

It is shown that there is a function g on the natural numbers such that a partial Steiner triple system U on u points can be embedded in a Steiner triple system V on ν points, in such a way that all automorphisms of U can be extended to V, for every admissible ν satisfying ν > g(u). We find exponential upper and lower bounds for g. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

The Module Structure Theorem for Sobolev Spaces on Open Manifolds

We prove a general embedding theorem for Sobolev spaces on open manifolds of bounded geometry and infer from this the module structure theorem. Thereafter we apply this to weighted Sobolev spaces.     

The combinatorial game Nofil played on Steiner triple systems

We introduce an impartial combinatorial game on Steiner triple systems called Next One to Fill Is the Loser (Nofil ). Players move alternately, choosing points of the triple system. If a player is forced to fill a block on their turn, they lose. By computing nim-values, we determine optimal strategies for Nofil on all Steiner triple systems up to order 15 and a sampling for orders 19, 21 and 25. The game Nofil can be thought of in terms of play on a corresponding hypergraph which will become a graph during play. At that point Nofil is equivalent to playing the game Node Kayles on the graph. We prove necessary conditions and sufficient conditions for a graph to reached playing Nofil. We conclude that the complexity of determining the outcome of the game Nofil on Steiner triple systems is PSPACE-complete for randomized reductions.     

一种新型极性脲丙基-C30固定相的制备和性能评价

以3-脲丙基三甲氧基硅烷为偶联剂，制备了一种新型极性脲丙基-C30（TPU-C30）反相色谱固定相。采用扫描电子显微镜、元素分析、红外光谱和热分析等对该固定相进行表征。结果表明，TPU-C30固定相已成功制备，连续制备3次固定相，其元素含量的相对偏差均小于5%，说明该合成工艺重复性良好。以不同极性、位置异构、碱性化合物为溶质探针，以传统的C18色谱柱与C30色谱柱为参比，对制备的固定相的色谱性能进行了研究。研究结果表明，TPU-C30固定相具有不同于传统C18柱、C30柱的选择性和更优的择形性，明显改善了碱性物质的峰形，其具有广阔的应用空间。     

Some mildly wild circles in Sn arising from algebraic K-Theory

We study wild embeddings of S ¹ in S ⁿ which are tame in a sense introduced by Quinn. We show that if is a finitely presented group with H ₁()=H ₂()=0, then any finiteness obstruction K ₀() can be realized on the complement of such an embedded S ¹. We also realize trivially symmetric K _–1() obstructions on the complements of such embeddings. For trivially symmetric , the embeddings constructed are shown to be isotopy homogeneous.