The universal nilpotent group compactification of a semigroup

The purpose of this paper is to introduce an algebra of functions on a semitopological semigroup and to study these functions from the point of view of universal semigroup compactification. We show that the corresponding semigroup compactification of this algebra is universal with respect to the property of being a nilpotent group.

     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

完全Rees矩阵半群的分解及性质

用等价关系Q^~出了完全Rees矩阵半群的一种分解．而且得到了它的每个Q^~一类的表示．     

Hele-Shaw type problems with dynamical boundary conditions

In this paper, we study the nonlinear evolution equation of Hele-Shaw type with dynamical boundary conditions. That is, the equation ut=Δw+f where u∈H(w) and H is the Heaviside function, with boundary condition μ(x,w)t_∂w+k∇w⋅ν=g, where ν denotes the outward normal vector of the fixed boundary of the domain. We prove existence, uniqueness and some qualitative properties of the solution.     

Hamiltonian circle actions on symplectic manifolds and the signature

Let M be a symplectic manifold with a Hamiltonian circle action with isolated fixed points. We prove that σ (M) = b₀(M) − b₂(M) + b₄(M) − b₆(M) + … where σ (M) is the signature of M and b_i(M) is the ith Betti number of M.     

Orbifold fibrations of Eschenburg spaces

Most of the few known examples of compact Riemannian manifolds with positive sectional curvature are the total space of a Riemannian submersion. In this article we show that this is true for all known examples, if we enlarge the category to orbifold fibrations. For this purpose we study all almost free isometric circle actions on positively curved Eschenburg spaces, which give rise to principle orbifold bundle structures, and we examine in detail their geometric properties. In particular, we obtain a new family of 6-dimensional orbifolds with positive sectional curvature whose singular locus consists of just two points.      

When is a Riemannian submersion homogeneous?

We study the structure of the most common type of Riemannian submersions, namely those whose fibers are given by the orbits of an isometric group action on a Riemannian manifold. Special emphasis is given to the case where the ambient space has nonnegative curvature. The first author was supported by research grant MTM2004-04794-MEC. Most of this work was done during a visit of the second author to Madrid, financed in part by funds of the aforementioned grant.     

Linear Relations, Differential Inclusions, and Degenerate Semigroups

A generalized linear differential equation in a Banach space is studied. The construction of a phase space and solutions with the help of the spectral theory of linear operators, ergodic theorems, and degenerate semigroups of linear operators is carried out.     

唯一分解整半群上的Mobius函数及其反演公式

陈兆斗首先在文献[1]中定义出了有单位元并满足消去律的唯一分解交换半群上的Mbius函数.本文我们首先证明了Mbius函数作为半群(M1,*)上的元素是常值函数ζ(·)的逆函数.其后获得了该Mbius函数的一些相关结果并给出了三个Mbius反演公式.     

Graphs with Special Arcs and Cryptography

A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques.