Related papers: On the number of harmonic frames

This article continues a prior investigation of the authors with the goal of extending characterization results of convolutional tight frames from the context of cyclic groups to general finite abelian groups. The collections studied are…

We employ a rotating frame of reference to elucidate high-harmonic generation of circularly polarized light by bicircular driving fields. In particular, we show how the experimentally observed circular components of the high-harmonic…

In this paper, we consider the conjugacy growth function of a group, which counts the number of conjugacy classes which intersect a ball of radius $n$ centered at the identity. We prove that in the case of virtually polycyclic groups, this…

Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…

In an $r$-uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of $r$ vertices. We provide a first…

We give a number of algorithms for constructing unitary matrices and tight frames with specialized properties. These were produced at the request of researchers at the Frame Research Center (www.framerc.org) to help with their research on…

We investigate the simple harmonic oscillator in a 1-d box, and the 2-d isotropic harmonic oscillator problem in a circular cavity with perfectly reflecting boundary conditions. The energy spectrum has been calculated as a function of the…

We show that real tight frames that generate lattices must be rational, and use this observation to describe a construction of lattices from vertex transitive graphs. In the case of irreducible group frames, we show that the corresponding…

Let H be a 3-uniform hypergraph with N vertices. A tight Hamilton cycle C \subset H is a collection of N edges for which there is an ordering of the vertices v_1, ..., v_N such that every triple of consecutive vertices {v_i, v_{i+1},…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

A $d$-dimensional (bar-and-joint) framework $(G,p)$ consists of a graph $G=(V,E)$ and a realisation $p:V\to \mathbb{R}^d$. It is rigid if every continuous motion of the vertices which preserves the lengths of the edges is induced by an…

For positive integers $n>d\geq k$, let $\phi(n,d,k)$ denote the least integer $\phi$ such that every $n$-vertex graph with at least $\phi$ vertices of degree at least $d$ contains a path on $k+1$ vertices. Many years ago, Erd\H{o}s,…

The ring of symmetric functions carries the structure of a Hopf algebra. When computing the coproduct of complete symmetric functions $h_\lambda$ one arrives at weighted sums over reverse plane partitions (RPP) involving binomial…

In this paper we investigate orders, longest cycles and the number of cycles of automorphisms of finite vertex-transitive graphs. In particular, we show that the order of every automorphism of a connected vertex-transitive graph with $n$…

The question of characterizing the (finite) representable relation algebras in a ``nice" way is open. The class $\mathbf{RRA}$ is known to be not finitely axiomatizable in first-order logic. Nevertheless, it is conjectured that ``almost…

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

Let $E$ be an arbitrary closed set on the unit circle $\partial \mathbb{D}$, u be a harmonic function on the unit disk $\mathbb{D}$ satisfying $|u(z)|\lesssim (1-|z|)^\gamma \rho^{-q}(z)$ where $\rho(z)= \mathop{\rm dist}(z, E)$, $\gamma$,…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

We consider groups of orientation-preserving real analytic diffeomorphisms of the circle which have a finite image under the rotation number function. We show that if such a group is nondiscrete with respect to the $C^1$-topology then it…

We show that for all $k\geq 4$, $\varepsilon >0$, and $n$ sufficiently large, every $k$-uniform hypergraph on $n$ vertices in which each set of $k-3$ vertices is contained in at least $(5/8 + \varepsilon) \binom{n}{3}$ edges contains a…