Related papers: Amorphic association schemes with negative Latin s…
We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions. A complete set of such monomials defines a mutually unbiased basis…
We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial…
Let $A$ be a split finite-dimensional associative unital algebra over a field. The first main result of this note shows that if the Ext-quiver of $A$ is a simple directed graph, then $HH^1(A)$ is a solvable Lie algebra. The second main…
The Norton product is defined on each eigenspace of a distance regular graph by the orthogonal projection of the entry-wise product. The resulting algebra, known as the Norton algebra, is a commutative nonassociative algebra that is useful…
Leading towards the classification of primitive commutative association schemes as the ultimate goal, Bannai and some of his school have been trying to * identify the major sources of (primitive) commutative association schemes, * collect…
Let $k$ be an algebraically closed field and $\alpha$, $\beta$, $\gamma$ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent $k$-linear operators of Jordan types $\alpha$, $\beta$, and…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
To any $n \times n$ Latin square $L$, we may associate a unique sequence of mutually orthogonal permutation matrices $P = P_1, P_2, ..., P_n$ such that $L = L(P) = \sum kP_k$. Brualdi and Dahl (2018) described a generalisation of a Latin…
Let $\mathcal{R}$ be an association scheme with nontrivial relations $A_1,\ldots,A_d$. We call $\mathcal{R}$ amorphic if every possible fusion of its nontrivial relations gives rise to a fusion scheme. We define the fusing-relations…
We show that under certain conditions the square of the graph obtained by identifying a vertex in two graphs with hamiltonian square is also hamiltonian. Using this result, we prove necessary and sufficient conditions for hamiltonicity of…
Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…
This is a slightly corrected version of the article published by Functional Analysis and its Applications in 1993. We define the quadratic duality for algebras with nonhomogeneous relations; the duality between the algebra of differential…
A class of differential calculi is explored which is determined by a set of automorphisms of the underlying associative algebra. Several examples are presented. In particular, differential calculi on the quantum plane, the $h$-deformed…
Recently, many graph matching methods that incorporate pairwise constraint and that can be formulated as a quadratic assignment problem (QAP) have been proposed. Although these methods demonstrate promising results for the graph matching…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
Let $\mathfrak{g}$ be an untwisted affine Lie algebra with associated Weyl group $W_a$. To any level 0 weight $\gamma$ we associate a weighted graph $\Gamma_\gamma$ that encodes the orbit of $\gamma$ under the action $W_a$. We show that the…
In this paper we will prove that there exists a covariant functor from the category of schemes to the category of graphs. This functor provides a combination between algebraic varieties and combinatorial graphs so that the invariants…
We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of…
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…
This paper studies the existence of invariant smooth Lagrangian graphs for Tonelli Hamiltonian systems with symmetries. In particular, we consider Tonelli Hamiltonians with n independent but not necessarily involutive constants of motion…