go-v.orgdoi

Maximum Exponent of Boolean Circulant Matrices with Constant Number of Nonzero Entries in their Generating Vector

M.I. Bueno, Susana Furtado, N. Sherer · The Electronic Journal of Combinatorics · 2009

  • DOI 10.37236/155
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2009

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009

Abstract

It is well-known that the maximum exponent that an $n$-by-$n$ boolean primitive circulant matrix can attain is $n-1$. In this paper, we find the maximum exponent attained by $n$-by-$n$ boolean primitive circulant matrices with constant number of nonzero entries in their generating vector. We also give matrices attaining such exponents. Solving this problem we also solve two equivalent problems: 1) find the maximum exponent attained by primitive Cayley digraphs on a cyclic group whose vertices have constant outdegree; 2) determine the maximum order of a basis for ${\Bbb Z}_{n}$ with fixed cardinality.

Open the resolved locator · 10.37236/155

Metadata licence: OpenAlex metadata (CC0)