scholarly journals Matrix Formulation of EISs of Graphs and Its Application to WSN Covering Problems

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Yongyi Yan ◽  
Jumei Yue ◽  
He Deng
Keyword(s):  
Sufficient Conditions ◽  
Independent Sets ◽  
Complete Characterization ◽  
Covering Problem ◽  
Matrix Formulation ◽  
Covering Problems ◽  
Necessary And Sufficient ◽  
Semitensor Product Of Matrices ◽  
Product Of Matrices

In this paper, the problem of formulating and finding externally independent sets of graphs is considered by using a newly developed STP method, called semitensor product of matrices. By introducing a characteristic value of a vertex subset of a graph and using the algebraic representation of pseudological functions, several necessary and sufficient conditions of matrix form are proposed to express the externally independent sets (EISs), minimum externally independent sets (MEISs), and kernels of graphs. Based on this, the concepts of EIS matrix, MEIS matrix, and kernel matrix are introduced. By these matrices’ complete characterization of these three structures of graphs, three algorithms are further designed which can find all these kinds of subsets of graphs mathematically. The results are finally applied to a WSN covering problem to demonstrate the correctness and effectiveness of the proposed results.

scholarly journals Multigenerator Gabor Frames on Local Fields

2018 ◽  
Vol 33 (2) ◽  
pp. 307
Author(s):  
Owais Ahmad ◽  
Neyaz Ahmad Sheikh
Keyword(s):  
Sufficient Conditions ◽  
Complete Characterization ◽  
Necessary And Sufficient Conditions ◽  
Local Fields ◽  
Gabor Frames ◽  
Gabor System ◽  
Necessary And Sufficient

The main objective of this paper is to provide complete characterization of multigenerator Gabor frames on a periodic set $\Omega$ in $K$. In particular, we provide some necessary and sufficient conditions for the multigenerator Gabor system to be a frame for $L^2(\Omega)$. Furthermore, we establish the complete characterizations of multigenerator Parseval Gabor frames.

scholarly journals Controllability, Reachability, and Stabilizability of Finite Automata: A Controllability Matrix Method

2018 ◽  
Vol 2018 ◽  
pp. 1-6 ◽  
Author(s):  
Yalu Li ◽  
Wenhui Dou ◽  
Haitao Li ◽  
Xin Liu
Keyword(s):  
Matrix Method ◽  
Finite Automata ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Algebraic Form ◽  
Controllability Matrix ◽  
Necessary And Sufficient ◽  
Semitensor Product Of Matrices ◽  
Product Of Matrices ◽  
Inputs And Outputs

This paper investigates the controllability, reachability, and stabilizability of finite automata by using the semitensor product of matrices. Firstly, by expressing the states, inputs, and outputs as vector forms, an algebraic form is obtained for finite automata. Secondly, based on the algebraic form, a controllability matrix is constructed for finite automata. Thirdly, some necessary and sufficient conditions are presented for the controllability, reachability, and stabilizability of finite automata by using the controllability matrix. Finally, an illustrative example is given to support the obtained new results.

On *-clean group rings

2014 ◽  
Vol 14 (01) ◽  
pp. 1550004 ◽  
Author(s):  
Yuanlin Li ◽  
M. M. Parmenter ◽  
Pingzhi Yuan
Keyword(s):  
Local Ring ◽  
Prime Order ◽  
Sufficient Conditions ◽  
Complete Characterization ◽  
Group Rings ◽  
Clean Ring ◽  
Commutative Local Ring ◽  
Irreducible Factorization ◽  
Necessary And Sufficient

A ring with involution * is called *-clean if each of its elements is the sum of a unit and a projection. Clearly a *-clean ring is clean. Vaš asked whether there exists a clean ring with involution * that is not *-clean. In a recent paper, Gao, Chen and the first author investigated when a group ring RG with classical involution * is *-clean and obtained necessary and sufficient conditions for RG to be *-clean, where R is a commutative local ring and G is one of C3, C4, S3 and Q8. As a consequence, the authors provided many examples of group rings which are clean, but not *-clean. In this paper, we continue this investigation and we give a complete characterization of when the group algebra 𝔽Cp is *-clean, where 𝔽 is a field and Cp is the cyclic group of prime order p. Our main result is related closely to the irreducible factorization of a pth cyclotomic polynomial over the field 𝔽. Among other results we also obtain a complete characterization of when RCn (3 ≤ n ≤ 6) is *-clean where R is a commutative local ring.

