Related papers: Association Scheme on Triples from the Unitary Gro…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
H. Cohn et. al. proposed an association scheme of 64 points in R^{14} which is conjectured to be a universally optimal code. We show that this scheme has a generalization in terms of Kerdock codes, as well as in terms of maximal real…
We can obtain a non-symmetric class $2$ association scheme by a skew-Hadamard matrix. We begin with a skew-Hadamard matrix of order $n$, construct a skew-Hadamard matrix of order $2n$ by doubling construction, and a non-symmetric class $2$…
Every two seeds in a field of fractions $\mathcal{F}$ together with a symmetric group element gives rise to an automorphism of $\mathcal{F}$ called an exchange automorphism. For positive cluster algebras, we provide equivalent conditions…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
The classical theory of the cross-ratio is a beautiful case study of the moduli of ordered points of the projective line and of invariants of the action of $PGL_2$. We generalize the theory of the cross-ratio to the setting of $S$-valued…
Let $\mathbb{F}$ be any field. The Grassmannian $\mathrm{Gr}(m,n)$ is the set of $m$-dimensional subspaces in $\mathbb{F}^n$, and the general linear group $\mathrm{GL}_n(\mathbb{F})$ acts transitively on it. The Schubert cells of…
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square type graphs and whose underlying set is a…
In this paper, we determine the connected component of the automorphism group scheme of Matsuo algebras over fields of characteristic not $3$.
In this paper, we study the category of trigroups as a generalization of the notion of digroup [4] and analyze their relationship with 3-racks [1] and Leibniz 3-algebras [6]. Trigroups are essentially associative trioids in which there are…
People organize in groups and contagions spread across them. A simple stochastic process, yet complex to model due to dynamical correlations within and between groups. Moreover, groups can evolve if agents join or leave in response to…
We characterize isotropic trialitarian triples in terms of the Schur indices of the underlying algebras over a base field $F$ of arbitrary characteristic satisfying $I_q^3 F=0$. We also construct anisotropic trialitarian triples over such…
Let $p$ be an odd prime. In this paper we provide a construction which gives four non-Schurian association schemes for every $p\geq 5$ and two for $p=3$. This construction is explained using incidences between points and lines of a biaffine…
Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…
A Steiner triple system STS$(v)$ is called $f$-pyramidal if it has an automorphism group fixing $f$ points and acting sharply transitively on the remaining $v-f$ points. In this paper, we focus on the STSs that are $f$-pyramidal over some…
We revisit the group structure on elliptic curves and give a simple and elementary proof of the associativity of the addition. We do this by providing an explicit formula for the sum of three points, only using the explicit definition of…
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central role in a classical characterization of interval graphs by…
We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…
We present a formalism for the scattering of an arbitrary linear or acyclic branched structure build by joining mutually non-interacting arbitrary functional sub-units. The formalism consists of three equations expressing the structural…