Related papers: The real equiangular tight frames obtained from ra…
Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…
Every finite, self-dual, regular (or chiral) 4-polytope of type {3,q,3} has a trivalent 3-transitive (or 2-transitive) medial layer graph. Here, by dropping self-duality, we obtain a construction for semisymmetric trivalent graphs (which…
We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular…
Fractional minimum positive semidefinite rank is defined from $r$-fold faithful orthogonal representations and it is shown that the projective rank of any graph equals the fractional minimum positive semidefinite rank of its complement. An…
We describe the equivariant cohomology ring of rationally smooth projective embeddings of reductive groups. These embeddings are the projectivizations of reductive monoids. Our main result describes their equivariant cohomology in terms of…
A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…
In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…
In this work, we show that a complex equiangular tight frame (ETF) composed by $N$ vectors in dimension $d$ exists if and only if a certain bistochastic matrix, univocally determined by $N$ and $d$, belongs to a special class of…
Given a collection of graphs $\mathbf{G}=(G_1, \ldots, G_m)$ with the same vertex set, an $m$-edge graph $H\subset \cup_{i\in [m]}G_i$ is a transversal if there is a bijection $\phi:E(H)\to [m]$ such that $e\in E(G_{\phi(e)})$ for each…
Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-arc lies in a unique quadrangle. A graph $\Gamma$ is locally rank 3 if there exists $G\leq…
Complex tight frames can be canonically viewed as elements of a complex Stiefel manifold. We present a class of spaces of such frames which are simply connected relative to the subspace topology. To this class belongs the space of finite…
We classify the ultrahomogeneous complete 3-edge-coloured graphs (3-graphs) with simple theory. This extends Lachlan's result (a corollary of the Effective Classification Theorem for stable structures) classifying the stable homogeneous…
We construct a number of topologically trivial but smoothly non-trivial families of embeddings of 3-manifolds in 4-manifolds. These include embeddings of homology spheres in $S^4$ that are not isotopic but have diffeomorphic complements,…
We introduce the notion of a manifold admitting a simple compact Cartan 3-form $\om^3$. We study algebraic types of such manifolds specializing on those having skew-symmetric torsion, or those associated with a closed or coclosed 3-form…
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…
A simple graph is $3$-rigid if its generic bar-joint frameworks in $R^3$ are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal $3$-rigidity of a simple graph which is obtained from the $1$-skeleton of a…
We give tables of noncompact real forms of maximal reductive subalgebras of complex simple Lie algebras of rank up to 8. These were obtained by computational methods that we briefly describe. We also discuss applications in theoretical…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
This paper studies group frames ($G$-frames) where the unitary group representation can be projective. When the group is abelian, for most combinations $N, n$, we show that $ETF(N,n)$ can only exist for genuinely projective group…
Regular hypermaps with underlying simple hypergraphs are analysed. We obtain an algorithm to classify the regular embeddings of simple hypergraphs with given order, and determine the automorphism groups of regular embedding of simple…