Corrigendum to Theorem 5 of the paper "Asymptotic density of A ⊂ ℕ and density of the ratio set R(A) (Acta Arith. 87 (1998), 67-78)
Counting functions and finite differences.
Counting Keith numbers.
Counting Maximal Distance-Independent Sets in Grid Graphs
Previous work on counting maximal independent sets for paths and certain 2-dimensional grids is extended in two directions: 3-dimensional grid graphs are included and, for some/any ℓ ∈ N, maximal distance-ℓ independent (or simply: maximal ℓ-independent) sets are counted for some grids. The transfer matrix method has been adapted and successfully applied
Counting monic irreducible polynomials in for which order of is odd
Hasse showed the existence and computed the Dirichlet density of the set of primes for which the order of is odd; it is . Here we mimic successfully Hasse’s method to compute the density of monic irreducibles in for which the order of is odd. But on the way, we are also led to a new and elementary proof of these densities. More observations are made, and averages are considered, in particular, an average of the ’s as varies through all rational primes.
Counting non-isomorphic maximal independent sets of the -cycle graph.
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Covering densities
Covering systems and generating functions
Covering systems, Kubert identities and difference equations
Covering the integers by arithmetic sequences
Critères de non-automaticité et leurs applications
Criteria for testing Wall's question
In this paper we find certain equivalent formulations of Wall's question and derive two interesting criteria that can be used to resolve this question for particular primes.
Cycle peaks and partial derivatives. (Pics de cycles et dérivés partielles.)
Cyclotomic matrices and a limit formula for hₚ¯
Cyclotomic polynomials with large coefficients
Cyclotomic properties of the Rudin-Shapiro polynomials.