相关论文: Negative Latin square type partial difference sets…

Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…

We give an algebro-geometric construction of some of the non-arithmetic ball quotients constructed by the author, Parker and Paupert. The new construction reveals a relationship between the corresponding orbifold fundamental groups and the…

A three-step method due to Nijhoff and Bobenko & Suris to derive a Lax pair for scalar partial difference equations (P\Delta Es) is reviewed. The method assumes that the P\Delta Es are defined on a quadrilateral, and consistent around the…

In 2008, Cavenagh and Dr\'{a}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…

Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L $\infty$$\lambda$. We prove that…

Gowers and Hatami initiated the inverse theory for the uniformity norms $U^k$ of matrix-valued functions on non-abelian groups by proving a $1\%$-inverse theorem for the $U^2$-norm and relating it to stability questions for almost…

We construct type A partially-symmetric Macdonald polynomials $P_{(\lambda \mid \gamma)}$, where $\lambda \in \mathbb{Z}_{\geq 0}^{n-k}$ is a partition and $\gamma \in \mathbb{Z}_{\geq 0}^k$ is a composition. These are polynomials which are…

An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…

Strongly regular graphs (SRGs) are highly symmetric combinatorial objects, with connections to many areas of mathematics including finite fields, finite geometries, and number theory. One can construct an SRG via the Cayley Graph of a…

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

The abelian sandpile models feature a finite abelian group $G$ generated by the operators corresponding to particle addition at various sites. We study the canonical decomposition of $G$ as a product of cyclic groups $G = Z_{d_1} \times…

A (partial) Latin square is a table of multiplication of a (partial) quasigroup. Multiplication of a (partial) quasigroup may be considered as a set of triples. We give a necessary and sufficient condition when a set of triples is a…

Since the classification of discrete Painlev\'e equations in terms of rational surfaces, there has been much interest in the range of integrable equations arising from each of the 22 surface types in Sakai's list. For all but the most…

For an abelian number field of odd degree, we study the structure of its 2-Selmer group as a bilinear space and as a Galois module. We prove structural results and make predictions for the distribution of unit signature ranks and narrow…

We discuss the non autonomous nonlinear partial difference equations belonging to Boll classification of quad graph equations consistent around the cube. We show how starting from the compatible equations on a cell we can construct the…

This paper is a new contribution to the study of regular subgroups of the affine group $AGL_n(F)$, for any field $F$. In particular we associate to any partition $\lambda\neq (1^{n+1})$ of $n+1$ abelian regular subgroups in such a way that…

Given a prime $p$, we construct a permutation group containing at least $p^{p-2}$ non-conjugated regular elementary abelian subgroups of order $p^3$. This gives the first example of a permutation group with exponentially many non-conjugated…

A \emph{Latin square} is a matrix of symbols such that each symbol occurs exactly once in each row and column. A Latin square $L$ is \emph{row-Hamiltonian} if the permutation induced by each pair of distinct rows of $L$ is a full cycle…

To construct ternary "quaternions" following Hamilton we must introduce two "imaginary "units, $q_1$ and $q_2$ with propeties $q_1^n=1$ and $q_2^m=1$. The general is enough difficult, and we consider the $m=n=3$. This case gives us the…

We consider three families of groups: the Bianchi groups SL(2,O) where O is the ring of integers of an imaginary, quadratic field; the groups SL*(2,O) where O is a *-order of a definite, rational quaternion algebra with an orthogonal…