Some Normal Cryptogroups as Semigroups of Isomorphisms

Given a Clifford semigroup G, we construct special G-operands L and R which we term conformai. Certain suboperands of L and R we call threads and fix some special G-isomorphisms, which we term coherent, of threads in R onto threads in L. On the set of all coherent G-isomorphisms of threads in L onto threads in R we define a sandwich-type multiplication. When we restrict our threads to be cyclic suboperands of L and R, this construction produces a normal cryptogroup which we represent as $ S=[Y;S_{\alpha},\chi_{{\alpha},{\beta}}] $ -Without any restriction on the threads this produces a semigroup isomorphic with a remarkable ideal of the translational hull of S. Conversely, given a strong semilattice of completely simple semigroups, satisfying certain conditions, we can represent it isomorphically as indicated above.     

The embedding of (0, α)-geometries in PG(n, q): part II

In Part I we obtained results about the embedding of (0, α)-geometries in PG(3, q). Here we determine all (0, α)-geometries with q+1 points on a line, which are embedded in PG(n, q), n>3 and q>2. As a particular case all semi partial geometries with parameters s=q,t,α(>1),μ, which are embeddable in PG(n, q), q≠2, are obtained. We also prove some theorems about the embedding of (0, 2)-geometries in PG(n, 2): we show that without loss of generality we may restrict ourselves to reduced (0, 2)-geometries, we determine all (0, 2)-geometries in PG(4, 2), and we describe an unusual embedding of U_2,3(9) in PG(5, 2).     

f-Harmonic maps of doubly warped product manifolds

In this paper, we study f-harmonicity of some special maps from or into a doubly warped product manifold. First we recall some properties of doubly twisted product manifolds. After showing that the inclusion maps from Riemannian manifolds M and N into the doubly warped product manifold M × _μ,λ N can not be proper f-harmonic maps, we use projection maps and product maps to construct nontrivial f-harmonic maps. Thus we obtain some similar results given in [21], such as the conditions for f-harmonicity of projection maps and some characterizations for non-trivial f-harmonicity of the special product maps. Furthermore, we investigate non-trivial f-harmonicity of the product of two harmonic maps.     

Sharp Nash inequalities on the unit sphere: The influence of symmetries

In this paper both we establish the best constants for the Nash inequalities on the standard unit sphere Sⁿ of Rⁿ⁺¹, n≥3 and we give answers on the existence of extremal functions on the corresponding problems. Also we study the problem of the best constants in the case where the data are invariant under the action of the group G=O(k)×O(m), k+m=n+1 and we find the best constants.     

T-proximity compatible with T-neighbourhood structure

In this paper, we show that every T-neighbourhood space induces a T-proximity space, where T stands for any continuous triangular norm. An axiom of T-completely regular of T-neighbourhood spaces introduced by Hashem and Morsi (2003) [3], guided by that axiom we supply a Sierpinski object for category T-PS of T-proximity spaces. Also, we define the degree of functional T-separatedness for a pair of crisp fuzzy subsets of a T-neighbourhood space. Moreover, we define the ?ech T-proximity space of a T-completely regular T-neighbourhood space, hence, we establishes it is the finest T-proximity space which induces the given T-neighbourhood space.     

Finite groups with the set of the number of subgroups of possible order containing exactly two elements

Let G be a finite group, and n(G) be the set of the number of subgroups of possible order of G. We investigate the structure of G satisfying that n(G)?=?{1, m} for any positive integer m?>?1. At first, we prove that the nilpotent length of G is less than 2. Secondly, we investigate nilpotent groups with m?=?p?+?1 or p ²?+?p?+?1 (p is a prime), and we get the classification of such kinds of groups. At last, we investigate non-nilpotent groups with m?=?p?+?1 and get the classification of the groups under consideration.     

On some problems of Petrich concerning Bruck and Reilly semigroups

For an inverse semigroupS with its idempotents dually well-ordered, we prove thatS is isomorphic to the semigroup of all one-to-one partial right translations ofS. Also, we prove for a Bruck semigroupS=B(T, α) thatS isE-unitary if and only ifT isE-unitary and α is an idempotent pure homomorphism. Moreover, we characterize allE-unitary covers ofB(T, α), whereT is a finite chain of groups.     

On small {;k; q};-arcs in planes of order q2

In this paper we examine some properties of complete {;k; q};-arcs in projective planes of order q². In particular, we derive a lower bound for k, and we exhibit a family of arcs having low values of k which exist in every such plane having a Baer subplane. In addition we resolve the existence problem for complete {;k; 3};-arcs in PG(2, 9).     

On-line Construction of Two-Dimensional Suffix Trees

We say that a data structure is builton-lineif, at any instant, we have the data structure corresponding to the input we have seen up to that instant. For instance, consider the suffix tree of a stringx[1, n]. An algorithm building iton-lineis such that, when we have read the firstisymbols ofx[1, n], we have the suffix tree forx[1, i]. We present a new technique, which we refer to asimplicit updates, based on which we obtain: (a) an algorithm for theon-lineconstruction of the Lsuffix tree of ann×nmatrixA—this data structure is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations forLZ1-typeon-line losslessimage compression methods. Those methods, recently introduced by Storer, are generalizations ofLZ1-typecompression methods for strings. For the problem in (a), we get nearly an order of magnitude improvement over algorithms that can be derived from known techniques. For the problem in (b), we do not get an asymptotic speed-up with respect to what can be done with known techniques; rather we show that our algorithms are a natural support for the primitive operations. This may lead to faster implementations of those primitive operations. To the best of our knowledge, our technique is the first one that effectively addresses problems related to theon-lineconstruction of two-dimensional suffix trees.     

