Quasigroup associativity and biased expansion graphs

@article{Zaslavsky2006QuasigroupAA,
  title={Quasigroup associativity and biased expansion graphs},
  author={Thomas Zaslavsky},
  journal={Electronic Research Announcements of The American Mathematical Society},
  year={2006},
  volume={12},
  pages={13-18}
}
  • T. Zaslavsky
  • Published 10 February 2006
  • Mathematics
  • Electronic Research Announcements of The American Mathematical Society
We present new criteria for a multary (or polyadic) quasigroup to be isotopic to an iterated group operation. The criteria are consequences of a structural analysis of biased expansion graphs. We mention applications to transversal designs and generalized Dowling geometries. 1. Associativity in multary quasigroups A multary quasigroup is a set with an n-ary operation for some finite n ≥ 2, say f : Q → Q, such that the equation f(x1, x2, . . . , xn) = x0 is uniquely solvable for any one variable… 
1 Citations
Associativity in multiary quasigroups: the way of biased expansions
A multiary (polyadic, n-ary) quasigroup is an n-ary operation which is invertible with respect to each of its variables. A biased expansion of a graph is a kind of branched covering graph with an

References

SHOWING 1-10 OF 26 REFERENCES
Associativity in multiary quasigroups: the way of biased expansions
A multiary (polyadic, n-ary) quasigroup is an n-ary operation which is invertible with respect to each of its variables. A biased expansion of a graph is a kind of branched covering graph with an
Solution of Belousov's problem
The authors prove that a local $n$-quasigroup defined by the equation x_{n+1} = F (x_1, ..., x_n) = [f_1 (x_1) + ... + f_n (x_n)]/[x_1 + ... + x_n], where f_i (x_i), i, j = 1, ..., n, are arbitrary
Biased Graphs .III. Chromatic and Dichromatic Invariants
TLDR
This work defines and study the chromatic, dichromatic, and Whitney number polynomials of a biased graph, which generalize those of an ordinary graph, and describes supersolvability, a matroid property which implies the characteristic polynomial has positive integral roots.
Varieties of combinatorial geometries
A hereditary class of (finite combinatorial) geometries is a collection of geometries which is closed under taking minors and direct sums. A sequence of universal models for a hereditary class 'S of
Biased graphs. I. Bias, balance, and gains
Akivis and Vladislav V . Goldberg , Solution of Belousov ’ s problem
  • Discuss . Math . Gen . Algebra Appl .
  • 2001
Bias, balance, and gains, II. The three matroids, III. Chromatic and dichromatic invariants, V. Group and biased expansions
  • MR1007712 (90k:05138); MR1088626 (91m:05056); MR1328292
  • 1989
Encyc. Math. Appl
  • Encyc. Math. Appl
  • 1984
Graph Theory
...
1
2
3
...