Related papers: Bordered complex Hadamard matrices and strongly re…
A Butson-Hadamard matrix H is a square matrix of dimension n whose entries are complex roots of unity such that HH*= nI. In the first part of this work, some new results on generalized Gray map are studied. In the second part, codes…
It was shown by LeCompte, Martin, and Oweans in 2010 that the existence of mutually unbiased Hadamard matrices and the identity matrix, which coincide with mutually unbiased bases, is equivalent to that of a $Q$-polynomial association…
The goal of this paper is to first define a Hodge theoretic fundamental group for smooth connected complex algebraic varieties and then prove and study a right exact sequence of Hodge theoretic fundamental groups associated to a smooth…
This work is a detailed version of arXiv:0704.0195 [math.QA]. We introduce a new notion of the core of a braided fusion category. It allows to separate the part of a braided fusion category that does not come from finite groups. We also…
In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
This paper gives an algebraic presentation of the fused Hecke algebra which describes the centraliser of tensor products of the $U_q(gl_N)$-representation labelled by a one-row partition of any size with vector representations. It is…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
That finite-dimensional simple Lie algebras over the complex numbers can be classified by means of purely combinatorial and geometric objects such as Coxeter-Dynkin diagrams and indecomposable irreducible root systems, is arguably one of…
A set of edges $F$ in a graph $G$ is an edge dominating set if every edge in $G$ is either in $F$ or shares a vertex with an edge in $F$. $G$ is said to be well-edge-dominated if all of its minimal edge dominating sets have the same…
The incidence matrix of a graph is totally unimodular if and only if the graph is bipartite, i.e., it contains no odd cycles. We extend the characterization of total unimodularity to hypergraphs whose hyperedges of size at least four are…
We study deformations of cluster algebras with several quantum parameters, called toroidal cluster algebras, which naturally appear in the study of Grothendieck rings of representations of quantum affine algebras. In this context, we…
The notion of robust expansion has played a central role in the solution of several conjectures involving the packing of Hamilton cycles in graphs and directed graphs. These and other results usually rely on the fact that every robustly…
A complete choice of generators of the center of the enveloping algebras of real quasi-simple Lie algebras of orthogonal type, for arbitrary dimension, is obtained in a unified setting. The results simultaneously include the well known…
Two submatrices $A,D$ of a Hadamard matrix $H$ are called complementary if, up to a permutation of rows and columns, $H=[^A_C{\ }^B_D]$. We find here an explicit formula for the polar decomposition of $D$. As an application, we show that…
Green and Schroll give an easy criterion for a monomial algebra $A$ to be quasi-hereditary with respect to some partial order $\leq_A$. A natural follow-up question is under which conditions a monomial quasi-hereditary algebra $(A, \leq_A)$…
The centralizer algebra of a matrix consists of those matrices that commute with it. We investigate the basic representation-theoretic invariants of centralizer algebras, namely their radicals, projective indecomposable modules, injective…
By constructing explicit examples, we show that the core of a group-like element in a cocommutative cosemisimple Yetter-Drinfel'd Hopf algebra over the group ring of a finite abelian group is not always completely trivial.
We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…