Related papers: Amorphic association schemes with negative Latin s…
A Latin square of order $n$ is an $n \times n$ matrix of $n$ symbols, such that each symbol occurs exactly once in each row and column. For an odd prime power $q$ let $\mathbb{F}_q$ denote the finite field of order $q$. A quadratic Latin…
Given a positive definite even lattice and a commutative ring, there is a standard construction of a lattice vertex algebra over the commutative ring, and it admits a natural grading by non-negative integers. We describe the groups of…
Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
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…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
An amorphic association scheme has the property that any of its fusion is also an association scheme. In this paper we generalize the property to be amorphic to an arbitrary C-algebra and prove that any amorphic C-algebra is determined up…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
Gowers and Hatami initiated the inverse theory for the uniformity norms $U^k$ of matrix-valued functions on non-abelian groups by proving a $1\%$-inverse theorem for the $U^2$-norm and relating it to stability questions for almost…
In this paper, we obtain classification results for higher-dimensional analogues of classical association schemes called association schemes on triples (ASTs). We present an algorithm that enumerates all ASTs on a fixed number of vertices…
We study the structure of Lie groups admitting left invariant abelian complex structures in terms of commutative associative algebras. If, in addition, the Lie group is equipped with a left invariant Hermitian structure, it turns out that…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
Association schemes form one of the main objects of algebraic combinatorics, classically defined on finite sets. In this paper we define association schemes on arbitrary, possibly uncountable sets with a measure. We study operator…
In this paper we introduce two new methods for constructing harmonic morphisms from solvable Lie groups. The first method yields global solutions from any simply connected nilpotent Lie group and from any Riemannian symmetric space of…
Given any simple biorientable graph it is shown that there exists a weak {*}-Hopf algebra constructed on the vector space of graded endomorphisms of essential paths on the graph. This construction is based on a direct sum decomposition of…
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for…
We study "positive" graphs that have a nonnegative homomorphism number into every edge-weighted graph (where the edgeweights may be negative). We conjecture that all positive graphs can be obtained by taking two copies of an arbitrary…
For a finite triangulation of the plane with faces properly coloured white and black, let A be the abelian group constructed by labelling the vertices with commuting indeterminates and adding relations which say that the labels around each…
We classify certain non-symmetric commutative association schemes. As an application, we determine all the primitive weakly distance-regular circulant digraphs.