Results 1 to 10 of about 1,241,382 (276)
A Minimum Rank Approach for Reduction of Environmental Noise in Near-Field Array Antenna Diagnosis [PDF]
Journal of Imaging, 2019 A method to filter out the contribution of interference sources in array diagnosis is proposed. The interference-affected near field measured on a surface is treated as a (complex-data) image.
Marco Donald Migliore +4 more
doaj +2 more sources
Polytopes of Minimum Positive Semidefinite Rank [PDF]
Discrete & Computational Geometry, 2013 The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope.
Gouveia, João +2 more
core +3 more sources
Graph Theory versus Minimum Rank for Index Coding [PDF]
2014 IEEE International Symposium on Information Theory, 2014 We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic ...
Dimakis, Alexandros G. +2 more
core +2 more sources
The minimum rank problem for circulants
Linear Algebra and its Applications, 2015 The minimum rank problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$.
Deaett, Louis, Meyer, Seth A.
core +3 more sources
Resolving the taxonomic enigma of Nesocaryum stylosum (Boraginaceae): phylogenetic evidence for its reclassification as Cryptantha stylosa [PDF]
PhytoKeysThe classification of Nesocaryum stylosum (Boraginaceae) has remained unresolved for nearly a century. This species is endemic to Isla San Ambrosio, a small island located approximately 900 km due west of the coast of central Chile. Ivan M.
Michael G. Simpson +10 more
doaj +4 more sources
Subgraph Complementation and Minimum Rank [PDF]
The Electronic Journal of Combinatorics, 2022 Any finite simple graph $G = (V,E)$ can be represented by a collection $\mathscr{C}$ of subsets of $V$ such that $uv\in E$ if and only if $u$ and $v$ appear together in an odd number of sets in $\mathscr{C}$. Let $c_2(G)$ denote the minimum cardinality of such a collection.
Buchanan, Calum +2 more
openaire +3 more sources
Bounds on the Minimum Edge Dominating Energy in Terms of Some Parameters of a Graph [PDF]
Mathematics Interdisciplinary Research, 2023 The minimum edge dominating energy, denoted by $EE_{F}(G)$, is the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of graph $G$.
Fateme Movahedi
doaj +1 more source
State-independent quantum contextuality with projectors of nonunit rank
New Journal of Physics, 2021 Virtually all of the analysis of quantum contextuality is restricted to the case where events are represented by rank-one projectors. This restriction is arbitrary and not motivated by physical considerations.
Zhen-Peng Xu +2 more
doaj +1 more source
Maximum nullity and zero forcing of circulant graphs
Special Matrices, 2020 The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems.
Duong Linh +4 more
doaj +1 more source
Reducing the rank of a matroid [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We consider the rank reduction problem for matroids: Given a matroid $M$ and an integer $k$, find a minimum size subset of elements of $M$ whose removal reduces the rank of $M$ by at least $k$. When $M$ is a graphical matroid this problem is the minimum $
Gwenaël Joret, Adrian Vetta
doaj +1 more source