English
Related papers

Related papers: Covering systems with odd moduli

200 papers

We prove that every distinct covering system has a modulus divisible by either 2 or 3.

Number Theory · Mathematics 2021-05-25 Robert D. Hough , Pace P. Nielsen

It is proved that if the least modulus of a distinct covering system is 4, its largest modulus is at least 60; also if the least modulus is 3, the LCM of the moduli is at least 120; finally, if the least modulus is 4, the LCM of the moduli…

Number Theory · Mathematics 2022-02-11 Jack Dalton , Ognian Trifonov

A positive integer n is called a covering number if there are some distinct divisors n_1,...,n_k of n greater than one and some integers a_1,...,a_k such that Z is the union of the residue classes a_1(mod n_1),...,a_k(mod n_k). A covering…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

Bob Hough recently disproved a long-standing conjecture of Paul Erd\H{o}s regarding covering systems. Inspired by his seminal paper, we describe analogs of covering systems to Boolean functions, and more generally, the problem of covering…

Combinatorics · Mathematics 2018-01-17 Anthony Zaleski , Doron Zeilberger

This paper surveys the theory of multiple packings and coverings. The study of multiple arrangements started in the 60s of the last century, and it was restricted mostly to lattice arrangements on the plane or of general arrangements of…

Metric Geometry · Mathematics 2022-02-24 Gábor Fejes Tóth

We prove a lifting theorem for odd Frattini covers of finite groups. Using this, we characterize solvable groups and more generally p-solvable groups in terms of containing a triple of elements of distinct prime power orders with product 1.…

Group Theory · Mathematics 2011-12-21 Robert Guralnick , Pham Huu Tiep

There exist irreducible exact covering systems (ECS). These are ECS which are not a proper split of a coarser ECS. However, an ECS admiting a maximal modulus which is divisible by at most two distinct primes, primely splits a coarser ECS.…

Combinatorics · Mathematics 2015-06-03 Ofir Schnabel

We answer a question of Erd\H{o}s by showing that the least modulus of a distinct covering system of congruences is no larger than $10^{18}$.

Number Theory · Mathematics 2016-05-04 Bob Hough

Manifolds all of whose geodesics are closed have been studied a lot, but there are only few examples known. The situation is different if one allows in addition for orbifold singularities. We show, nevertheless, that the abundance of new…

Differential Geometry · Mathematics 2018-11-27 Manual Amann , Christian Lange , Marco Radeschi

In this paper we construct a cover {a_s(mod n_s)}_{s=1}^k of Z with odd moduli such that there are distinct primes p_1,...,p_k dividing 2^{n_1}-1,...,2^{n_k}-1 respectively. Using this cover we show that for any positive integer m divisible…

Number Theory · Mathematics 2008-11-29 Ke-Jian Wu , Zhi-Wei Sun

Erd\H{o}s asked many mathematical questions. Some lead to exciting research, others turned out to be easily solved. In this article, we provide evidence that one of his questions, Erd\H{o}s problem \#278 , has no general answer. We do so by…

Combinatorics · Mathematics 2025-08-26 Stijn Cambie

It is well known that in an exact covering system in $\mathbb{Z}$, the biggest modulus must be repeated. Very recently, Kim gave an analogous result for certain quadratic fields, and Kim also conjectured that it must hold in any algebraic…

Number Theory · Mathematics 2013-01-21 Yupeng Jiang , Yingpu Deng

We give an historical account, including recent progress, on some problems of Erd\H os in number theory.

Number Theory · Mathematics 2019-08-02 Gérald Tenenbaum

Babai and Frankl posed the ``odd cover problem" of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order $n$ is covered an odd number of times. In a previous paper…

Combinatorics · Mathematics 2024-08-19 Calum Buchanan , Alexander Clifton , Eric Culver , Péter Frankl , Jiaxi Nie , Kenta Ozeki , Puck Rombach , Mei Yin

We prove that if the smallest modulus of a covering system with distinct moduli is $5$, then the largest modulus is at least 108. We also prove that if the smallest modulus of a covering system with distinct moduli is $5$, then the least…

Number Theory · Mathematics 2025-08-26 Jonah Klein

An important endeavor in computer science is to understand the expressive power of logical formalisms over discrete structures, such as words. Naturally, "understanding" is not a mathematical notion. This investigation requires therefore a…

Logic in Computer Science · Computer Science 2023-06-22 Thomas Place , Marc Zeitoun

An odd prime labeling is a variation of a prime labeling in which the vertices of a graph of order~$n$ are labeled with the distinct odd integers $1$ to $2n-1$ so that the labels of adjacent vertices are relatively prime. This paper…

Combinatorics · Mathematics 2022-08-19 Holly Carter , N. Bradley Fox

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…

Discrete Mathematics · Computer Science 2015-03-17 Friedrich Eisenbrand , Naonori Kakimura , Thomas Rothvoß , Laura Sanità

Erd\"os proved in 1946 that if a set $E\subset\mathbb{R}^n$ is closed and non-empty, then the set, called ambiguous locus or medial axis, of points in $\mathbb{R}^n$ with the property that the nearest point in $E$ is not unique, can be…

Classical Analysis and ODEs · Mathematics 2021-09-10 Piotr Hajłasz

In 1981 Edgar Enochs conjectured that every module has a flat cover and finally proved this in 2001. Since then a great deal of effort has been spent on studying different types of covers, for example injective and torsion free covers. In…

Group Theory · Mathematics 2012-07-16 Alex bailey , James Renshaw