Much success in finding rational points on curves has been obtained by using Chabauty’s Theorem, which applies when the genus of a curve is greater than the rank of the Mordell-Weil group of the Jacobian. When Chabauty’s Theorem does not directly apply to a curve C, a recent modification has been to cover the rational points on C by those on a covering collection of curves Di, obtained by pullb...

Let k be an integer. It is known that the maximum number of threecovers of a k-uniform intersecting family with covering number three is k − 3k + 6k − 4 for k = 3, 4 or k ≥ 9. In this paper, we prove that the same holds for k = 5, and show that a 5-uniform intersecting family with covering number three which has 76 three-covers is uniquely determined.

Edmonds’ fundamental theorem on arborescences [4] characterizes the existence of k pairwise edge-disjoint arborescences with the same root in a directed graph. In [9], Lovász gave an elegant alternative proof which became the base of many extensions of Edmonds’ result. In this paper, we use a modification of Lovász’ method to prove a theorem on covering intersecting bi-set families under matroi...

We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.

Abstract Under suitable conditions on a family ( I t )) ≥ 0 of Lipschitz mappings complete metric space, we show that, up to subsequence, the strong limit $S(t):=\lim _{n\to \infty }(I(t 2^{-n}))^{2^{n}}$ S(t):=<mml:...