Results 1 to 10 of about 926 (96)
From the History of Creation of Rocket Complexes 15A14 and 15A15 (Beginning of the 70’s of the 20th Century) [PDF]
Олена Войтюк
openaire +2 more sources
Schrödinger’s tridiagonal matrix
In the third part of his famous 1926 paper ‘Quantisierung als Eigenwertproblem’, Schrödinger came across a certain parametrized family of tridiagonal matrices whose eigenvalues he conjectured.
Kovačec Alexander
doaj +1 more source
Combinatorial properties of the enhanced principal rank characteristic sequence over finite fields
The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix B ∈ 𝔽n×n is defined as ℓ1ℓ2· · · ℓn, where ℓj ∈ {A, S, N} according to whether all, some but not all, or none of the principal minors of order j of B are nonzero ...
Dukes Peter J., Martínez-Rivera Xavier
doaj +1 more source
Determinants of some Hessenberg matrices with generating functions
In this paper, we derive some relationships between the determinants of some special lower Hessenberg matrices whose entries are the terms of certain sequences and the generating functions of these sequences.
Leerawat Utsanee, Daowsud Katthaleeya
doaj +1 more source
Disproving a conjecture of Thornton on Bohemian matrices
In this paper, we disprove a remaining conjecture about Bohemian matrices, in which the numbers of distinct determinants of a normalized Bohemian upper-Hessenberg matrix were conjectured.
Du Zhibin +3 more
doaj +1 more source
Combined matrix of diagonally equipotent matrices
Let C(A)=A∘A−T{\mathcal{C}}\left(A)=A\circ {A}^{-T} be the combined matrix of an invertible matrix AA, where ∘\circ means the Hadamard product of matrices.
Bru Rafael +4 more
doaj +1 more source
A trace bound for integer-diagonal positive semidefinite matrices
We prove that an n-by-n complex positive semidefinite matrix of rank r whose graph is connected, whose diagonal entries are integers, and whose non-zero off-diagonal entries have modulus at least one, has trace at least n + r − 1.
Mitchell Lon
doaj +1 more source
Graph isomorphism and Gaussian boson sampling
We introduce a connection between a near-term quantum computing device, specifically a Gaussian boson sampler, and the graph isomorphism problem. We propose a scheme where graphs are encoded into quantum states of light, whose properties are then probed ...
Brádler Kamil +4 more
doaj +1 more source
W-MPD–N-DMP-solutions of constrained quaternion matrix equations
The solvability of several new constrained quaternion matrix equations is investigated, and their unique solutions are presented in terms of the weighted MPD inverse and weighted DMP inverse of suitable matrices.
Kyrchei Ivan I. +2 more
doaj +1 more source
Proof of some properties of transfer using noncommutative determinants [PDF]
A transfer is a group homomorphism from a finite group to an abelian quotient group of a subgroup of the group. In this paper, we explain some of the properties of transfers by using noncommutative determinants.
Yamaguchi, Naoya
core +2 more sources