Weighted cross-intersecting families

In this paper we investigate weighted cross-intersecting families: if α,β>0 are given constants, we want to find the maximum of α|A|+β|B| for A,B uniform cross-intersecting families. We determine the maximum sum, even if we have restrictions of the size of A.As corollaries, we will obtain some new bounds on the shadows and the shades of uniform families. We give direct proofs for these bounds, as well, and show that the theorems for cross-intersecting families also follow from these results.Finally, we will generalize the LYM inequality not only for cross-intersecting families, but also for arbitrary Sperner families.     

A note on the signless Laplacian eigenvalues of graphs

In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue inequalities. We first consider an interlacing theorem when a vertex is deleted. In particular, let G-v be a graph obtained from graph G by deleting its vertex v and κ_i(G) be the ith largest eigenvalue of the signless Laplacian of G, we show that κ_i+1(G)-1?κ_i(G-v)?κ_i(G). Next, we consider the third largest eigenvalue κ₃(G) and we give a lower bound in terms of the third largest degree d₃ of the graph G. In particular, we prove that . Furthermore, we show that in several situations the latter bound can be increased to d₃-1.     

On BO-algebras

In this paper, we introduce the notion of a BO-algebra, and we prove that every BO-algebra is 0-commutative, and we show that BO-algebras, 0-commutative B-algebras, BM-algebras, p-semisimple BCI-algebras and abelian groups are logically equivalent.     

Relative homological algebra in the category of quasi-coherent sheaves

In this paper, we prove the existence of a flat cover and of a cotorsion envelope for any quasi-coherent sheaf over a scheme (X,O_X). Indeed we prove something more general. We define what it is understood by the category of quasi-coherent R-modules, where R is a representation by rings of a quiver Q, and we prove the existence of a flat cover and a cotorsion envelope for quasi-coherent R-modules. Then we use the fact that the category of quasi-coherent sheaves on (X,O_X) is equivalent to the category of quasi-coherent R-modules for some Q and R to get our result.     

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F={K₂}. In this paper we provide new approximation algorithms and hardness results for the K_r-packing problem where K_r={K₂,K₃,…,K_r}.We show that already for r=3 the K_r-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r=3,4,5 we obtain better approximations. For r=3 we obtain a simple3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldórsson. For r=4, we obtain a (3/2+?)-approximation, and for r=5 we obtain a (25/14+?)-approximation.     

Odd prime values of the Ramanujan tau function

We study the odd prime values of the Ramanujan tau function, which form a thin set of large primes. To this end, we define LR(p,n):=τ(p ^n?1) and we show that the odd prime values are of the form LR(p,q) where p,q are odd primes. Then we exhibit arithmetical properties and congruences of the LR numbers using more general results on Lucas sequences. Finally, we propose estimations and discuss numerical results on pairs (p,q) for which LR(p,q) is prime.     

The existence and the non-existence of joint t-universality for Lerch zeta functions

In this paper, we show the following theorems. Suppose 0<al<1 are algebraically independent numbers and 0<λl?1 for 1?l?m. Then we have the joint t-universality for Lerch zeta functions L(λl,al,s) for 1?l?m. Next we generalize Lerch zeta functions, and obtain the joint t-universality for them. In addition, we show examples of the non-existence of the joint t-universality for Lerch zeta functions and generalized Lerch zeta functions.     

A note on quasi-permutation representations of groups with two character degrees

In Behravesh (J. Lond. Math. Soc. (2) 55:251–260, 1997), we gave algorithms to calculate c(G), q(G) and p(G) for a finite group G. In this paper we will show that in groups with two character degrees we may have c(G)=q(G)≠p(G).     

Largest subsemigroups of the full transformation monoid

In this paper we are concerned with the following question: for a semigroup S, what is the largest size of a subsemigroup T?S where T has a given property? The semigroups S that we consider are the full transformation semigroups; all mappings from a finite set to itself under composition of mappings. The subsemigroups T that we consider are of one of the following types: left zero, right zero, completely simple, or inverse. Furthermore, we find the largest size of such subsemigroups U where the least rank of an element in U is specified. Numerous examples are given.     

Nonrepetitive colorings of trees

A coloring of the vertices of a graph G is nonrepetitive if no path in G forms a sequence consisting of two identical blocks. The minimum number of colors needed is the Thue chromatic number, denoted by π(G). A famous theorem of Thue asserts that π(P)=3 for any path P with at least four vertices. In this paper we study the Thue chromatic number of trees. In view of the fact that π(T) is bounded by 4 in this class we aim to describe the 4-chromatic trees. In particular, we study the 4-critical trees which are minimal with respect to this property. Though there are many trees T with π(T)=4 we show that any of them has a sufficiently large subdivision H such that π(H)=3. The proof relies on Thue sequences with additional properties involving palindromic words. We also investigate nonrepetitive edge colorings of trees. By a similar argument we prove that any tree has a subdivision which can be edge-colored by at most Δ+1 colors without repetitions on paths.     

Transformation conforme de la courbure scalaire sur une variété riemannienne compacte

If P′ is a C^∞ positive function on a compact riemannian manifold of dimension n ⩾ 3 and metric g, we define a conformal invariant v(R′) and we prove that if v(R′) is small enough, R′ is the scalar curvature of the manifold endowed with a metric conformal to g. Then we are interested in the case of the sphere S_n and finally in Yamabe's problem.