A (2, 11) combinatorial groupoid

The variety of groupoids defined by the identitites (yx)x = xy and ((xy)(yx))(xy) = y has the properties that every groupoid generated by two elements is of order 11. The two generating identities imply others with a wide variety of combinatorial implications.     

Zeros of the functions f(n) = Σi=0(−1)i(in−2i)

The main result of this paper is the following: the only zeros of the title function are at n = 3 and n = 12. This is achieved by means of the recursion function for f(n), viz. F(x) = x³ ? x ? 1 which has only one real root w. This turns out to be the fundamental unit of Q(w). From the norm equation of the units, N(w) = x³ + y³ + z³ ? 3xyz + 2x²z + xz² ? xy² ? yz² = 1, and the negative powers of w which are of binary form, the result follows. The paper concludes with two remarkable combinatorial identities.     

The structure of hemigroups

A hemigroup is a continuous binary operation on a spaceM which satisfies (xy)(zy)=xz. The structure of these and their relationship with semigroups is described.     

Completely inverse AG ∗∗-groupoids

A completely inverse AG ^??-groupoid is a groupoid satisfying the identities (xy)z=(zy)x, x(yz)=y(xz) and xx ^?1=x ^?1 x, where x ^?1 is a unique inverse of x, that is, x=(xx ^?1)x and x ^?1=(x ^?1 x)x ^?1. First we study some fundamental properties of such groupoids. Then we determine certain fundamental congruences on a completely inverse AG ^??-groupoid; namely: the maximum idempotent-separating congruence, the least AG-group congruence and the least E-unitary congruence. Finally, we investigate the complete lattice of congruences of a completely inverse AG ^??-groupoids. In particular, we describe congruences on completely inverse AG ^??-groupoids by their kernel and trace.     

The varieties of loops of Bol-Moufang type

A loop identity is of Bol-Moufang type if two of its three variables occur once on each side, the third variable occurs twice on each side, and the order in which the variables appear on both sides is the same, viz. ((xy)x)z = x(y(xz)). Loop varieties defined by one identity of Bol-Moufang type include groups, Bol loops, Moufang loops and C-loops. We show that there are exactly 14 such varieties, and determine all inclusions between them, providing all necessary counterexamples, too. This extends and completes the programme of Fenyves [Fe69]. Received October 23, 2003; accepted in final form April 12, 2005.     

Slim groupoids

Slim groupoids are groupoids satisfying x(yz) ≈ xz. We find all simple slim groupoids and all minimal varieties of slim groupoids. Every slim groupoid can be embedded into a subdirectly irreducible slim groupoid. The variety of slim groupoids has the finite embeddability property, so that the word problem is solvable. We introduce the notion of a strongly nonfinitely based slim groupoid (such groupoids are inherently nonfinitely based) and find all strongly nonfinitely based slim groupoids with at most four elements; up to isomorphism, there are just two such groupoids. The work is a part of the research project MSM0021620839 financed by MSMT.     

An elegant 3-basis for inverse semigroups

It is well known that in every inverse semigroup the binary operation and the unary operation of inversion satisfy the following three identities:

Invariant algebraic surfaces of the generalized Lorenz system

In this paper, according to the idea of the weight of a polynomial introduced by Swinnerton-Dyer(Math Proc Camb Philos Soc 132:385–393, 2002), we successfully find all the invariant algebraic surfaces of the generalized Lorenz system x′ = a(y ? x), y′ = bx + cy ? xz, z′ = xy + dz.     

Solution of a problem of Skolem

T. Skolem shows that there are at most six integer solutions to the Diophantine equation x⁵ + 2y⁵ + 4z⁵ ? 10xy³z + 10x²yz² = 1. The author shows here that there are precisely three integer solutions.     

Some matrix functional equations

We investigate the pair of matrix functional equations G(x)F(y) = G(xy) and G(x)G(y) = F(y/x), featuring the two independent scalar variables x and y and the two N×N matrices F(z) andG(z) (with N an arbitrary positive integer and the elements of these two matrices functions of the scalar variable z). We focus on the simplest class of solutions, i.e., on matrices all of whose elements are analytic functions of the independent variable. While in the scalar (N = 1) case this pair of functional equations only possess altogether trivial constant solutions, in the matrix (N > 1) case there are nontrivial solutions. These solutions satisfy the additional pair of functional equations F(x)G(y) = G(y/x) andF(x)F(y) = F(xy), and an endless hierarchy of other functional equations featuring more than two independent variables.     

Quasigroups and tactical systems

