Related papers: Tight Frame with Hahn and Krawtchouk Polynomials o…
We construct a map from $d|1$-dimensional Euclidean field theories to complexified K-theory when $d=1$ and complex analytic elliptic cohomology when $d=2$. This provides further evidence for the Stolz--Teichner program, while also…
We introduce a new infinite family of $d\times 2d$ equiangular tight frames. Many matrices in this family consist of two $d\times d$ circulant blocks. We conjecture that such equiangular tight frames exist for every $d$. We show that our…
An equiangular tight frame (ETF) is a type of optimal packing of lines in Euclidean space. They are often represented as the columns of a short, fat matrix. In certain applications we want this matrix to be flat, that is, have the property…
We prove sharp upper bounds for sums of eigenvalues (and other spectral functionals) of Laplace-like operators, including bi-Laplacian and fractional Laplacian. We show that among linear images of a highly symmetric domain, our spectral…
Finite element spaces by Whitney $k$-forms on cubical meshes in $\mathbb{R}^n$ are presented. Based on the spaces, compatible discretizations to $H\Lambda^k$ problems are provided, and discrete de Rham complexes and commutative diagrams are…
Here it is shown how to combine two generically globally rigid bar frameworks in $d$-space to get another generically globally rigid framework. The construction is to identify $d+1$ vertices from each of the frameworks and erase one of the…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
We construct a sequence ${\phi_i(\cdot-j)\mid j\in{\ZZ}, i=1,...,r}$ which constitutes a $p$-frame for the weighted shift-invariant space [V^p_{\mu}(\Phi)=\Big{\sum\limits_{i=1}^r\sum\limits_{j\in{\mathbb{Z}}}c_i(j)\phi_i(\cdot-j) \Big|…
We describe three algorithms for generating binary-valued holograms. Our methods are optimised for producing large arrays of tightly focussed optical tweezers for trapping particles. Binary-valued holograms allow us to use a digital mirror…
We characterize the frames on an infinite dimensional separable Hilbert space that can be projected to a tight frame for an infinite dimensional subspace. A result of Casazza and Leon states that an arbitrary frame for a 2N- or…
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then…
The construction of finite tight Gabor frames plays an important role in many applications. These applications include significant ones in signal and image processing. We explore when constant amplitude zero autocorrelation (CAZAC)…
We construct new, previously unknown parametric families of complex conference matrices and of complex Hadamard matrices of square orders and related them to complex equiangular tight frames.
Many problems in areas such as compressive sensing and coding theory seek to design a set of equal-norm vectors with large angular separation. This idea is essentially equivalent to constructing a frame with low coherence. The elements of…
We derive explicit formulae for the generating series of mixed Grothendieck dessins d'enfant/monotone/simple Hurwitz numbers, via the semi-infinite wedge formalism. This reveals the strong piecewise polynomiality in the sense of…
In this paper we compute the coefficients of the reliability polynomial of a consecutive-$k$-out-of-$n$:$F$ system, in Bernstein basis, using the generalized Pascal coefficients. Based on well-known combinatorial properties of the…
We discuss some specializations of the frames of flat orthonormal frame bundles over geometries of indefinite signature, and the resulting symmetries of families of embedded Riemannian or pseudo-Riemannian geometries. The specializations…
Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…