Related papers: On the number of harmonic frames

An orthogonal n-frame is an ordered set of n pairwise orthogonal vectors. The set of all orthogonal n-frames in a d-dimensional quadratic vector space is an algebraic variety V(d,n). In this paper, we investigate the variety V(d,n) as well…

We enumerate labelled and unlabelled Hamiltonian cycles in complete $n$-partite graphs $K_{d,d,\ldots,d}$ having exactly $d$ vertices in each part (in other words, Tur\'an graphs $T(nd, n))$. We obtain recurrence relations that allow us to…

A tight Hamilton cycle in a $k$-uniform hypergraph ($k$-graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms an edge. R\"{o}dl, Ruci\'{n}ski, and Szemer\'{e}di proved…

Suppose $G$ is a $k$-uniform hypergraph on $n$ vertices such that every $(k-1)$-subset $S$ of $V(G)$ belongs to at least $\delta n$ edges, where $\delta> 1/2$. Let $\Psi(G)$ denote the number of tight Hamilton cycles in $G$, that is, cyclic…

Many tight frames of interest are constructed via their Gramian matrix (which determines the frame up to unitary equivalence). Given such a Gramian, it can be determined whether or not the tight frame is projective group frame, i.e., is the…

We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. The diagram vector of a vector in R2 was previously defined using polar coordinates and was used to characterize…

We study Hamilton cycles and perfect matchings in a uniform attachment graph. In this random graph, vertices are added sequentially, and when a vertex $t$ is created, it makes $k$ independent and uniform choices from $\{1,\dots,t-1\}$ and…

Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph on $n$ vertices is uniquely maximised by…

We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Orbit harmonics is a tool in combinatorial representation theory which promotes the (ungraded) action of a linear group $G$ on a finite set $X$ to a graded action of $G$ on a polynomial ring quotient by viewing $X$ as a $G$-stable point…

It is a classical result that a random permutation of $n$ elements has, on average, about $\log n$ cycles. We generalise this fact to all directed $d$-regular graphs on $n$ vertices by showing that, on average, a random cycle-factor of such…

Frame theory has been a popular subject in the design of structured signals and codes in recent years, with applications ranging from the design of measurement matrices in compressive sensing, to spherical codes for data compression and…

A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every $k$ consecutive vertices from an edge. We show that for $k\geq 3$, every red-blue edge-coloured complete $k$-graph on $n$ vertices contains $k$…

The collection of $d \times N$ complex matrices with prescribed column norms and prescribed (nonzero) singular values forms a compact algebraic variety, which we refer to as a frame space. Elements of frame spaces -- i.e., frames -- are…

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…

We study an analogue of the conjugacy growth function in finitely generated groups: the automorphic growth function. This counts the number of automorphic orbits that intersect the ball of radius $n$ in the group. We show that this is not a…

We introduce a class of finite tight frames called prime tight frames and prove some of their elementary properties. In particular, we show that any finite tight frame can be written as a union of prime tight frames. We then characterize…

We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $k \ge 2$) on $n$ labeled vertices: $\mathbb G^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $\mathbb R^{(k)}(n,d)$, the random…

In this paper we study the following problem. Let $A$ be a fixed graph, and let $\hom(G,A)$ denote the number of homomorphisms from a graph $G$ to $A$. Furthermore, let $v(G)$ denote the number of vertices of $G$, and let $\mathcal{G}_d$…