Results 171 to 180 of about 448,655 (204)
Some of the next articles are maybe not open access.
On the circulant intuitionistic fuzzy matrices
Soft Computing, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Realizable list by circulant and skew-circulant matrices
2022Summary: In this paper for two given sets of eigenvalues, which one of them is the eigenvalues of circulant matrix and the other is the eigenvalues of skew-circulant matrix, we find a nonnegative matrix, such that the union of two sets be the spectrum of nonnegative matrices.
Nazari, Alimohammad, Mohammadi, Reza
openaire +2 more sources
Circulative Matrices of Degree $\theta $
SIAM Journal on Matrix Analysis and Applications, 1992In this paper a special class of matrices W in $\mathcal{C}^{n \times n} $ that are a generalization of reflexive and antireflexive matrices are introduced, their fundamental properties are developed, and a decomposition method associated with W is presented.
openaire +3 more sources
Weak Convergence in Circulant Matrices
Journal of Theoretical Probability, 2005A circulant matrix is a real square matrix such that each row is obtained by shifting the previous row cyclically. The authors consider a probability measure on the Borel sets of \(d\times d\) circulant matrices, and consider the problem of weak convergence of the convolution sequence \((\mu^n)_{n\geq1}\) on the Borel sets of the closed multiplicative ...
Cureg, E., Mukherjea, A.
openaire +1 more source
Polynomial Equations and Circulant Matrices
The American Mathematical Monthly, 2001(2001). Polynomial Equations and Circulant Matrices. The American Mathematical Monthly: Vol. 108, No. 9, pp. 821-840.
Dan Kalman, James E. White
openaire +2 more sources
The Structure of Monomial Circulant Matrices
SIAM Journal on Algebraic Discrete Methods, 1987Consider the generalized circulant matrices recently introduced by P. J. Davis and K. Wang, where row i is obtained from row 1 by permuting the entries and also multiplying by scaling factors. When such families are (like circulants) closed under multiplication, they can be reduced to certain standard forms that are in fact related to twisted group ...
openaire +2 more sources
Determinants of binary circulant matrices
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004This paper investigate the problem of deciding whether or not determinants of binary circulant matrices (i.e. matrices with entries in either {0,1} or {-1,1} ) can reach Hadamard's bound. It finds necessary and sufficient conditions for the existence of such matrices. A direct consequence of this study relates to the existence of Barker sequences.
Gérard Maze, Hugo Parlier
openaire +2 more sources
On sign symmetric circulant matrices
Applied Mathematics and Computation, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices
Journal of Combinatorial Optimization, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Klinz, B., Woeginger, G.J.
openaire +3 more sources
On digraphs with circulant adjacency matrices
Archiv der Mathematik, 1990Let \(F_ n\) be the family of digraphs with n vertices consisting of n- cycles with circulant adjacency matrices. (1) We characterize the isomorphic digraphs in \(F_ n.\) (2) Let \(n=p_ 1^{k_ 1}p_ 2^{k_ 2}...p_ t^{k_ t}\) be the prime-power decomposition of the positive integer n.
openaire +2 more sources