Search results for " Matrix"
showing 10 items of 2053 documents
Computing the Kekulé structure count for alternant hydrocarbons
2002
A fast computer algorithm brings computation of the permanents of sparse matrices, specifically, molecular adjacency matrices. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekule structure count. A simple method is presented for determining the Kekule structure count of alternant hydrocarbons. For these hydrocarbons, the square of the Kekule structure count is equal to the permanent of the adjacency matrix. In addition, for alternant structures the adjacency matrix for N atoms can be written in such a way that only an N/2 × N/2 matrix need be evaluated. The Kekule structure count correlates with topological indices. The inclusion of…
Perturbations of Jordan Blocks
2019
In this chapter we shall study the spectrum of a random perturbation of the large Jordan block A0, introduced in Sect. 2.4: $$\displaystyle A_0=\begin {pmatrix}0 &1 &0 &0 &\ldots &0\\ 0 &0 &1 &0 &\ldots &0\\ 0 &0 &0 &1 &\ldots &0\\ . &. &. &. &\ldots &.\\ 0 &0 &0 &0 &\ldots &1\\ 0 &0 &0 &0 &\ldots &0 \end {pmatrix}: {\mathbf {C}}^N\to {\mathbf {C}}^N. $$ Zworski noticed that for every z ∈ D(0, 1), there are associated exponentially accurate quasimodes when N →∞. Hence the open unit disc is a region of spectral instability. We have spectral stability (a good resolvent estimate) in \(\mathbf {C}\setminus \overline {D(0,1)}\), since ∥A0∥ = 1. σ(A0) = {0}.
Asymptotics for the standard and the Capelli identities
2003
Let {c n (St k )} and {c n (C k )} be the sequences of codimensions of the T-ideals generated by the standard polynomial of degreek and by thek-th Capelli polynomial, respectively. We study the asymptotic behaviour of these two sequences over a fieldF of characteristic zero. For the standard polynomial, among other results, we show that the following asymptotic equalities hold: $$\begin{gathered} c_n \left( {St_{2k} } \right) \simeq c_n \left( {C_{k^2 + 1} } \right) \simeq c_n \left( {M_k \left( F \right)} \right), \hfill \\ c_n \left( {St_{2k + 1} } \right) \simeq c_n \left( {M_{k \times 2k} \left( F \right) \oplus M_{2k \times k} \left( F \right)} \right), \hfill \\ \end{gathered} $$ wher…
Braiding minimal sets of vector fields
2002
We extend a classical but fundamental theorem of knot and braid theories to describe the geometry of nonsingular minimal sets of 3-dimensional flows.
Spectral density of the correlation matrix of factor models: a random matrix theory approach.
2005
We studied the eigenvalue spectral density of the correlation matrix of factor models of multivariate time series. By making use of the random matrix theory, we analytically quantified the effect of statistical uncertainty on the spectral density due to the finiteness of the sample. We considered a broad range of models, ranging from one-factor models to hierarchical multifactor models.
Y-proper graded cocharacters of upper triangular matrices of order m graded by the m-tuple ϕ=(0,0,1,…,m−2)
2015
Abstract Let F be a field of characteristic 0. We consider the algebra UT m ( F ) of upper triangular matrices of order m endowed with an elementary Z m -grading induced by the m-tuple ϕ = ( 0 , 0 , 1 , … , m − 2 ) , then we compute its Y-proper graded cocharacter sequence and we give the explicit formulas for the multiplicities in the case m = 2 , 3 , 4 , 5 .
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
2008
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch bounds with equality is given and applied for the case of MUBs. This yields a necessary and sufficient condition on a set of orthonormal bases to form a complete system of MUBs. This condition takes an especially elegant form in the case of homogeneous systems of MUBs. We express some known constructions of MUBs in this form. Also it is shown how recently obtained results binding MUBs and some combinatorial structures (such as perfect nonlinear functions an…
O(n 2 log n) Time On-Line Construction of Two-Dimensional Suffix Trees
2005
The two-dimensional suffix tree of an n × n square matrix A is a compacted trie that represents all square submatrices of Ai¾?[9]. For the off-line case, i.e., A is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet sizei¾?[9,15]. Motivated by applications in Image Compressioni¾?[18], Giancarlo and Guaianai¾?[12] considered the on-line version of the two-dimensional suffix tree and presented an On2log2n-time algorithm, which we refer to as GG. That algorithm is a non-trivial generalization of Ukkonen's on-line algorithm for standard suffix trees [19]. The main contribution in this paper is an Olog n factor improvement in the time complex…
Y-proper graded cocharacters and codimensions of upper triangular matrices of size 2, 3, 4
2012
Abstract Let F be a field of characteristic 0. We consider the upper triangular matrices with entries in F of size 2, 3 and 4 endowed with the grading induced by that of Vasilovsky. In this paper we give explicit computation for the multiplicities of the Y -proper graded cocharacters and codimensions of these algebras.
Quantum like modelling of decision making: quantifying uncertainty with the aid of the Heisenberg-Robertson inequality
2018
This paper contributes to quantum-like modeling of decision making (DM) under uncertainty through application of Heisenberg’s uncertainty principle (in the form of the Robertson inequality). In this paper we apply this instrument to quantify uncertainty in DM performed by quantum-like agents. As an example, we apply the Heisenberg uncertainty principle to the determination of mutual interrelation of uncertainties for “incompatible questions” used to be asked in political opinion pools. We also consider the problem of representation of decision problems, e.g., in the form of questions, by Hermitian operators, commuting and noncommuting, corresponding to compatible and incompatible questions …