Minimal Modules Over Serial Rings

We investigate several model theoretic minimalities in the framework of modules over a given serial ring R.     

A new general algorithmic method in reaction syntheses using linear algebra

We discuss here a new general linear algebraic method (both model and algorithm) for describing and generating (among others) minimal reactions and also minimal mechanisms in stoichiometry, or dimensionless groups in physics as well. (Further applications in process network syntheses will be discussed in .) With some minor modifications of the input this method can be extended for several related questions: for generating direct and overall reactions, direct (steady state) mechanisms, for finding the possible resulting (overall) reactions among all possible mechanisms, etc.Computational results in section 4 show the speed of our algorithm.We give also mathematical background and results in sections 3, 5 and 6. However, we do not restrict ourselves to mathematics only, we also talk on the language of chemistry, too.The theoretical results in sections 3.2, 3.3, 5 and the computational examples in section 4 are completely new, further theoretical results will appear in and in .     

Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes

It is shown that, in the pattern recognition problem with two nonoverlapping classes, the matrices of estimates of the object closeness are described by a metric. The transition to the algebraic closure of the model of recognizing operators of finite degree corresponds to the application of a special transformation of this metric. It is proved that the minimal degree correct algorithm can be found as a polynomial of a special form. A simple criterion for testing classification implementations is obtained.     

Skilled workforce scheduling in Service Centres

The Skilled Workforce Project Scheduling Problem (SWPSP) is a complex problem of task scheduling and resource assignment that comes up in the daily management of many company Service Centres (SC). The SWPSP considers many real characteristics faced daily by the SC: client-company service quality agreements that establish maximum dates for the beginning and the end of tasks with penalties for delays, criticality levels indicating the client-priority in processing each task, generalized precedence relationships that can produce cycle structures, time period and percentage time lags and variable task durations depending on the worker executing the task. Furthermore, the SC workforce is made up of specialist workers characterised by efficiency levels showing their efficiency and speed executing the several types of tasks. Each worker has his or her own timetable.     

On <Emphasis Type="Italic">n</Emphasis> × <Emphasis Type="Italic">m</Emphasis>-valued Łukasiewicz-Moisil algebras

n×m-valued Łukasiewicz algebras with negation were introduced and investigated in [20, 22, 23]. These algebras constitute a non trivial generalization of n-valued Łukasiewicz-Moisil algebras and in what follows, we shall call them n×m-valued Łukasiewicz-Moisil algebras (or LM _n×m -algebras). In this paper, the study of this new class of algebras is continued. More precisely, a topological duality for these algebras is described and a characterization of LM _n×m -congruences in terms of special subsets of the associated space is shown. Besides, it is determined which of these subsets correspond to principal congruences. In addition, it is proved that the variety of LM _n×m -algebras is a discriminator variety and as a consequence, certain properties of the congruences are obtained. Finally, the number of congruences of a finite LM _n×m -algebra is computed.      

Characterization of standard embeddings between complex Grassmannians by means of varieties of minimal rational tangents

In 1993,Tsal proved that a proper holomorphic mapping f:Ω→Ω' from an irreducible bounded symmetric domainΩof rank≥2 into a bounded symmetric domainΩ' is necessarily totally geodesic provided that r':=rank(Ω')≤rank(Ω):= r,proving a conjecture of the author's motivated by Hermitian metric rigidity.As a first step in the proof,Tsai showed that df preserves almost everywhere the set of tangent vectors of rank 1.Identifying bounded symmetric domains as open subsets of their compact duals by means of the Borel embedding,this means that the germ of f at a general point preserves the varieties of minimal rational tangents(VMRTs). In another completely different direction Hwang-Mok established with very few exceptions the Cartan- Fubini extension priniciple for germs of local biholomorphisms between Fano manifolds of Picard num- ber 1,showing that the germ of map extends to a global biholomorphism provided that it preserves VMRTs.We propose to isolate the problem of characterization of special holomorphic embeddings between Fano manifolds of Picard number 1,especially in the case of classical manifolds such as ratio- nal homogeneous spaces of Picard number 1,by a non-equidimensional analogue of the Cartan-Fubini extension principle.As an illustration we show along this line that standard embeddings between com- plex Grassmann manifolds of rank≤2 can be characterized by the VMRT-preserving property and a non-degeneracy condition,giving a new proof of a result of Neretin's which on the one hand paves the way for far-reaching generalizations to the context of rational homogeneous spaces and more generally Fano manifolds of Picard number 1,on the other hand should be applicable to the study of proper holomorphic mappings between bounded domains carrying some form of geometric structures.     

An Example of a Fiber in Fibrations Whose Serre Spectral Sequences Collapse

We give an example of a space X with the property that every orientable fibration with the fiber X is rationally totally non-cohomologous to zero, while there exists a nontrivial derivation of the rational cohomology of X of negative degree.     

数学归纳法与匹亚诺公理

数学归纳法推理是典型的三段论，而不是完全归纳法，其基础是自然数列的性质，而不是逻辑公理，皮亚诺公理中的归纳法公理并不是一种证明方法，而是自然数集的一条不可缺少的根据性质。     

Minimal webs in Riemannian manifolds

For a given combinatorial graph G a geometrization (G, g) of the graph is obtained by considering each edge of the graph as a 1-dimensional manifold with an associated metric g. In this paper we are concerned with minimal isometric immersions of geometrized graphs (G, g) into Riemannian manifolds (N ⁿ , h). Such immersions we call minimal webs. They admit a natural ‘geometric’ extension of the intrinsic combinatorial discrete Laplacian. The geometric Laplacian on minimal webs enjoys standard properties such as the maximum principle and the divergence theorems, which are of instrumental importance for the applications. We apply these properties to show that minimal webs in ambient Riemannian spaces share several analytic and geometric properties with their smooth (minimal submanifold) counterparts in such spaces. In particular we use appropriate versions of the divergence theorems together with the comparison techniques for distance functions in Riemannian geometry and obtain bounds for the first Dirichlet eigenvalues, the exit times and the capacities as well as isoperimetric type inequalities for so-called extrinsic R-webs of minimal webs in ambient Riemannian manifolds with bounded curvature.      

Applications of an Explicit Formula for the Generalized Euler Numbers

The authors establish an explicit formula for the generalized Euler NumbersE2n^（x）, and obtain some identities and congruences involving the higher＇order Euler numbers, Stirling numbers, the central factorial numbers and the values of the Riemann zeta-function.