Stability of a thermoelastic mixture with second sound

2018 ◽  
Vol 24 (6) ◽  
pp. 1692-1706 ◽  
Author(s):  
Margareth S. Alves ◽  
Marcio V. Ferreira ◽  
Jaime E. Muñoz Rivera ◽  
O. Vera Villagrán
Keyword(s):  
Initial Data ◽  
Asymptotic Properties ◽  
Sufficient Conditions ◽  
Complete Characterization ◽  
Second Sound ◽  
Dimensional Model ◽  
One Dimensional ◽  
The One ◽  
Necessary And Sufficient

We consider the one-dimensional model of a thermoelastic mixture with second sound. We give a complete characterization of the asymptotic properties of the model in terms of the coefficients of the model. We establish the necessary and sufficient conditions for the model to be exponential or polynomial stable and also the conditions for which there exist initial data for where the energy is conserved.

scholarly journals The Schur and (weak) Dunford-Pettis properties in Banach lattices

2002 ◽  
Vol 73 (2) ◽  
pp. 251-278 ◽  
Author(s):  
Anna Kamińska ◽  
Mieczysław Mastyło
Keyword(s):  
Orlicz Spaces ◽  
Sufficient Conditions ◽  
Complete Characterization ◽  
Sequence Spaces ◽  
Banach Lattices ◽  
Schur Property ◽  
Atomic Measure ◽  
Orlicz Sequence Spaces ◽  
Necessary And Sufficient

AbstractWe study the Schur and (weak) Dunford-Pettis properties in Banach lattices. We show that l1, c0 and l∞ are the only Banach symmetric sequence spaces with the weak Dunford-Pettis property. We also characterize a large class of Banach lattices without the (weak) Dunford-Pettis property. In MusielakOrlicz sequence spaces we give some necessary and sufficient conditions for the Schur property, extending the Yamamuro result. We also present a number of results on the Schur property in weighted Orlicz sequence spaces, and, in particular, we find a complete characterization of this property for weights belonging to class ∧. We also present examples of weighted Orlicz spaces with the Schur property which are not L1-spaces. Finally, as an application of the results in sequence spaces, we provide a description of the weak Dunford-Pettis and the positive Schur properties in Orlicz spaces over an infinite non-atomic measure space.

scholarly journals Real Representation Approach to Quaternion Matrix Equation Involving ϕ-Hermicity

2019 ◽  
Vol 2019 ◽  
pp. 1-8 ◽  
Author(s):  
Xin Liu ◽  
Huajun Huang ◽  
Zhuo-Heng He
Keyword(s):  
Matrix Equation ◽  
Sufficient Conditions ◽  
Complete Characterization ◽  
Quaternion Matrix ◽  
Real Representation ◽  
Quaternion Matrix Equation ◽  
The Matrix ◽  
Hermitian Solution ◽  
Necessary And Sufficient

For a quaternion matrix A, we denote by Aϕ the matrix obtained by applying ϕ entrywise to the transposed matrix AT, where ϕ is a nonstandard involution of quaternions. A is said to be ϕ-Hermitian or ϕ-skew-Hermitian if A=Aϕ or A=−Aϕ, respectively. In this paper, we give a complete characterization of the nonstandard involutions ϕ of quaternions and their conjugacy properties; then we establish a new real representation of a quaternion matrix. Based on this, we derive some necessary and sufficient conditions for the existence of a ϕ-Hermitian solution or ϕ-skew-Hermitian solution to the quaternion matrix equation AX=B. Moreover, we give solutions of the quaternion equation when it is solvable.

scholarly journals A complete characterization of pretty good state transfer on paths

2019 ◽  
Vol 19 (7&8) ◽  
pp. 601-608
Author(s):  
Christopher M. van Bommel
Keyword(s):  
Sufficient Conditions ◽  
Quantum Walk ◽  
Complete Characterization ◽  
Necessary And Sufficient Conditions ◽  
State Transfer ◽  
Good State ◽  
Necessary And Sufficient ◽  
Positive Integers

