Check Character Systems using Quasigroups: I

We consider check character systems with one check character over an arbitrary quasigroup under different check equations which have one permutation. The aim of using such a system is to discover transmission errors. These systems always detect all single errors (that is errors only one component of a code word). We establish necessary and sufficient conditions for a general quasigroup check character system over this quasigroup to be able to detect all transpositions. jump transpositions, twin errors and jump twin errors. We also study capabilities of check character systems over loops, in particular, over Moufang loops and groups when the permutation in the check equations is the identify permutation.Communicated by: P. Wild     

Check digit systems over groups and anti-symmetric mappings

A check digit system over a group which detects all single errors and all adjacent transpositions exists if and only if the group possesses an anti-symmetric mapping. In this article we give a characterisation for (anti-)automorphisms to be anti-symmetric, show how anti-automorphisms are used to construct new anti-symmetric mappings from others and give an upper bound for the number of anti-symmetric mappings of a group. For groups with sign structure, particularly the dihedral group, we present a further construction for anti-symmetric mappings. The fact that groups of order 2(2k + 1) have a non-trivial sign-structure leads to a very short proof that groups of order 2(2k + 1) possess no complete mapping. Finally we show that over the dihedral group D_m, m odd, no check digit system exists, which detects all jump transpositions or all twin errors or all jump twin errors.     

Permutations of finite fields for check digit systems

Let q be a prime power. For a divisor n of q ? 1 we prove an asymptotic formula for the number of polynomials of the form

$f(X)=\frac{a-b}{n}\left(\sum_{j=1}^{n-1}X^{j(q-1)/n}\right)X+\frac{a+b(n-1)}{n}X\in\mathbb{F}_q[X]$

such that the five (not necessarily different) polynomials f(X), f(X)±X and f(f(X))±X are all permutation polynomials over \({\mathbb{F}_q}\) . Such polynomials can be used to define check digit systems that detect the most frequent errors: single errors, adjacent transpositions, jump transpositions, twin errors and jump twin errors.

     

Two finite embedding theorems for partial 3-quasigroups

In this paper it is shown that a finite partial (x, x, y) = y 3-quasigroup can be embedded in a finite (x, x, y) = y 3-quasigroup. This result coupled with the technique of proof is then used to show that a finite partial almost Steiner 3-quasigroup {(x, x, y) = y, (x, y, z) = (x, z, y) = (y, x, z)} can be embedded in a finite almost Steiner 3-quasigroup. Almost Steiner 3-quasigroups are of more than passing interest because just like Steiner 3-quasigroups ( = Steiner quadruple systems) all of their derived quasigroups are Steiner quasigroups.     

Self-orthogonal cyclicn-quasigroups

A quasigroup (Q,) satisfying the identityx(yx) =y (or the equivalent identity (xy)x =y) is called semisymmetric. Ann-quasigroup (Q, A) satisfying the identityA(A(x ₁, ...,x _n ),x ₁, ...,x _n–1) =x _n is called cyclic. So, cyclicn-quasigroups are a generalization of semisymmetric quasigroups. In this paper, self-orthogonal cyclicn-quasigroups (SOCnQs) are considered. Some constructions ofSOCnQs are described and the spectrum of suchn-quasigroups investigated.     

Varieties of quasigroups arising from 2-perfect m-cycle systems

For m = 6 and for all odd composite integers m, as well as for all even integers m 10 that satisfy certain conditions, 2-perfect m-cycle systems are constructed whose quasigroups have a homomorphism onto quasigroups which do not correspond to a 2-perfect m-cycle systems. Thus it is shown that for these values of m the class of quasigroups arising from all 2-perfect m-cycle systems does not form a variety.     

Some (2,n) combinatorial Stein groupoids

A Stein groupoid (quasigroup) is a groupoid (quasigroup) satisfying the identityx(xy)=yx. We show that, for certain two variable identities, the variety of Stein groupoids defined by any one of these identities has the properties that every groupoid in the variety is a quasigroup and that the free groupoid generated by two elements is of finite (small) order which we determine. These results provide characterizations of some Stein quasigroups of small order and we give some further characterizations involving other identities.     

A graph-theoretic approach to quasigroup cycle numbers

Norton and Stein associated a number with each idempotent quasigroup or diagonalized Latin square of given finite order n, showing that it is congruent mod 2 to the triangular number T(n). In this paper, we use a graph-theoretic approach to extend their invariant to an arbitrary finite quasigroup. We call it the cycle number, and identify it as the number of connected components in a certain graph, the cycle graph. The congruence obtained by Norton and Stein extends to the general case, giving a simplified proof (with topology replacing case analysis) of the well-known congruence restriction on the possible orders of general Schroeder quasigroups. Cycle numbers correlate nicely with algebraic properties of quasigroups. Certain well-known classes of quasigroups, such as Schroeder quasigroups and commutative Moufang loops, are shown to maximize the cycle number among all quasigroups belonging to a more general class.     

On multiplication groups of relatively free quasigroups isotopic to Abelian groups

If Q is a quasigroup that is free in the class of all quasigroups which are isotopic to an Abelian group, then its multiplication group Mlt Q is a Frobenius group. Conversely, if Mlt Q is a Frobenius group, Q a quasigroup, then Q has to be isotopic to an Abelian group. If Q is, in addition, finite, then it must be a central quasigroup (a T-quasigroup).This work was supported by institutional grant MSM 113200007, and by Grant Agency of Czech Republic, grant number 201/99/0263.     

Shift error detection in standardized exams

