Related papers: On separability of Tatra association schemes
Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…
Determining the matrix multiplication exponent $\omega$ is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove $\omega = 2$ by starting with structure tensors of modules of fixed degree…
The main result of this article is the decomposition of tensor products of representations of SL(2) in the sum of irreducible representations parametrized by outerplanar graphs. An outerplanar graph is a graph with the vertices 0, 1, 2,…
We investigate the theory of affine group schemes over a symmetric tensor category, with particular attention to the tangent space at the identity. We show that this carries the structure of a restricted Lie algebra, and can be viewed as…
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…
We prove that any derived equivalence between derived-discrete algebras of finite global dimension is standard, that is, isomorphic to the derived tensor functor by a two-sided tilting complex.
In this paper, we give a method to construct non-symmetric association schemes of class $3$ from non-symmetric association schemes of class $2$. This construction is a non-symmetric analogue of the construction of Taylor graphs as an…
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition…
Irreducible bilinear tensorial concomitants of an arbitrary complex antisymmetric valence-2 tensor are derived in four-dimensional spacetime. In addition these bilinear concomitants are symmetric (or antisymmetric), self-dual (or…
Let $D$ be a connected component of a possibly disconnected reductive group $G$ over an algebraic closed field. We define a partition of $D$ into finitely many Strata each of which is a union of $G^0$-conjugacy classes of fixed dimension.…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
While the surjectivity of the global map in two-dimensional cellular automata (2D CA) is undecidable in general, in specific cases one can often decide if the rule is surjective or not. We attempt to classify as many 2D CA as possible by…
In this paper, we present a complete characterization of mutual-visibility sets in trees. It is shown that a subset $S$ is a mutual-visibility set of a tree $T$ if and only if it coincides with the set of leaves of the Steiner subtree…
The necessary and sufficient conditions for a spacetime with an invariant frame to admit a group of isometries of dimension $r$ are given in terms of the connection tensor $H$ associated with this frame. In Petrov-Bel types I, II and III,…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
We provide a method to construct $t$-designs from weighing matrices and association schemes. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to…
A compatible associative algebra is a vector space equipped with two associative multiplication structures that interact in a certain natural way. This article presents the classification of these algebras with dimension less than four, as…
A binary tanglegram is a pair <S,T> of binary trees whose leaf sets are in one-to-one correspondence; matching leaves are connected by inter-tree edges. For applications, for example in phylogenetics or software engineering, it is required…
An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial…
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…