Results 31 to 40 of about 68 (68)

N -Dimensional Binary Vector Spaces

, 2013
Summary. The binary set {0, 1} together with modulo-2 addition and multiplication is called a binary field, which is denoted by F2.
Vol, Formalized
core  

Positive Sub-Definite Matrices Over a Proper Cone Completeness of Rank One Matrix

, 2014
The purpose of this paper is to check rank one matrix thoroughly and identify the existence of positive sub-definite matrices, generalize positive sub-definite matrices, weakly generalized positive sub-definite matrices and copositive matrices on it ...
Tanjena S. Khan, A. Hassouni, A. Lahlou
core  

Characterizations of term-rank preservers over Boolean matrices

, 2012
In this paper we obtain some characterizations of linear operators that preserve term rank of Boolean matrices. With certain conditions, we prove that for a linear operator T on the Boolean matrix space, T preserves term rank if and only if T preserves ...
Wan Saripah Wan Sulaiman
core  

On linear codes with random multiplier vectors and the maximum trace dimension property

Journal of Mathematical Cryptology
Let CC be a linear code of length nn and dimension kk over the finite field Fqm{{\mathbb{F}}}_{{q}^{m}}. The trace code Tr(C){\rm{Tr}}\left(C) is a linear code of the same length nn over the subfield Fq{{\mathbb{F}}}_{q}.
Erdélyi Márton, Hegedüs Pál, Kiss Sándor Z., Nagy Gábor P.   +3 more
doaj   +1 more source

Zero Forcing Sets and Bipartite Circulants

, 2010
In this paper we introduce a class of regular bipartite graphs whose biadja-cency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only
Seth A. Meyer
core  

Variations in the sub-defect of doubly substochastic matrices

Special Matrices
The sub-defect of a doubly stochastic matrix AA, denoted as sd(A)=⌈n−sum(A)⌉sd\left(A)=\lceil n-{\rm{sum}}\left(A)\rceil , is defined as the minimum number of rows and columns required to be added to transform the doubly substochastic matrix into a ...
Cao Lei, Eshkaftaki Ali Bayati, Koyuncu Selcuk   +2 more
doaj   +1 more source

Dependency Relations Among the Shifts of a Multivariate Refinable Distribution

, 1998
. Refinable functions are an intrinsic part of subdivision schemes and wavelet constructions. The relevant properties of such functions must usually be determined from their refinement masks.
Rong-qing Jia, R. -q. Jia, Thomas A. Hogan, T. A. Hogan   +3 more
core  

and

, 2008
A sign pattern matrix is a matrix whose entries are from the set {+, −, 0}. The minimum rank of a sign pattern matrix A is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of A.
Marina Arav, Frank J. Hall, Zhongshan Li, Selcuk Koyuncu, Bhaskara Rao   +4 more
core  

Admissible Functions and Asymptotics for Labelled Structures by Number of Components

, 1996
Let a(n; k) denote the number of combinatorial structures of size n with k components. One often has P n;k a(n; k)x n y k =n! = exp \Phi yC(x) \Psi , where C(x) is frequently the exponential generating function for connected structures.
Edward A. Bender, L. Bruce Richmond
core  

Reduction and normal forms of matrix pencils

, 2011
. Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation Ex ′ + Ax = 0.
Olivier Verdier
core