We give a complete characterization of pretty good state transfer on paths between any pair of vertices with respect to the quantum walk model determined by the XY-Hamiltonian. If n is the length of the path, and the vertices are indexed by the positive integers from 1 to n, with adjacent vertices having consecutive indices, then the necessary and sufficient conditions for pretty good state transfer between vertices a and b are that (a) a + b = n + 1, (b) n + 1 has at most one positive odd non-trivial divisor, and (c) if n = 2^t r - 1, for r odd and r \neq 1, then a is a multiple of 2^{t - 1}.

scholarly journals Matrix Approach to Formulate and Search k-ESS of Graphs Using the STP Theory

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Jumei Yue ◽  
Yongyi Yan ◽  
He Deng
Keyword(s):  
Sufficient Conditions ◽  
Complete Information ◽  
Stable Set ◽  
Matrix Product ◽  
Matrix Approach ◽  
Matrix Operation ◽  
Network Systems ◽  
Necessary And Sufficient ◽  
Semitensor Product Of Matrices ◽  
Product Of Matrices

In this paper, the structure of graphs in terms of k-externally stable set (k-ESS) is investigated by a matrix method based on a new matrix product, called semitensor product of matrices. By defining an eigenvector and an eigenvalue of the node subset of a graph, three necessary and sufficient conditions of k-ESS, minimum k-ESS, and k-kernels of graphs are proposed in a matrix form, respectively. Using these conditions, the concepts of k-ESS matrix, minimum k-ESS matrix, and k-kernel matrix are introduced. These matrices provide complete information of the corresponding structures of a graph. Further, three algorithms are designed, respectively, to find all these three structures of a graph by conducting a series of matrix operation. Finally, the correctness and effectiveness of the results are checked by studying an example. The proposed method and results may offer a new way to investigate the problems related to graph structures in the field of network systems.

scholarly journals On cryptographic properties of (n + 1)-bit S-boxes constructed by known n-bit S-boxes

2020 ◽  
Vol 15 (1) ◽  
pp. 258-265
Author(s):  
Yu Zhou ◽  
Daoguang Mu ◽  
Xinfeng Dong
Keyword(s):  
Sufficient Conditions ◽  
Sum Of Squares ◽  
Basic Component ◽  
Necessary And Sufficient Conditions ◽  
Autocorrelation Functions ◽  
Walsh Spectrum ◽  
Cryptographic Algorithms ◽  
Necessary And Sufficient ◽  
Relationship Of

AbstractS-box is the basic component of symmetric cryptographic algorithms, and its cryptographic properties play a key role in security of the algorithms. In this paper we give the distributions of Walsh spectrum and the distributions of autocorrelation functions for (n + 1)-bit S-boxes in [12]. We obtain the nonlinearity of (n + 1)-bit S-boxes, and one necessary and sufficient conditions of (n + 1)-bit S-boxes satisfying m-order resilient. Meanwhile, we also give one characterization of (n + 1)-bit S-boxes satisfying t-order propagation criterion. Finally, we give one relationship of the sum-of-squares indicators between an n-bit S-box S0 and the (n + 1)-bit S-box S (which is constructed by S0).

Separability criteria based on the Bloch representation of density matrices

2007 ◽  
Vol 7 (7) ◽  
pp. 624-638
Author(s):  
J. de Vicente
Keyword(s):  
Sufficient Conditions ◽  
Quantum Systems ◽  
Necessary Condition ◽  
Sufficient Condition ◽  
Pure Product ◽  
Separability Problem ◽  
Arbitrary Dimensions ◽  
Necessary And Sufficient ◽  
Bloch Representation

We study the separability of bipartite quantum systems in arbitrary dimensions using the Bloch representation of their density matrix. This approach enables us to find an alternative characterization of the separability problem, from which we derive a necessary condition and sufficient conditions for separability. For a certain class of states the necessary condition and a sufficient condition turn out to be equivalent, therefore yielding a necessary and sufficient condition. The proofs of the sufficient conditions are constructive, thus providing decompositions in pure product states for the states that satisfy them. We provide examples that show the ability of these conditions to detect entanglement. In particular, the necessary condition is proved to be strong enough to detect bound entangled states.

Sign in / Sign up

Export Citation Format

Share Document