8 citations · 13 across the 9 of their papers we have counts for
9 papers
Comparing different approaches to the concept of determinant: the multiplicative approach is the best!
Peteris Daugulis, Mikhail H Klin, Anita Sondore
The determinant is traditionally introduced through permutation expansions, multilinearity, or recursive expansion formulas - approaches that, while rigorous, often obscure its con…
Directed strongly regular graphs from groups, loops and quasigroups
Štefan Gyürki, Mikhail Klin
We introduce four infinite families of directed strongly regular graphs of orders and . The constructions are described in terms of groups, quasigroups, loops and thei…
On Jordan schemes
Mikhail Muzychuk, Sven Reichard, Mikhail Klin
In 2003 Peter Cameron introduced the concept of a Jordan scheme and asked whether there exist Jordan schemes which are not symmetrisations of coherent configurations (proper Jordan…
Proper Jordan schemes exist. First examples, computer search, patterns of reasoning. An essay
Mikhail Klin, Mikhail Muzychuk, Sven Reichard
A special class of Jordan algebras over a field of characteristic zero is considered. Such an algebra consists of an -dimensional subspace of the vector space of all square…
Constructive and analytic enumeration of circulant graphs with vertices;
Victoria Gatt, Mikhail Klin, Josef Lauri +1
Two methods, structural (constructive) and multiplier (analytical), of exact enumeration of undirected and directed circulant graphs of orders 27 and 125 are elaborated and represe…
Construction of infinite families of non-Schurian association schemes of order , an odd prime, based on biaffine planes and Heisenberg groups: research report and beyond
Štefan Gyürki, Mikhail Klin
Let be an odd prime. In this paper we provide a construction which gives four non-Schurian association schemes for every and two for . This construction is expla…
Sporadic Examples of Directed Strongly Regular Graphs Obtained by Computer Algebra Experimentation (Extended version)
Štefan Gyürki, Mikhail Klin
We report about the results of the application of modern computer algebra tools for construction of directed strongly regular graphs. The suggested techniques are based on the inve…
Automorphism groups of rational circulant graphs through the use of Schur rings
Mikhail Klin, István Kovács
The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques…
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm
Luitpold Babel, Irina V. Chuvaeva, Mikhail Klin +1
The stabilization algorithm of Weisfeiler and Leman has as an input any square matrix A of order n and returns the minimal cellular (coherent) algebra W(A) which includes A. In cas…