A Pfaffian-Hafnian analogue of Borchardt's identity.
Ishikawa, Masao, Kawamuko, Hiroyuki, Okada, Soichi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Ishikawa, Masao, Kawamuko, Hiroyuki, Okada, Soichi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xin, Guoce (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Papaschinopoulos, G., Schinas, C.J., Stefanidou, G. (2007)
Advances in Difference Equations [electronic only]
Similarity:
Zhongxue, Lü, Hongzheng, Xie (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Chatfield, J.A. (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Lowen, R., Verbeeck, C. (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ivanka Tr. Angelova, Lubin G. Vulkov (2007)
Kragujevac Journal of Mathematics
Similarity:
Demetrovics, Janos, Thi, Vu Duc, Giang, Nguyen Long (2013)
Serdica Journal of Computing
Similarity:
There are limitations in recent research undertaken on attribute reduction in incomplete decision systems. In this paper, we propose a distance-based method for attribute reduction in an incomplete decision system. In addition, we prove theoretically that our method is more effective than some other methods.
Puninagool, W., Leeratanavalee, S. (2007)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Shaofang Hong, Qi Sun (2004)
Czechoslovak Mathematical Journal
Similarity:
Let be a finite subset of a partially ordered set . Let be an incidence function of . Let denote the matrix having evaluated at the meet of and as its -entry and denote the matrix having evaluated at the join of and as its -entry. The set is said to be meet-closed if for all . In this paper we get explicit combinatorial formulas for the determinants of matrices and on any meet-closed set . We also obtain necessary and sufficient conditions for...
Wang, Liang-Cheng, Ma, Xiu-Fen, Liu, Li-Hong (2009)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity: