Related papers: Spiral determinants
A spiral in $\mathbb{R}^{d+1}$ is defined as a set of the form $\left\{\sqrt[d+1]{n}\cdot\boldsymbol{u}_n\right\}_{n\ge 1},$ where $\left(\boldsymbol{u}_n\right)_{n\ge 1}$ is a spherical sequence. Such point sets have been extensively…
We propose a novel class of spirals that are based on perfect polygonal formations. The spirals are defined by a fractal of right triangles that delineate their geometry and determine their progression rates and modes. We show how these…
In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…
If $A$ is an integer valued, strictly expansive matrix, then there exists an orthonormal $A$-wavelet whose Fourier transform is compactly supported and smooth. We show that strongly connected diagonally dominant integer matrices are…
In this paper, we are going to calculate the determinant of a certain type of square matrices, which are related to the well-known Cauchy and Toeplitz matrices. Then, we will use the results to determine the rank of special non-square…
In this paper, we construct rotating frames for curves, including plane curves, space curves and curves on surfaces. Hence, the behaviour of an arbitrary moving point on a curve can be seen as the composite of linear motion and rotation.…
Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.
In this paper, we define a matrix which we call Vieta matrix and calculate its determinant: $$ \left( \begin{array}{cccc} 1&1&\cdots&1\\ a_{2}+a_{3}+\cdots+a_{n}&a_{1}+a_{3}+\cdots+a_{n}&\cdots&a_{1}+a_{2}+\cdots+a_{n-1}\\…
The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
The Leinster matrix corresponding to a finite category has entries counting the number of morphisms between objects. A first question is to know which positive integer matrices come from at least one finite category. Here, that question…
Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…
We focus on working on incidence rings, a class of (possibly infinite) matrix rings indexed by ordered sets. Some general properties about them are given, including how they are always the inverse limit of finite matrix rings, giving a…
We explicitly describe the divisor class groups and semidualizing modules for ladder determinantal rings with coefficients in an arbitrary normal domain for arbitrary ladders, not necessarily connected, and all sizes of minors.
Spiral density wave theory attempts to describe the spiral pattern in spiral galaxies in terms of a long-lived wave structure with a constant pattern speed in order to avoid the winding dilemma. The pattern is consequently a rigidly…
We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…
For a permutation $\pi$, and the corresponding permutation matrix, we introduce the notion of {\em discrete derivative}, obtained by taking differences of successive entries in $\pi$. We characterize the possible derivatives of…
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.
The unitary group with the Haar probability measure is called Circular Unitary Ensemble. All the eigenvalues lie on the unit circle in the complex plane and they can be regarded as a determinantal point process on $\mathbb{S}^1$. It is also…