On symmetric matrices with indeterminate leading diagonals (Q1049391): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q942053
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vassily Lyubetsky / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum rank of symmetric matrices described by a graph: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of tridiagonal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fiedler's characterization of tridiagonal matrices over arbitrary fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1134/s0032946009030065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132788106 / rank
 
Normal rank

Latest revision as of 11:03, 30 July 2024

scientific article
Language Label Description Also known as
English
On symmetric matrices with indeterminate leading diagonals
scientific article

    Statements

    On symmetric matrices with indeterminate leading diagonals (English)
    0 references
    0 references
    0 references
    12 January 2010
    0 references
    Let \(q(x)=x^{t}Ax\), \(x\in \mathbb R^n\), be a quadratic form where \(x^{t}\) is the transposition of \(x\), \(n\geq3\) an integer and \(A\) a symmetric real \(n\times n\) matrix. A quadric is a pair \(Q=\langle A,c\rangle\) of the affine variety defined by the equation \(q(x)=c\), where \(c\) is a real number. Let \(\mathbb U\) be the \(n\)-cube whose vertices have coordinates \(\pm1\). Let \(M_{Q}\) denote the intersection of \(Q\) and \(\mathbb U\). The variable \(D\) denotes a diagonal matrix with arbitrary real numbers on the main diagonal. Let \(G(A)\) denote the undirected loop-free graph with multiple edges and with \(n\) vertices where the \(i\)th vertex is connected by an edge with \(j\)th vertex whenever the entry \(a_{ij}\) of \(A\) is not zero. The authors present some partial answers to the following problems with elementary proofs. {\parindent6mm \begin{itemize}\item[1.] Find a maximum (or minimum) point of quadratic form \(q(x)\) under the constraint \(x\in\mathbb U\) by means of replacing \(A\) with a ``simpler'' matrix \(B\) with the same maximum (minimum) point. \item[2.] Derive properties of the graph \(G(A)\) from properties of the set \(M_{Q}\). \item[3.] Describe the semilattice consisting of all sets of the form \(M_{Q}\) except for \(\mathbb U\) with the set-theoretic inclusion relation \(\subseteq\). \item[4.] Describe the quotient set consisting of equivalence classes of all quadrics with the following equivalence relation: \(Q\sim Q'\text{ if }M_{Q}=M_{Q'}\). \end{itemize}} The paper contains some interesting examples.
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic form
    0 references
    quadric
    0 references
    graph
    0 references
    semilattice
    0 references
    symmetric matrices
    0 references
    0 references