相关论文: Autoparatopisms of Quasigroups and Latin Squares

We extend the lattice-theoretic approach of Brandhorst--Cattaneo to classify algebraically trivial actions on the known IHS manifolds, up to deformation and birational conjugacy. In particular, we classify even order algebraically trivial…

We study automorphisms of quasi-smooth hypersurfaces in weighted projective spaces, extending classical results for smooth hypersurfaces in projective space to the weighted setting. We establish effective criteria for when a power of a…

This article initiates a geometric study of the automorphism groups of general graph products of groups, and investigates the algebraic and geometric structure of automorphism groups of cyclic product of groups. For a cyclic product of at…

In this paper, we explain how the classical Catalan families of objects involving paths, tableaux, triangulations, parentheses configurations and more generalize canonically to a three-dimensional version. In particular, we present…

An array is row-Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row-Latin. A transversal in an $n\times n$ array is a selection of $n$ different symbols from different rows and different…

In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…

In this paper we introduce the notion of parabolic-like mapping, which is an object similar to a polynomial-like mapping, but with a parabolic external class, i.e. an external map with a parabolic fixed point. We prove a straightening…

To any $n \times n$ Latin square $L$, we may associate a unique sequence of mutually orthogonal permutation matrices $P = P_1, P_2, ..., P_n$ such that $L = L(P) = \sum kP_k$. Brualdi and Dahl (2018) described a generalisation of a Latin…

An algebraic system from a finite set $\Sigma$ of cardinality $k$ and an $n$-ary operation $f$ invertible in each argument is called an $n$-ary quasigroup of order $k$. An autotopy of an $n$-ary quasigroup $(\Sigma,f)$ is a collection…

The paper deals with quasigroups having a trivial group of automorphisms and a trivial group of autotopisms. Examples of such quasigroups and methods of their verification are given.

A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…

An important step in the determination of the automorphism group of the quantum torus of rank $n$ (or twisted group algebra of $\mathbb Z^n$) is the determination of its so-called non-scalar automorphisms. We present a new algorithimic…

It follows from an observation of A. Coble in 1919 that the automorphism group of an unnodal Enriques surface contains the $2$-congruence subgroup of the Weyl group of the $E_{10}$-lattice. In this article, we determine how much bigger the…

The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…

We give three explicit quantum Latin squares of order $6$, with cardinalities $13$, $15$, and $17$. Throughout, vectors differing only by a global phase are counted as identical. The cardinality-$13$ construction is based on an orthogonal…

Define $QC(n)$ to be the number of quasiplatonic topological actions of the cyclic group $C_n$ on surfaces of genus at least two. We use formulas of Benim and Wootton to give an explicit formula for $QC(n)$. In addition, we relate the…

For integers $n>2$ and $k>0$, an $(n\times n)/k$ semi-Latin square is an $n\times n$ array of $k$-subsets (called blocks) of an $nk$-set (of treatments), such that each treatment occurs once in each row and once in each column of the array.…

Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…

In this paper we are interested in lifting a prescribed group of automorphisms of a finite graph via regular covering projections. Here we describe with an example the problems we address and refer to the introductory section for the…

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…