A quasigroupQ is a set together with a binary operation which satisfies the condition that any two elements of the equationxy =z uniquely determines the third. A quasigroup is in indempotent when any elementx satisfies the indentityxx =x. Several types of Tactical Systems are defined as arrangement of points into “blocks” in such a way as to balance the incidence of (ordered or unordered) pairs of points, and shown to be coexistent with idempotent quasigroups satisfying certain identifies. In particular the correspondences given are: 1. totally symmetric idempotent quasigroups and Steiner triple systems, 2. semi-symmetric idempotent quasigroups and directed triple systems, 3. idempotent quasigroups satisfying Schröder's Second Law, namely (xy)(yx)=x, and triple tourna-ments, and 4. idempotent quasigroups satisfying Stein's Third Law, namely (xy)(yx)=y, and directed tournaments. These correspondences are used to obtain corollaries on the existence of such quasig-roups from constructions of the Tactical Systems. In particular this provides a counterexample to an ”almost conjecture“ of Norton and Stein (1956) concerning the existence of those quasigroups in 3 and 4 above. Indeed no idempotent qnasigroups satisfying Stein's Third Law and with order divisible by four were known to N. S. Mendelsohn when he wrote a paper on such quasigroups for the Third Waterloo Conference on Combinatorics (May, 1968). Finally, a construction for triple tournaments is interpreted as a Generalized Semi-Direct Product of idempotent quasigroups.     

Generalized functional equation and its applications in information theory

The functional equationf(x,y)+g(x)h(y)F(u/1?x,ν/1?y)=f(u,ν)+g(u)h(ν)F(x/1?u,y/1?ν) ... (1) forx, y, u, ν ∈ [0, 1) andx+u,y+ν ∈ [0,1) whereg andh satisfy the functional equationφ (x+y?xy)=φ(x)φ(y)... (2) has been solved for some non-constant solution of (2) in [0, 1] withφ (0)=1,φ(1)=0 and the solution is used in characterising some measures of information.     

On Maps Determined by Zero Products

The main result describes a bijective additive map h between prime rings with nontrivial idempotents that satisfies h(x)h(y)h(z) = 0 whenever xy = yz = 0. The proof is based on the consideration of a multiadditive map satisfying a related condition.     

Green's functions in an octant for mixed problems relative to the laplace equation. II

The Green's function in an octant relative to the Laplace equation Δu(x,y,z)=0 are obtained. The boundary conditions considered involve u(x,y,z), normal derivatives of u(x,y,z), linear combinations of these functions, or a mixture thereof.     

Characterizations of generalized quadrangles by generalized homologies

Let S = (P, B, I) be a generalized quadrangle of order (s, t). For x, y P, x y, let (x, y) be the group of all collineations of S fixing x and y linewise. If z {x, y}, then the set of all points incident with the line xz (resp. yz) is denoted by (resp. ). The generalized quadrangle S = (P, B, I) is said to be (x, y)-transitive, x y, if (x, y) is transitive on each set and . If S = (P, B, I) is a generalized quadrangle of order (s, t), s > 1 and t > 1, which is (x, y)-transitive for all x, y P with x y, then it is proved that we have one of the following: (i) S W(s), (ii) S Q(4, s), (iii) S H(4, s), (iv) S Q(5, s), (v) s = t² and all points are regular.     

Asymptotic estimates of sums involving the Moebius function

Let p(n) denote the smallest prime factor of an integer n>1 and let p(1)=∞. We study the asymptotic behavior of the sum M(x,y)=Σ_{1≤n≤x,p(n)>y}μ(n) and use this to estimate the size of A(x)=max_|f|≤1|Σ_2≤n<xμ(n)f(p(n))|, where μ(n) is the Moebius function. Applications of bounds for A(x), M(x,y) and similar quantities are discussed.     

Self-duality in the class of precompact groups

A topological Abelian group G is called (strongly) self-dual if there exists a topological isomorphism Φ:G→G^∧ of G onto the dual group G^∧ (such that Φ(x)(y)=Φ(y)(x) for all x,y∈G). We prove that every countably compact self-dual Abelian group is finite. It turns out, however, that for every infinite cardinal κ with κω=κ, there exists a pseudocompact, non-compact, strongly self-dual Boolean group of cardinality κ.     

Entire functions that share a small function with its derivative

In this paper, by studying the properties of meromorphic functions which have few zeros and poles, we find all the entire functions f(z) which share a small and finite order meromorphic function a(z) with its derivative, and f(n)(z)−a(z)=0 whenever f(z)−a(z)=0 (n?2). This result is a generalization of several previous results.