AbstractMinimal matrices were introduced to give an algebraic characterization of sets of uniqueness, a notion of interest in Discrete Tomography. They have also been used to produce minimal summands in Kronecker products of complex irreducible characters of the symmetric group. In this paper, motivated by these two applications, we classify all minimal matrices of size 2×q
Over a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-symmetric...
AbstractThe Hadamard matrix H2m of order 2m can be obtained by m−1 times of Kronercker products from...
1 In general C∗-algebras, elements with minimal norm in some equivalence class are introduced and ch...
AbstractMinimal matrices were introduced to give an algebraic characterization of sets of uniqueness...
AbstractThe notions of minimality, π-uniqueness and additivity originated in discrete tomography. Th...
AbstractA real symmetric matrix of order n, n ⩾ 2, is said to be paramount if each proper principal ...
AbstractA matrix M with nonnegative integer entries is minimal if the nonincreasing sequence of its ...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractIn this note we give an algebraic characterization of sets of uniqueness in terms of matrice...
AbstractIn general C∗-algebras, elements with minimal norm in some equivalence class are introduced ...
AbstractWe describe properties of a Hermitian matrix M∈Mn(C) having minimal quotient norm in the fol...
AbstractAn n × n zero-one matrix with constant column sums k is minimal if its determinant is ±k. A ...
AbstractOver a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-s...
AbstractWe define a 0, 1 matrix M to be ideal if all vertices of the polyhedron { x: Mx ≥ 1, x ≥ 0 }...
We describe properties of a Hermitian matrix M ∈ Mn(C) having minimal quotient norm in the following...
Over a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-symmetric...
AbstractThe Hadamard matrix H2m of order 2m can be obtained by m−1 times of Kronercker products from...
1 In general C∗-algebras, elements with minimal norm in some equivalence class are introduced and ch...
AbstractMinimal matrices were introduced to give an algebraic characterization of sets of uniqueness...
AbstractThe notions of minimality, π-uniqueness and additivity originated in discrete tomography. Th...
AbstractA real symmetric matrix of order n, n ⩾ 2, is said to be paramount if each proper principal ...
AbstractA matrix M with nonnegative integer entries is minimal if the nonincreasing sequence of its ...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractIn this note we give an algebraic characterization of sets of uniqueness in terms of matrice...
AbstractIn general C∗-algebras, elements with minimal norm in some equivalence class are introduced ...
AbstractWe describe properties of a Hermitian matrix M∈Mn(C) having minimal quotient norm in the fol...
AbstractAn n × n zero-one matrix with constant column sums k is minimal if its determinant is ±k. A ...
AbstractOver a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-s...
AbstractWe define a 0, 1 matrix M to be ideal if all vertices of the polyhedron { x: Mx ≥ 1, x ≥ 0 }...
We describe properties of a Hermitian matrix M ∈ Mn(C) having minimal quotient norm in the following...
Over a field k of characteristic not 2 the set of minimal polynomials of symmetric or skew-symmetric...
AbstractThe Hadamard matrix H2m of order 2m can be obtained by m−1 times of Kronercker products from...
1 In general C∗-algebras, elements with minimal norm in some equivalence class are introduced and ch...
DOI
Add to ORKG