Related papers: What is odd about binary Parseval frames?
Tight frames can be characterized as those frames which possess optimal numerical stability properties. In this paper, we consider the question of modifying a general frame to generate a tight frame by rescaling its frame vectors; a process…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
An alternative interpretation of the conformal transformations of the metric is discussed according to which the latter can be viewed as a mapping among Riemannian and Weyl-integrable spaces. A novel aspect of the conformal transformation's…
Random matrix models based on an integral over supermatrices are proposed as a natural extension of bosonic matrix models. The subtle nature of superspace integration allows these models to have very different properties from the analogous…
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
Frames for Hilbert spaces are interesting for mathematicians but also important for applications e.g. in signal analysis and in physics. Both in mathematics and physics it is natural to consider a full scale of spaces, and not only a single…
We will present a relation between real equiangular frames and certain special sets in groups which we call signature sets and show that many equiangular frames arise in this manner. Then we will define quasi-signature sets and will examine…
The classical theorems relating integral binary quadratic forms and ideal classes of quadratic orders have been of tremendous importance in mathematics, and many authors have given extensions of these theorems to rings other than the…
After a short review of some basic facts on g-frames, we analyze in details the so-called (alternate) dual g-frames. We end the paper by introducing what we call {\em g-coherent states} and studying their properties.
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…
We describe the mathematical properties of pairwise comparisons matrices with coefficients in an arbitrary group. We provide a vocabulary adapted for the description of main algebraic properties of inconsistency maps, describe an example…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
A class of trigonometric interpolation splines depending on parameter vectors, selected convergence factors and interpolation factors is considered. The concept of crosslink grids and interpolation grids is introduced; these grids can match…
Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program…
In this paper, we establish Parseval identities and surprising new inequalities for weaving frames in Hilbert space, which involve scalar $\lambda\in\rs$. By suitable choices of $\lambda$, one obtains the previous results as special cases.…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
Companion matrices of the second type are characterized by properties that involve bilinear maps.