Related papers: What is odd about binary Parseval frames?
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
When the gravitational lensing potential can be approximated by that of circularly symmetric system affected by weak perturbations, it is found that the shape of the resulting (tangential) caustics is entirely specified by the local…
The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…
A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equivalent to the complement of the first half of the code being identical to the second half. We generalize…
Tridiagonal canonical forms of square matrices under congruence or *congruence, pairs of symmetric or skew-symmetric matrices under congruence, and pairs of Hermitian matrices under *congruence are given over an algebraically closed field…
We derive easily verifiable conditions which characterize when complex Seidel matrices containing cube roots of unity have exactly two eigenvalues. The existence of such matrices is equivalent to the existence of equiangular tight frames…
It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
In this paper, we introduce the notion of reproducing kernel Hilbert spaces for graphs and the Gram matrices associated with them. Our aim is to investigate the Gram matrices of reproducing kernel Hilbert spaces. We provide several bounds…
Let $G$ be a bipartite graph and its adjacency matrix $\mathbb A$. If $G$ has a unique perfect matching, then $\mathbb A$ has an inverse $\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph.…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
A transversal matroid whose dual is also transversal is called bi-transversal. Let $G$ be an undirected graph with vertex set $V$. In this paper, for every subset $W$ of $V$, we associate a bi-transversal matroid to the pair $(G,W)$. We…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
Two matrices are said non-overlapping if one of them can not be put on the other one in a way such that the corresponding entries coincide. We provide a set of non-overlapping binary matrices and a formula to enumerate it which involves the…
$E$-frames are a new generalization for the concept of frames for $\mathcal{H}$, where $E$ is an infinite invertible complex matrix mapping on $\bigoplus_{n=1}^{\infty}\mathcal{H}$. This article is dedicated to investigating some notions…
Let $S$ be an additively idempotent semiring and $\mathbf{M}_n(S)$ be the semiring of all $n\times n$ matrices over $S$. We characterize the conditions of when the semiring $\mathbf{M}_n(S)$ is congruence-simple provided that the semiring…
Parseval and equal-norm frames play a fundamental role in frame theory and signal processing. In this work, we prove non-asymptotic concentration bounds showing that random equal-norm frames are nearly Parseval with high probability, and…
We present a way to construct Parseval frames of piecewise constant functions for $L^2[0,1]$. The construction is similar to the generalized Walsh bases. It is based on iteration of operators that satisfy a Cuntz-type relation, but without…
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…