Search arXivSearch

arXiv · 2308.14987

Latin bitrades derived from quasigroup autoparatopisms

Abstract

In 2008, Cavenagh and Drápal, et al, described a method of constructing Latin trades using groups. The Latin trades that arise from this construction are entry-transitive (that is, there always exists an autoparatopism of the Latin trade mapping any ordered triple to any other ordered triple). Moreover, useful properties of the Latin trade can be established using properties of the group. However, the construction does not give a direct embedding of the Latin trade into any particular Latin square. In this paper, we generalize the above to construct Latin trades embedded in a Latin square $L$, via the autoparatopism group of the quasigroup with Cayley table $L$. We apply this theory to identify non-trivial entry-transitive trades in some group operation tables as well as in Latin squares that arise from quadratic orthomorphisms

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nicholas Cavenagh, Raúl Falcón. 2023-08-29. Latin bitrades derived from quasigroup autoparatopisms. https://arxiv.org/abs/2308.14987

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO