Unconditional ideals of finite rank operators

Let X be a Banach space. We give characterizations of when is a u-ideal in for every Banach space Y in terms of nets of finite rank operators approximating weakly compact operators. Similar characterizations are given for the cases when is a u-ideal in for every Banach space Y, when is a u-ideal in for every Banach space Y, and when is a u-ideal in for every Banach space Y.     

Principal ideals of finitely generated commutative monoids

We study the semigroups isomorphic to principal ideals of finitely generated commutative monoids. We define the concept of finite presentation for this kind of semigroups. Furthermore, we show how to obtain information on these semigroups from their presentations.     

Semigroups generated by a group and an idempotent

It is well known that the semigroup of all transformations on a finite set X of order n is generated by its group of units, the symmetric group, and any idempotent of rank n ? 1. Similarly, the symmetric inverse semigroup on X is generated by its group of units and any idempotent of rank n ? 1 while the analogous result is true for the semigroup of all n × n matrices over a field.

In this paper we begin a systematic study of the structure of a semigroup S generated by its group G of units and an idempotent ? . The first section consists of preliminaries while the second contains some general results which provide the setting for those which follow.

In the third section we shall investigate the situation where G is a permutation group on a set X of order n and ? is an idempotent of rank n ? 1. In particular, we shall show that any such semigroup S is regular. Furthermore we shall determine when S is an inverse or orthodox semigroup or completely regular semigroup.

The fourth section deals with a special case, that in which G is cyclic. The fifth, and last, deals with the situation where G is dihedral. In both cases, the resulting semigroup has a particularly delicate structure which is of interest in its own right. Both situations are replete with interesting combinatorial gems.

The author was led to the results of this paper by considering the output of a computer program he was writing for generating and analyzing semigroups.     

Rank and idempotent rank of finite full transformation semigroups with restricted range

Let T(X) be the full transformation semigroup on the set X and let T(X,Y) be the semigroup consisting of all total transformations from X into a fixed nonempty subset Y of X. In 2011, Sanwong studied the regular part $$F(X,Y)=\bigl\{\alpha\in T(X,Y): X\alpha\subseteq Y\alpha\bigr\}, $$ of T(X,Y) and described its Green’s relations and ideals. In this paper, we compute the rank of F(X,Y) when X is a finite set. Moreover, we obtain the rank and idempotent rank of its ideals.     

Holomorphic rank of hypersurfaces with an isolated singularity

LetV be a germ at 0 C ²,n3, of hypersurface with an isolated singularity at 0. In this paper we prove that the maximal number of germs of vector fields inV ^*=V–0, which are linearly independent in all points ofV ^* is two. In the casesn=3,4 and of quasi homogeneous hypersurfaces (n3), we prove that this number is one.Dedicated to the memory of R. MañéThis research was partially supported by Pronex.     

Linear rank and corank preserving maps on (H) and an application to *-semigroup isomorphisms of operator ideals

We characterize linear rank-k nonincreasing, rank-k preserving, and corank-k preserving maps on B(H), the algebra of all bounded linear operators on the Hilbert space H. This unifies and extends finite-dimensional results and results on linear rank-1 non-increasing and rank-1 preserving maps in the infinite-dimensional case. We conclude with an application to *-semigroup isomorphisms of operator ideals.     

Linear programs with an additional rank two reverse convex constraint

An efficient algorithm is developed for solving linear programs with an additional reverse convex constraint having a special structure. Computational results are presented and discussed.     

A note on the equality of rank and trace for an idempotent matrix

The equality of rank and trace for an idempotent matrix is established by means of elementary matrix factorizations. The proof is substantially simpler than most found in the literature.     

Decomposition of ideals into pseudo-irreducible ideals

A proper ideal of a commutative ring is called pseudo-irreducible if it cannot be written as a product of two comaximal proper ideals. In this paper, we give a necessary and su?cient condition for every proper ideal of a commutative ring to be a product of pairwise comaximal pseudo-irreducible ideals. Examples of such rings include Laskerian rings, or more generally J-Noetherian rings and ZD-rings. We study when certain classes of rings satisfy this condition.     

Semigroup closures of finite rank symmetric inverse semigroups

We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse semigroup of finite transformations I _λ ⁿ of the rank ≤ n is algebraically closed in the class of (semi)topological inverse semigroups with continuous inversion. We also derive related results about the nonexistence of (partial) compactifications of classes of semigroups that we consider.     

Structure of tensor fields of the second rank generated by an incompatibility operator

There is considered the structure of fields of symmetric tensors η generated by the incompatibility operator Ink acting according to the formula Inkη = × η × . This operator which is closely related to internal stresses in bodies was considered by Kroner /1/ in application to the continuum theory of dislocations. Allied to the study of the structure of tensor fields is the problem of their restoration according to a given incompatibility and divergence as well as the decomposition into incompatible and compatible strain. For a sufficiently smooth Kröner tensor field that vanishes at infinity, by starting from the analogy with the properties of a vector field, it is shown that such a decomposition exists and is unique. In the supplement to /2/, this problem is solved in practice, where an effective algorithm is developed for the decomposition into appropriate invariant components by using projection operators. Analogous questions are examined below in application to finite domains as well as in connection with the decomposition of a tensor into deviatoric and spherical parts.     

Density versions of Schur's theorem for ideals generated by submeasures

We characterize ideals of subsets of natural numbers for which some versions of Schur's theorem hold. These are similar to generalizations shown by Bergelson (1986) in [1] and Frankl, Graham and Rödl (1990) in [7]. Additionally, we prove a generalization of an iterated version of Ramsey's theorem.     

Some relations between rank, chromatic number and energy of graphs

The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. Let G be a graph of order n and be the rank of the adjacency matrix of G. In this paper we characterize all graphs with . Among other results we show that apart from a few families of graphs, , where n is the number of vertices of G, and χ(G) are the complement and the chromatic number of G, respectively. Moreover some new lower bounds for E(G) in terms of are given.     

Derivations into duals of ideals of Banach algebras

We introduce two notions of amenability for a Banach algebra A. LetI be a closed two-sided ideal inA, we sayA is I-weakly amenable if the first cohomology group ofA with coefficients in the dual space I* is zero; i.e.,H ¹(A, I*) = {0}, and,A is ideally amenable ifA isI-weakly amenable for every closed two-sided idealI inA. We relate these concepts to weak amenability of Banach algebras. We also show that ideal amenability is different from amenability and weak amenability. We study theI-weak amenability of a Banach algebraA for some special closed two-sided idealI.     

Skew codes of prescribed distance or rank

In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotients of non-commutative polynomial rings, so called skew polynomial rings of automorphism type. We propose a method to construct block codes of prescribed rank and a method to construct block codes of prescribed distance. Since there is no unique factorization in skew polynomial rings, there are much more ideals and therefore much more codes than in the commutative case. In particular we obtain a [40, 23, 10]₄ code by imposing a distance and a [42,14,21]₈ code by imposing a rank, which both improve by one the minimum distance of the previously best known linear codes of equal length and dimension over those fields. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section.      

Consistency of rank tests against some general alternatives

The proof of consistency of rank tests against some general alternatives is given. The alternatives considered include arbitrary, not necessarily monotone, trend in location or change points (change surfaces) under the infill asymptotics. One-dimensional and multi-dimensional cases are studied. The numerical experiment illustrating the usage of the above results for image analysis (edge detection) is presented.