Related papers: Four-class Skew-symmetric Association Schemes
Let ${\cal M}$ denote the Bose--Mesner algebra of a commutative $d$-class association scheme ${\mathfrak X}$ (not necessarily symmetric), and $\Gamma$ denote a (strongly) connected (directed) graph with adjacency matrix $A$. Under the…
On a complex manifold $(M,J)$, we interpret complex symplectic and pseudo-K\"ahler structures as symplectic forms with respect to which $J$ is, respectively, symmetric and skew-symmetric. We classify complex symplectic structures on…
It was noted already in the 90s that many classic graph classes, such as interval, chordal, and bipartite graphs, can be characterized by the existence of an ordering of the vertices avoiding some ordered subgraphs, called patterns. Very…
{Let ${\Cal X}$ be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices $T$ such that $(PT)^3=I$. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming…
The symmetry algebras of certain families of quantum spin chains are considered in detail. The simplest examples possess m states per site (m\geq2), with nearest-neighbor interactions with U(m) symmetry, under which the sites transform…
A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph $(m;n)$-regular if every vertex has only degree $m$ or $n$. In…
Some skew-symmetrizable integer exchange matrices are associated to ideal (tagged) triangulations of marked bordered surfaces. These exchange matrices admits unfoldings to skew-symmetric matrices. We develop an combinatorial algorithm that…
We propose a family of four-parameter distributions that contain the K-distribution as special case. The family is derived as a mixture distribution that uses the three-parameter reflected Gamma distribution as parental and the…
A Tatra association scheme is an association scheme arising from a symmetric bilinear form defined on the equivalence classes of nonzero $2$-dimensional vectors modulo some subgroup of the multiplicative group of a finite field. In the…
In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial geometric designs and certain regular graphs having three…
By using a generalization of Sturm-Liouville problems in $q$-difference spaces, a class of symmetric $q$-orthogonal polynomials with four free parameters is introduced. The standard properties of these polynomials, such as a second order…
We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…
Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…
An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
Accidental symmetries in effective field theories can be established by computing and comparing Hilbert series. This invites us to study them with the tools of invariant theory. Applying this technology, we spotlight three classes of…
Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…
We classify the symmetric association schemes with faithful spherical embedding in 3-dimensional Euclidean space. Our result is based on previous research on primitive association schemes with $m_1 = 3$.
A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…
We provide a systematic treatment of the tenfold way of classifying fermionic systems that naturally allows for the study of those with arbitrary $N$-body interactions. We identify four types of symmetries that such systems can possess,…