Related papers: A family of determinants associated with a square …
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
We study the spectrum of the join of several circulant matrices. We apply our results to compute explicitly the spectrum of certain graphs obtained by joining several circulant graphs.
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We describe several families of permutation polynomials obtained using functions with linear translators.
The problem of approximating the discrete spectra of families of self-adjoint operators that are merely strongly continuous is addressed. It is well-known that the spectrum need not vary continuously (as a set) under strong perturbations.…
For operators generated by a certain class of infinite band matrices with matrix elements we establish a characterization of the resolvent set in terms of polynomial solutions of the underlying higher order finite difference equations. This…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…
We derive upper and lower bounds on the determinant of an exponential matrix. They can be transformed into corresponding bounds for the determinant of a univariate Gaussian matrix.
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler characteristic and geometric measure. Among its cardinality-like properties are multiplicativity with respect…
The determinant for complex matrices cannot be extended to quaternionic matrices. Instead, the Study determinant and the closely related $q$-determinant are widely used. We show that the Study determinant can be characterized as the unique…
We take the trace of Von-Neumann's ergodic theorem and get a trace formula of a unitary matrix family. It is an extension of Poisson summation formula in higher dimension. We also construct a family of crystalline measure with complex…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
We produce an explicit family of totally real cyclic quartic polynomials that are monogenic in many cases and, if the $abc$ conjecture holds, generate distinct monogenic quartic fields infinitely often. Additional families (also…
A family of polynomials parameterized by the conjugacy classes of a finite Coxeter group is investigated. These polynomials, together with the character table of the group, determine the associated generic degrees. The polynomials are…
In this article, we introduce a notion of an exponential matrix, which is a polynomial matrix with exponential properties, and a notion of an equivalence relation of two exponential matrices, and then we initiate to study classifying…
In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.
We study which matrices are sums of idempotents over a field of non-zero characteristic; in particular, we prove that any such matrix, provided it is large enough, is actually a sum of five idempotents, and even of four when the field is a…
We apply the matrix-tree theorem to establish a link between various diagrammatic and determinant expressions, which naturally appear in scattering amplitudes of gravity theories. Using this link we are able to give a general…