Related papers: Tremain equiangular tight frames
Given a frame in a finite dimensional Hilbert space we construct additive perturbations which decrease the condition number of the frame. By iterating this perturbation, we introduce an algorithm that produces a tight frame in a finite…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
Applications in quantum information theory and quantum tomography have raised current interest in complex Hadamard matrices. In this note we investigate the connection between tiling Abelian groups and constructions of complex Hadamard…
In this present paper we introduce weaving Hilbert space frames in the continuous case, we give new approaches for manufacturing pairs of woven continuous frames and we obtain new properties in continuous weaving frame theory related to…
In this paper we provide a general method to construct four-parameter families of complex Hadamard matrices of order six. Our approach is to write a 6-dimensional matrix as composed of four blocks, each one in the form of a circulant…
We introduce a novel family of invariant, convex, and non-quadratic functionals that we employ to derive regularized solutions of ill-posed linear inverse imaging problems. The proposed regularizers involve the Schatten norms of the Hessian…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
In this paper we consider the problem of finding pairs of triangles whose sides are perfect squares of integers, and which have a common perimeter and common area. We find two such pairs of triangles, and prove that there exist infinitely…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
A new family of decagonal quasiperiodic tilings are constructed by the use of generalized point substitution processes, which is a new substitution formalism developed by the author [N. Fujita, Acta Cryst. A 65, 342 (2009)]. These tilings…
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
A line of hard spheres confined by a transverse harmonic potential, with hard walls at its ends, exhibits a variety of buckled structures as it is compressed longitudinally. Here we show that these may be conveniently observed in a rotating…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…
Two new classes of finite automata, called General hexagonal Boustrophedon finite automata and General hexagonal returning finite automata operating on hexagonal grids, are introduced and analyzed. The work establishes the theoretical…
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…
The chosen tool of this thesis is an extremal type approach. The lesson drawn by the theorems proved in the thesis is that surprisingly small compromise is necessary on the efficacy of the solutions to make the approach work. The problems…