Hundreds of millions of multiple choice exams are given every year in the United States. These exams permit form-filling shift errors, where an absent-minded mismarking displaces a long run of correct answers. A shift error can substantially alter the exam's score, and thus invalidate it.In this paper, we develop algorithms to accurately detect and correct shift errors, while guaranteeing few false detections. We propose a shift error model, and probabilistic methods to identify shifted exam regions.We describe the results of our search for shift errors in undergraduate Stony Brook exam sets, and in over 100,000 Scholastic Amplitude Tests. These results suggest that approximately 2% of all tests contain shift errors. Extrapolating these results over all multiple choice exams and forms leads us to conclude that exam takers make millions of undetected shift errors each year.Employing probabilistic shift correcting systems is inherently dangerous. Such systems may be taken advantage of by clever examinees, who seek to increase the probability of correct guessing. We conclude our paper with a short study of optimal guessing strategies when faced with a generous shift error correcting system.     

Separation in topological algebras

One of the basic results from the theory of topological groups is that aT ₀ topological group is already completely regular. It is also known [1] thatT ₀ quasigroups are regular. Taylor [8] showed that a fragment of these results holds in any congruence permutable variety, namely that in such a variety aT ₀ topological algebra is already Hausdorff. Gumm [2] extended this result to 3-permutable varieties and showed that, more generally,T ₀ topological algebras in congruencen-permutable varieties areT ₁. In this paper we show thatT ₀ topological algebras inn-permutable varieties satisfy a separation condition strictly stronger thanT ₁. We also give some counterexamples that show that some of these separation results are the best possible.Presented by S. Burris.This research was part of the author's thesis at The University of Colorado, directed by Walter Taylor. The author wishes to thank professor Taylor for his many contributions.     

Idempotency of Extensions via the Bicompletion

Let Top ₀ be the category of topological T ₀-spaces, QU ₀ the category of quasi-uniform T ₀-spaces, T : QU ₀ → Top ₀ the usual forgetful functor and K : QU ₀ → QU ₀ the bicompletion reflector with unit k : 1 → K. Any T-section F : Top ₀ → QU ₀ is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU ₀ is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).     

On Parity Vectors of Latin Squares

The parity vectors of two Latin squares of the same side n provide a necessary condition for the two squares to be biembeddable in an orientable surface. We investigate constraints on the parity vector of a Latin square resulting from structural properties of the square, and show how the parity vector of a direct product may be obtained from the parity vectors of the constituent factors. Parity vectors for Cayley tables of all Abelian groups, some non-Abelian groups, Steiner quasigroups and Steiner loops are determined. Finally, we give a lower bound on the number of main classes of Latin squares of side n that admit no self-embeddings.     

TheK-theory of AF embeddings of the rational rotation algebras

Our main result is the construction of an embedding ofC(T²) into an approximately finite-dimensionalC ^*-algebra which induces an injection onK ₀(C(T²)). The existence of this embedding implies that Cech cohomology cannot be extended to a stable, continuous homology theory forC ^*-algebras which admits a well-behaved Chern character. Homotopy properties ofC ^*-algebras are also considered. For example, we show that the second homotopy functor forC ^*-algebras is discontinuous. Similar embeddings are constructed for all the rational rotation algebras, with the consequence that none of the rational rotation algebras satisfies the homotopy property called semiprojectivity.     

On general two-scale convergence and its application to the characterization of <Emphasis Type="Italic">G</Emphasis>-limits

We characterize some G-limits using two-scale techniques and investigate a method to detect deviations from the arithmetic mean in the obtained G-limit provided no periodicity assumptions are involved. We also prove some results on the properties of generalized two-scale convergence.     

Coverings of [MO n ] and minimal orthomodular lattices

If T is an orthomodular lattice (OML), we denote by [T] the equational class generated by T. In this paper we characterize the finite OMLs T such that [T] covers some [MO _n ]. These OMLs T are the non-modular OMLs such that all proper sub-OMLs of T are modular. An OML satisfying that last property is called minimal. There exist infinitely many minimal OMLs provided by quadratic spaces over finite fields. We describe them and give a new way to represent their Greechie diagrams in two separate parts. Other methods to obtain finite minimal OMLs are given. Received May 14, 2005; accepted in final form May 30, 2007.     

T D property and spatial sublocales

As one of main backgrounds of locale theory, topologies have close connections with locales. But locales have other backgrounds such as algebra, mathematical logic, etc. So there are many differences between locales and topologies. Spatiality is an important localic property to investigate the connections between locales and topologies. TheT _D property is a special separation property which plays an important role in this kind of investigations. Just as it will be proved in this paper, theT _D property often appears as the lowest requirement for many topological spaces such that they can be described with localic properties and vice versa. In this paper, we show these special properties of theT _D axiom and investigate some other interesting and important problems ofT _D -spatiality of locales.Supported by the National Natural Science Foundation of China and the Science Foundation of the State Education Commision of China.Supported by the Fund for Excellent Young University Teachers of the State Educational Commission of China and theE _x -Oversea-Scholars Fund of the Educational Commission of China.     

Perimeter preserver of matrices over semifields

For a rank-1 matrix A = ab ^t, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over semifields. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices over semifields if and only if it has the form T(A) = U AV, or T(A) = U A ^t V with some invertible matrices U and V. This work was supported by the research grant of the Cheju National University in 2006.     

Napoleon’s quasigroups

Napoleon’s quasigroups are idempotent medial quasigroups satisfying the identity (ab·b)(b·ba) = b. In works by V. Volenec geometric terminology has been introduced in medial quasigroups, enabling proofs of many theorems of plane geometry to be carried out by formal calculations in a quasigroup. This class of quasigroups is particularly suited for proving Napoleon’s theorem and other similar theorems about equilateral triangles and centroids.     

Codes Over the p-adic Integers

We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4).