On subsequence sums of a zero-sum free sequence. II.
Gao, Weidong, Li, Yuanlin, Peng, Jiangtao, Sun, Fang (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gao, Weidong, Li, Yuanlin, Peng, Jiangtao, Sun, Fang (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Banerji, P.K., Al-Omari, S.K. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Messina, E., Muroya, Y., Russo, E., Vecchio, A. (2008)
Discrete Dynamics in Nature and Society
Similarity:
Singer, Dan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yuan, Pingzhi, Zeng, Xiangneng (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jonsson, Jakob (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Baltz, Andreas, Hegarty, Peter, Knape, Jonas, Larsson, Urban, Schoen, Tomasz (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sun, Fang (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Björner, Anders, Brenti, Francesco (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ardal, Hayri, Dvořák, Zdeněk, Jungić, Veselin, Kaiser, Tomáš (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Quattrocchi, Gaetano (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Siao Hong, Shuangnian Hu, Shaofang Hong (2016)
Open Mathematics
Similarity:
Let f be an arithmetic function and S = {x1, …, xn} be a set of n distinct positive integers. By (f(xi, xj)) (resp. (f[xi, xj])) we denote the n × n matrix having f evaluated at the greatest common divisor (xi, xj) (resp. the least common multiple [xi, xj]) of x, and xj as its (i, j)-entry, respectively. The set S is said to be gcd closed if (xi, xj) ∈ S for 1 ≤ i, j ≤ n. In this paper, we give formulas for the determinants of the matrices (f(xi, xj)) and (f[xi, xj]) if S consists of...