نتایج جستجو برای: nullity

تعداد نتایج: 442  

2013
Jose Divasón Jesús Aransay

In this article we present a proof of the result known in Linear Algebra as the “rank nullity Theorem”, which states that, given any linear form f from a finite dimensional vector space V to a vector space W , then the dimension of V is equal to the dimension of the kernel of f (which is a subspace of V ) and the dimension of the range of f (which is a subspace of W ). The proof presented here ...

Journal: :Eur. J. Comb. 2011
Lorenzo Traldi

A theorem of Cohn and Lempel [J. Combin. Theory Ser. A 13 (1972), 83-89] gives an equality involving the number of directed circuits in a circuit partition of a 2-in, 2-out digraph and the GF (2)-nullity of an associated matrix. This equality is essentially equivalent to the relationship between directed circuit partitions of 2-in, 2-out digraphs and vertexnullity interlace polynomials of circl...

Journal: :Journal of the Mathematical Society of Japan 1992

Journal: :Publicationes Mathematicae Debrecen 2016

2008
H. TRACY CHARLES R. JOHNSON

Considered is the multiplicative semigroup of ratios of products of principal minors bounded over all positive definite matrices. A long history of literature identifies various elements of this semigroup, all of which lie in a subsemigroup generated by Hadamard-Fischer inequalities. Via cone-theoretic techniques and the patterns of nullity among positive semidefinite matrices, a semigroup cont...

2017
Steve Butler Jason Grout STEVE BUTLER

Zero forcing is a combinatorial game played on a graph with a goal of changing the color of every vertex at minimal cost. This leads to a parameter known as the zero forcing number that can be used to give an upper bound for the maximum nullity of a matrix associated with the graph. A variation on the zero forcing game is introduced that can be used to give an upper bound for the maximum nullit...

2017
Daniela Ferrero Thomas Kalinowski Sudeep Stephen

Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electric...

Journal: :Int. J. Math. Mathematical Sciences 2004
Philippe Rukimbira

We prove that the dimension of the 1-nullity distributionN(1) on a closed Sasakianmanifold M of rank l is at least equal to 2l−1 provided thatM has an isolated closed characteristic. The result is then used to provide some examples ofK-contact manifolds which are not Sasakian. On a closed, 2n+ 1-dimensional Sasakian manifold of positive bisectional curvature, we show that either the dimension o...

Journal: :Journal of Computational and Applied Mathematics 2006

Journal: :Proceedings of the American Mathematical Society 1988

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید