AVERAGE ONESIDED WIDTHS OF SOBOLEV AND BESOV CLASSES

The article concerns the average onesided widths of the Sobolev and Besov classes and the classes of functions with bounded moduli of smoothness. The weak asymptotic results are obtained for the corresponding quantities.     

格序群的极小扭类,准素扭类和极扭类

本文给出了格序群的扭类是准素扭类的一个充分必要条件，证明了任一非零扭类至少包含一个极小扭类，从而将文〔１〕和〔２〕中在有限制条件情况下的有关结论推广到无任何限制条件的情形。本文还给出了一个扭类是极扭类的几个充分必要条件，并得到了格序群的极扭类、准素扭类和极小扭类之间的关系。     

Categoricity in multiuniversal classes

The third author has shown that Shelah's eventual categoricity conjecture holds in universal classes: class of structures closed under isomorphisms, substructures, and unions of chains. We extend this result to the framework of multiuniversal classes. Roughly speaking, these are classes with a closure operator that is essentially algebraic closure (instead of, in the universal case, being essentially definable closure). Along the way, we prove in particular that Galois (orbital) types in multiuniversal classes are determined by their finite restrictions, generalizing a result of the second author.     

各向异性Sobolev及Besov类的平均单边宽度

给出了各向异性Sobolev类及各向异性Besov类的平均单边宽度,获得了相应的弱渐近估计.     

Generalized Vector Equilibrium Problems with Trifunctions

In this paper, we study the existence of strong and weak solutions of the generalized vector equilibrium problems for trifunctions. Two special classes of vector-valued trifunctions are introdcued, called the classes of (SPM) and (GPM), respectively. Some existence results for strong solutions associated to functions of these classes are given.     

格序群的C-根类和K-根类

本文研究了Ｃ-根类（即凸ｌ－子群格可分辨根类）和Ｋ－根类．证明了：投射ｌ－群、强投射ｌ－群、两两分裂ｌ－群、Ｆ－群等许多ｌ－群类都是ｌ－子群格可分辨的,但Ｈａｍｉｌｔｏｎｌ－群不是;Ｃ－根类格是根类格的一个有伪补的闭子格,而且是根类半群的一个子半群．每个凸Ｏ一子群都是闭的,而且给出了由一簇Ｋ一根类及一个根类所生成的Ｋ－根类的形式．     

论有限群元素共轭类的平均长度

本文研究有限群元素共轭类的平均长度问题.利用初等群论方法和有限群特征标理论,在共轭类平均长度为某一定数时,获得了对有限群结构的刻划,且对有限群数量性质的研究是有意义的.     

Perturbation classes of semi-Fredholm operators in Banach lattices

We prove some results giving positive answers to the perturbation classes problem for semi-Fredholm operators acting on Banach lattices satisfying certain conditions, and we show that these results can be applied to some Lorentz and Orlicz function spaces.     

When are definable classes tilting and cotilting classes?

It is known that tilting classes are of finite type, while cotilting classes are not always of cofinite type. We investigate this phenomenon. By using a bijection between definable classes of left modules and definable classes of right modules, we prove that it reflects the asymmetry existing between the notions of covers and envelopes or, otherwise stated, right and left approximations.In particular we show that there exist definable torsion classes containing the injective modules which are not tilting classes.     

上协边类纤维丛表示的若干性质

本文研究了底空间为实射影空间时上协边类纤维丛表示的若干性质．     

On Similar Special Classes

Two special classes are said to be similar if they determine the same upper radical. A necessary and sufficient condition for a special radical to be generated by distinct similar special classes is given and all similar special classes generating a given special radical are described.     

THE N-WIDTHS FOR A GENERALIZED PERIODIC BESOV CLASSES

In this paper, an extension of Besov classes of periodic functions on Td is given. The weak asymptotic results concerning the Kolmogorov n-widths, the linear n-widths, and the Gel＇fand n-widths are obtained, respectively.     

Lower bound for quantum integration error on anisotropic Sobolev classes

We study the approximation of the integration of multivariate functions in the quantum model of computation. Using a new reduction approach we obtain a lower bound of the n-th minimal query error on anisotropic Sobolev class R（Wpr（[0, 1]d）） （r R＋d）. Then combining this result with our previous one we determine the optimal bound of n-th minimal query error for anisotropic Hblder- Nikolskii class R（H∞r（[0,1]d）） and Sobolev class R（W∞r（[0,1]d））. The results show that for these two types of classes the quantum algorithms give significant speed up over classical deterministic and randomized algorithms.     

Grid classes and partial well order

We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman?s Theorem and relies on there being only finitely many simple permutations in the only non-monotone cell of each component of the matrix. The other direction is proved by a more general result that allows the construction of infinite antichains in any grid class of a matrix whose graph has a component containing two or more non-monotone-griddable cells. The construction uses a generalisation of pin sequences to grid classes, together with a number of symmetry operations on the rows and columns of a gridding.     

Conjugacy classes in finite permutation groups via homomorphic images

The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable normal subgroups to compute the conjugacy classes of a finite group.

     

Classes of graphs without star forests and related graphs

This work provides a structural characterisation of hereditary graph classes that do not contain a star forest, several graphs obtained from star forests by subset complementation, a union of cliques, and the complement of a union of cliques as induced subgraphs. This provides, for instance, structural results for graph classes not containing a matching and several complements of a matching. In terms of the speed of hereditary graph classes, our results imply that all such classes have at most factorial speed of growth.     

On tertiary exotic characteristic classes

We prove the existence and nontriviality of tertiary exotic characteristic classes extending the results of Peterson and Ravenel for secondary exotic classes.

     

Bordism Classes of Involutions on RP（2n）、CP（2n） and HP（2n）

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｔｈｉｓｐａｐｅｒ,ＲＰ（ｎ）,ＣＰ（ｎ）,ＨＰ（ｎ）ｒｅｐｒｅｓｅｎｔｓｎ－ｄｉｍｅｎｓｉｏｎａｌｒｅａｌｐｒｏｊｅｃｔｉｖｅｓｐａｃｅ,ｃｏｍｐｌｅｘｐｒｏｊｅｃｔｉｖｅｓｐａｃｅ,ｑｕａｔｅｒｎｉｏｎｉｓｐｒｏｊｅｃｔｉｖｅｓｐａｃｅｒｅｓｐｅｃｔｉｖｅｌｙ．Ｍ～２ＲＰ（ｎ）ｍｅａｎｓｔｈｅｍｏｄ２ｃｏｈｏｍｏｌｏｇｙｒｉｎｇｏｆＭｉｓｉｓｏｍｏｒｐｈｉｃｔｏｔｈａｔｏｆＲＰ（ｎ）：Ｈ（Ｍ;Ｚ２）≈Ｈ（ＲＰ（ｎ）;Ｚ２）．Ｗｅｉｎｔｒｏｄｕｃｅｔｈｅ…     

Exotic Quantifiers, Complexity Classes, and Complete Problems

We define new complexity classes in the Blum–Shub–Smale theory of computation over the reals, in the spirit of the polynomial hierarchy, with the help of infinitesimal and generic quantifiers. Basic topological properties of semialgebraic sets like boundedness, closedness, compactness, as well as the continuity of semialgebraic functions are shown to be complete in these new classes. All attempts to classify the complexity of these problems in terms of the previously studied complexity classes have failed. We also obtain completeness results in the Turing model for the corresponding discrete problems. In this setting, it turns out that infinitesimal and generic quantifiers can be eliminated, so that the relevant complexity classes can be described in terms of the usual quantifiers only.