Related papers: The search for small association schemes with nonc…
Let $\mathbf{B}$ be a basis for an $r$-dimensional algebra $A$ over a field or commutative ring with unity. The semifusions of $\mathbf{B}$ are the partitions of $\mathbf{B}$ whose characteristic functions form the basis of a subalgebra of…
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…
We study cyclotomic association schemes over a finite commutative ring $R$ with identity. The main interest for us is to identify the normal cyclotomic schemes $C$, i.e. those for which $Aut(C)$ is a subgroup of the one-dimensional affine…
In this paper we present a complete classification (isomorphism classes with some isomorphism invariants) of complex associative algebras up to dimension five (including both cases: unitary and non-unitary). In some symbolic computations we…
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…
A (di)graph $\Gamma$ generates a commutative association scheme $\mathfrak{X}$ if and only if the adjacency matrix of $\Gamma$ generates the Bose-Mesner algebra of $\mathfrak{X}$. In [17, Theorem 1.1], Monzillo and Penji\'{c} proved that,…
Using the diagrammatic method, we derive a set of self-consistent equations that describe eigenvalue distributions of large correlated asymmetric random matrices. The matrix elements can have different variances and be correlated with each…
We classify the Q-polynomial association schemes with $m_{1} = 4$ which are partially metric with respect to the nearest neighbourhood relation. An association scheme is partially metric with respect to a relation $R_1$ if the scheme graph…
A symmetry classification of possible interactions in a diatomic molecular chain is provided. For nonlinear interactions the group of Lie point transformations, leaving the lattice invariant and taking solutions into solutions, is at most…
In a previous paper we developed a formalism to construct (potentially) supersymmetric theories in the context of noncommutative geometry. We apply this formalism to explore the existence of a noncommutative version of the minimal…
We describe a novel algorithm for solving general parametric (nonlinear) eigenvalue problems. Our method has two steps: first, high-accuracy solutions of non-parametric versions of the problem are gathered at some values of the parameters;…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…
{Let ${\Cal X}$ be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices $T$ such that $(PT)^3=I$. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
This paper establishes a new comparison principle for the minimum eigenvalue of a sum of independent random positive-semidefinite matrices. The principle states that the minimum eigenvalue of the matrix sum is controlled by the minimum…
This paper studies the concept of algorithmic equiresolution of a family of embedded varieties or ideals, which means a simultaneous resolution of such a family compatible with a given (suitable) algorithm of resolution in characteristic…
The nonnegative rank of a matrix A is the smallest integer r such that A can be written as the sum of r rank-one nonnegative matrices. The nonnegative rank has received a lot of attention recently due to its application in optimization,…
The principal observation of the present paper is that an inner isotopy (i.e. a principal isotopy defined by an algebra endomorphism) is a very helpful instrument in constructing and studying interesting classes of nonassociative algebras.…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…