On flatness of acts

We consider monoids $S=G\dot \cup I$ where G is a group and I is an ideal of S and show that if an S-act is principally weakly flat, (weakly) flat, torsion free or satisfies conditions (P) or (P_E) as an I¹-act, then it has these properties as an S-act. We also show that an S-act which is free, projective or strongly flat as an I¹-act may not generally have these properties as an S-act.     

On uniform acts over semigroups

The paper is devoted to the investigation of uniform acts over semigroups perceived as an overclass of subdirectly irreducible acts. We establish conditions for a uniform act to be subdirectly irreducible. In particular, we prove that uniform acts with two zeros are subdirectly irreducible. Ultimately we investigate monoids which are uniform as right acts over themselves and we describe regular monoids with this property.     

On Rees weakly projective right acts

In this article, we present an extension of the concept of weakly projective acts to the socalled (S/I, S/J)-projective acts. Retracts, coproducts, and products of acts as well as Rees factor acts are considered from the point of view of these properties. They are used to describe monoids that are disjoint unions of a group with a left zero semigroup or with a disjoint union of simple right ideals. We suggest concepts of weak QF-monoids. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 10, No. 3, pp. 85–96, 2004.     

On smoothed analysis in dense graphs and formulas

We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by Bohman and colleagues (Random Struct Algor 3 ; Random Struct Algor 4 ). Here we obtain a sharp threshold for the appearance of a fixed subgraph and for certain Ramsey properties. We also consider a related model of random k‐SAT formulas, where an instance is obtained by adding random k‐clauses to a fixed formula with a given number of clauses, and derive tight bounds for the non‐satisfiability of the thus‐obtained random formula. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

On covers of cyclic acts over monoids

In (Bull. Lond. Math. Soc. 33:385–390, 2001) Bican, Bashir and Enochs finally solved a long standing conjecture in module theory that all modules over a unitary ring have a flat cover. The only substantial work on covers of acts over monoids seems to be that of Isbell (Semigroup Forum 2:95–118, 1971), Fountain (Proc. Edinb. Math. Soc. (2) 20:87–93, 1976) and Kilp (Semigroup Forum 53:225–229, 1996) who only consider projective covers. To our knowledge the situation for flat covers of acts has not been addressed and this paper is an attempt to initiate such a study. We consider almost exclusively covers of cyclic acts and restrict our attention to strongly flat and condition (P) covers. We give a necessary and sufficient condition for the existence of such covers and for a monoid to have the property that all its cyclic right acts have a strongly flat cover (resp. (P)-cover). We give numerous classes of monoids that satisfy these conditions and we also show that there are monoids that do not satisfy this condition in the strongly flat case. We give a new necessary and sufficient condition for a cyclic act to have a projective cover and provide a new proof of one of Isbell’s classic results concerning projective covers. We show also that condition (P) covers are not unique, unlike the situation for projective covers.     

On free,projective, and strongly flat acts

Archiv der Mathematik -     

On perfectly normal dense subspaces of products

Let M be a separable metric space consisting of more than one point. We construct perfectly normal dense subspaces Z⊂Mc² and (under additional set-theoretic assumption) Y⊂Mc which are not collectionwise Hausdorff.     

On 1-uniqueness and dense critical graphs for tree-depth

The tree-depth of $G$ is the smallest value of $k$ for which a labeling of the vertices of $G$ with elements from $\{1,\dots ,k\}$ exists such that any path joining two vertices with the same label contains a vertex having a higher label. The graph $G$ is $k$-critical if it has tree-depth $k$ and every proper minor of $G$ has smaller tree-depth.Motivated by a conjecture on the maximum degree of $k$-critical graphs, we consider the property of 1-uniqueness, wherein any vertex of a critical graph can be the unique vertex receiving label 1 in an optimal labeling. Contrary to an earlier conjecture, we construct examples of critical graphs that are not 1-unique and show that 1-unique graphs can have arbitrarily many more edges than certain critical spanning subgraphs. We also show that $(n?1)$-critical graphs on $n$ vertices are 1-unique and use 1-uniqueness to show that the Andrásfai graphs are critical with respect to tree-depth.     

On extending continuous functions on dense subsemigroups

Communicated by J. Lawson     

On iterative processes generating dense point sets

Summary The central problem of this paper is the question of denseness of those planar point sets <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>\mathcal{P}$, not a subset of a line, which have the property that for every three noncollinear points in $\mathcal{P}$, a specific triangle center (incenter (IC), circumcenter (CC), orthocenter (OC) resp.) is also in the set $\mathcal{P}$. The IC and CC versions were settled before. First we generalize and solve the CC problem in higher dimensions. Then we solve the OC problem in the plane essentially proving that $\mathcal{P}$ is either a dense point set of the plane or it is a subset of a rectangular hyperbola. In the latter case it is either a dense subset or it is a special discrete subset of a rectangular hyperbola.     

On dense univalued representations of multivalued maps

Representations of multivalued maps as pointwise closure of a sequence of point-valued functions are derived from functional analytic considerations. Characterizations of convergence in the space of multifunctions, and of the ensemble of selections are implied.     

On thin, very thin, and slim dense sets

The notions of thin and very thin dense subsets of a product space were introduced by the third author, and in this article we also introduce the notion of a slim dense set in a product. We obtain a number of results concerning the existence and non-existence of these types of small dense sets, and we study the relations among them.     

On dense free subgroups of the automorphism group

We obtain results on existence of dense free subgroups of the automorphism group of a homogeneous model.     

On dense sequences of polynomials in several variables

In the present paper a form of generalization of Gelfond's lemma on dense sequences of polynomials is proposed. For a set of complex numbers ₁, ..., _s we define the coefficients_gk( ₁, ..., _s ) (0ks) and give the relations between them and the transcendental degrees or the transcendence types of the field © ( ₁, ..., _s ) or its subfields.This work was completed at the Dept. of Math., Univ. of Southern Mississippi, USA in 1987.