Related papers: Four-class Skew-symmetric Association Schemes
We propose the notion of association schemoids generalizing that of association schemes from small categorical points of view. In particular, a generalization of the Bose-Mesner algebra of an association scheme appears as a subalgebra in…
One may think of a $d$-class association scheme as a $(d+1)$-dimensional matrix algebra over $\mathbb{R}$ closed under Schur products. In this context, an imprimitive scheme is one which admits a subalgebra of block matrices, also closed…
We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard…
Physical systems exhibiting stochastic or chaotic behavior are often amenable to treatment by random matrix models. In deciding on a good choice of model, random matrix physics is constrained and guided by symmetry considerations. The…
We classify the Q-polynomial association schemes with $m_{1} = 4$ which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation $R_1$ if the scheme graph…
In this paper we classify the multiplicity-free skew characters of the symmetric group. Furthermore we show that the Schubert calculus is equivalent to that of skew characters in the following sense: If we decompose the product of two…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…
Penttila and Williford constructed a $4-$class association scheme from a generalized quadrangle with a doubly subtended subquadrangle. We show that an association scheme with appropriate parameters and satisfying some assumption about…
We present a systematic method to classify the four-level system using $SU(4)$ symmetry as the basis group. It is shown that this symmetry allows three dipole transitions which eventually leads to six possible configurations of the…
In this paper, we explore supersymmetric and 2d analogs of the SYK model. We begin by working out a basis of (super)conformal eigenfunctions appropriate for expanding a four-point function. We use this to clarify some details of the 1d…
An association scheme on triples (AST) is a three-dimensional analogue of a classical association scheme. Similar to how a transitive group action produces a Schurian classical association scheme, a two-transitive group action produces an…
In this paper, we give a characterization of the class of all circular-arc graphs whose schemes are association. Moreover, all association schemes which are the scheme of a circular-arc graph are characterized, specially it is proved that…
We classify the pairwise transitive 2-designs, that is, 2-designs such that a group of automorphisms is transitive on the following five sets of ordered pairs: point-pairs, incident point-block pairs, non-incident point-block pairs,…
In this paper, we give a method to construct non-symmetric association schemes of class $3$ from non-symmetric association schemes of class $2$. This construction is a non-symmetric analogue of the construction of Taylor graphs as an…
The group $PGL(2,q)$ has an embedding into $PGL(3,q)$ such that it acts as the group fixing a nonsingular conic in $PG(2,q)$. This action affords a coherent configuration $R(q)$ on the set $L(q)$ of non-tangent lines of the conic. We show…
Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
Homoclinic classes of generic $C^1$-diffeomorphisms are maximal transitive sets and pairwise disjoint. We here present a model explaining how two different homoclinic classes may intersect, failing to be disjoint. For that we construct a…