直径不超过4的树的割宽

§ 1　IntroductionThe cutwidth problem for graphs,as well as a class of optimal labeling and embed-ding problems,have significant applications in VLSI designs,network communicationsand other areas (see [2 ] ) .We shall follow the graph-theoretic terminology and notation of [1 ] .Let G=(V,E)be a simple graph with vertex set V,| V| =n,and edge set E.A labeling of G is a bijec-tion f:V→ { 1 ,2 ,...,n} ,which can by regarded as an embedding of G into a path Pn.Fora given labeling f of G,th…     

Approximation Properties AP s and p-Nuclear Operators (the Case 0 < s ≤ 1)

We investigate Banach spaces possessing (or not possessing) the approximation properties AP _s, 0 < s ≤ 1, in connection with the following known question in the geometric theory of operators: under which conditions on Banach spaces X and Y and on positive numbers r and p does the p-nuclearity of the second adjoint of a continuous operator T from X to Y imply the p-nuclearity of T? Actually, we give necessary and sufficient conditions under which this question is answered affirmatively. In addition, the corresponding counterexamples are obtained in the maximally strong form. For instance, it is shown (and this statement is a significant strengthening of the previous results of that sort) that there exists a pair of separable Banach spaces Z and W such that the spaces Z ^** and W have Schauder bases, while for every p, 1 ≤ p < 2, there is a non-p-nuclear operator from W to Z with a p-nuclear second adjoint. Earlier, in similar examples, the corresponding spaces did not possess even the Grothendieck approximation property. The technique developed in this paper does not allow us to treat the case p > 2. That case will be studied in a forthcoming paper of the author. Bibliography: 11 titles.     

Classical Solvability of a Model Problem in a Half-Space, Related to the Motion of an Isolated Mass of a Compressible Fluid

For an arbitrary finite time interval, the unique solvability of a linear half-space problem is obtained in Hölder classes of functions. The problem arises as the result of the linearization of a free boundary problem for the Navier--Stokes system governing the unsteady motion of a finite mass of a compressible fluid. The boundary conditions in the linear problem are noncoercive because of the surface tension acting on the free boundary. This fact presents the main difficulty in the problem, while the differential system in itself is parabolic in the sense of Petrovskii. The principal idea of the investigation is to reduce the noncoercive problem to a coercive one with zero coefficient of the surface tension. Bibliography: 6 titles.     

Methodological reflections on a three-step-design combining observation,stimulated recall and interview

In this paper a tripartite qualitative design combining abservation, stimulated recall and interview is presented and discussed. This three-step-design makes it possible to get insight into the interaction of internal and external processes when solving mathematical tasks. The data analysis depends on the research question and the methodological approach. In the light of two research projects in mathematics education two different methods of data analysis are presented and methodologically reflected.     

A market-based computational approach to collaborative organizational learning

We draw upon the concepts of knowledge market, organizational tacit knowledge, credit assignment, and single-loop learning in proposing a market-based conceptual model for collaborative organizational learning. Our proposed model is characterized by the local competition among seller agents and the global collaboration among winner agents in forming a plan, through a chain of ‘upstream–downstream’ working relationship, for task accomplishment. This feature is achieved through three closely coupled processes: the expert selection process, the capital reallocation process, and the plan formation process. Our model is intended for multiple-step learning environment in which each task consists of a sequence of single-step learning tasks. Learning at the global level is the result of a sequence of nested single-loop learning at the local level.     

Generalized binomial and negative binomial distributions of order<Emphasis Type="Italic">k</Emphasis> by the<Emphasis Type="Italic">l</Emphasis>-overlapping enumeration scheme

In this paper, we investigate the exact distribution of the waiting time for ther-th ℓ-overlapping occurrence of success-runs of a specified length in a sequence of two state Markov dependent trials. The probability generating functions are derived explicitly, and as asymptotic results, relationships of a negative binomial distribution of orderk and an extended Poisson distribution of orderk are discussed. We provide further insights into the run-related problems from the viewpoint of the ℓ-overlapping enumeration scheme. We also study the exact distribution of the number of ℓ-overlapping occurrences of success-runs in a fixed number of trials and derive the probability generating functions. The present work extends several properties of distributions of orderk and leads us a new type of geneses of the discrete distributions.