Displaying similar documents to “The (weakly) sign symmetric P -matrix completion problems.”

The P 0 -matrix completion problem.

Choi, Ji Young, DeAlba, Luz Maria, Hogben, Leslie, Maxwell, Mandi S., Wangsness, Amy (2002)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

The nonnegative P 0 -matrix completion problem.

Choi, Ji Young, Dealba, Luz Maria, Hogben, Leslie, Kivunge, Benard M., Nordstrom, Sandra K., Shedenhelm, Mike (2003)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

The Q -matrix completion problem.

Dealba, Luz Maria, Hogben, Leslie, Sarma, Bhaba Kumar (2009)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Similarity:

On the inertia sets of some symmetric sign patterns

C. M. da Fonseca (2006)

Czechoslovak Mathematical Journal

Similarity:

A matrix whose entries consist of elements from the set { + , - , 0 } is a sign pattern matrix. Using a linear algebra theoretical approach we generalize of some recent results due to Hall, Li and others involving the inertia of symmetric tridiagonal sign matrices.

On nowhere weakly symmetric functions and functions with two-element range

Krzysztof Ciesielski, Kandasamy Muthuvel, Andrzej Nowik (2001)

Fundamenta Mathematicae

Similarity:

A function f: ℝ → {0,1} is weakly symmetric (resp. weakly symmetrically continuous) at x ∈ ℝ provided there is a sequence hₙ → 0 such that f(x+hₙ) = f(x-hₙ) = f(x) (resp. f(x+hₙ) = f(x-hₙ)) for every n. We characterize the sets S(f) of all points at which f fails to be weakly symmetrically continuous and show that f must be weakly symmetric at some x ∈ ℝ∖S(f). In particular, there is no f: ℝ → {0,1} which is nowhere weakly symmetric. It is also shown that if at each...