8 papers
Complex generalised weighing matrices in centraliser algebras of monomial representations
Ronan Egan, Padraig à Catháin, Andrea Švob
An matrix with exactly non-zero entries taken from the set of complex roots of unity in each row and column satisfying is a com…
The existence of some directed strongly regular graphs on 54 and 108 vertices
Dean CrnkoviÄ, Andrea Å vob, Matea ZuboviÄ Å½utolija
In this paper, we prove the existence of directed strongly regular graphs with parameters (108,11,3,2,1), (108,14,10,0,2), (108,22,12,6,4), (108,23,9,8,4), (108,25,15,8,5), (108,34…
A universal theory of switching for combinatorial objects, and applications to complex Hadamard matrices
Dean CrnkoviÄ, Ronan Egan, Andrea Å vob
The concept of switching has arisen in several different areas within combinatorics. The act of switching usually transforms a combinatorial object into a non-isomorphic object of…
New directed strongly regular graphs on 60 vertices
Dean Crnkovic, Andrea Svob, Matea Zubovic Zutolija
We prove the existence of directed strongly regular graphs with parameters (60,21,11,6,8), (60,22,12,8,8), (60,24,10,9,10), (60,25,17,8,12), (60,27,21,12,12) and (60,28,20,14,12).…
Constructions of self-orthogonal and LCD subspace codes
Dean CrnkoviÄ, Keita Ishizuka, Hadi Kharaghani +2
Recently, the notions of self-orthogonal subspace codes and LCD subspace codes were introduced, and LCD subspace codes obtained from mutually unbiased weighing matrices were studie…
Transitive regular -analogs of graphs
Dean Crnkovic, Vedrana Mikulic Crnkovic, Andrea Svob +1
In 1976, Delsarte introduced the notion of -analogs of designs, and -analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by givi…