Natural exact covering systems and the reversion of the Möbius series

11/11/2017
by   I. P. Goulden, et al.
0

We prove that the number of natural exact covering systems of cardinality k is equal to the coefficient of x^k in the reversion of the power series ∑_k > 1μ (k) x^k, where μ(k) is the usual number-theoretic Möbius function. Using this result, we deduce an asymptotic expression for the number of such systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

The biclique covering number of grids

We determine the exact value of the biclique covering number for all gri...
research
06/09/2021

Uniform intersecting families with large covering number

A family ℱ has covering number τ if the size of the smallest set interse...
research
11/02/2017

Network-size independent covering number bounds for deep networks

We give a covering number bound for deep learning networks that is indep...
research
10/20/2017

The Importance of System-Level Information in Multiagent Systems Design: Cardinality and Covering Problems

A fundamental challenge in multiagent systems is to design local control...
research
01/01/2019

Sharp Bounds for Mutual Covering

Verdú reformulated the covering problem in the non-asymptotic informatio...
research
03/14/2022

Infinite Wordle and the Mastermind numbers

I consider the natural infinitary variations of the games Wordle and Mas...
research
12/19/2018

Pattern Analysis of World Conflicts over the past 600 years

We analyze the largest database available for violent conflicts, the one...

Please sign up or login with your details

Forgot password? Click here to reset