Related papers: On Pseudocyclic Association Schemes
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…
It is known that cyclic arrangements are the only {\em unavoidable} simple arrangements of pseudolines: for each fixed $m\ge 1$, every sufficiently large simple arrangement of pseudolines has a cyclic subarrangement of size $m$. In the same…
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…
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,…
An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…
A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by…
We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…
The cyclic graph of a group $G$ is the graph whose vertices are the nonidentity elements of $G$ and whose edges connect distinct elements $x$ and $y$ if and only if the subgroup $\langle x,y\rangle$ is cyclic. We obtain information about…
A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of…
An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity…
Given two schemes $S$ and $S'$, we prove that every equivalence between $\mathbf{Sch}_S$ and $\mathbf{Sch}_{S'}$ comes from a unique isomorphism between $S$ and $S'$. This eliminates all Noetherian and finite type hypotheses from a result…
The schurian fusions of the association scheme of a Galois affine plane of prime order are completely identified.
Using the classification of transitive groups of degree $n$, for $2 \leqslant n \leqslant 48$, we classify the Schurian association schemes of order $n$, and as a consequence, the transitive groups of degree $n$ that are $2$-closed. In…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…
The set of all subspaces of a given dimension in a finite classical polar space has a structure of a symmetric association scheme. If the dimension is zero, this is the scheme of the collinearity graph of the space; If the dimension is…
In this note we present a notion of fundamental scheme for Cohen- Macaulay, order 1, irreducible congruences of lines. We show that such a congruence is formed by the k-secant lines to its fundamental scheme for a number k that we call the…
A skew morphism of a finite group $B$ is a permutation $\varphi$ of $B$ that preserves the identity element of $B$ and has the property that for every $a\in B$ there exists a positive integer $i_a$ such that $\varphi(ab) =…