69 search results - page 7 / 14 » ejc 2008 |
EJC
2008
13 years 9 months ago
2008
The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [...
EJC
2008
13 years 9 months ago
2008
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
EJC
2008
13 years 9 months ago
2008
The problem of the r-identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle Cn with the minim...
EJC
2010
13 years 9 months ago
2010
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...
EJC
2008
13 years 9 months ago
2008
We consider certain modules of the symmetric groups whose basis elements are called tabloids. As modules of the symmetric groups, some of these are isomorphic to Springer modules. ...