Related papers: Boolean Function Analogs of Covering Systems
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of these objects was initiated by Erd\H{o}s in 1950, and over the following decades he asked many questions about them. Most…
We present a covering conjecture that we expect to be true below superstrong cardinals. We then show that the conjecture is true in hod mice. This work is a continuation of the work that started in Covering with Universally Baire Functions…
A covering system of the integers is a finite collection of arithmetic progressions whose union is the set of integers. A well-known problem on covering systems is the minimum modulus problem posed by Erd\H{o}s in 1950, who asked whether…
The concept of a covering system was first introduced by Erd\H{o}s in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of covering systems with certain restrictions on the moduli.…
Covering systems of the integers were introduced by Erd\H{o}s in 1950. Since then, many beautiful questions and conjectures about these objects have been posed. Most famously, Erd\H{o}s asked whether the minimum modulus of a covering system…
Recently the author presented a new approach to solving the coefficient problems for various classes of holomorphic functions $f(z) = \sum\limits_0^\infty c_n z^n$, not necessarily univalent. This approach is based on lifting the given…
We demonstrate under appropriate finiteness conditions that a coarse embedding induces an inequality of homological Dehn functions. Applications of the main results include a characterization of what finitely presentable groups may admit a…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
Suppose that Y is a cyclic cover of projective space branched over a hyperplane arrangement D, and that U is the complement of the ramification locus in Y. The first theorem implies that the Beilinson-Hodge conjecture holds for U if certain…
We investigate a question of Cooper adjacent to the Virtual Haken Conjecture. Assuming certain conjectures in number theory, we show that there exist hyperbolic rational homology 3-spheres with arbitrarily large injectivity radius. These…
The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined…
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how…
A reconstruction problem is formulated for Sperner systems, and infinite families of nonreconstructible Sperner systems are presented. This has an application to a reconstruction problem for functions of several arguments and identification…
This paper verifies a conjecture of Edelman and Reiner regarding the homology of the $h$-complex of a Boolean algebra. A discrete Morse function with no low-dimensional critical cells is constructed, implying a lower bound on connectivity.…
We establish basic results of complex function theory within certain algebras of holomorphic functions on coverings of Stein manifolds (such as algebras of Bohr's holomorphic almost periodic functions on tube domains or algebras of all…
We construct a Beurling generalized number system satisfying the Riemann hypothesis and whose integer counting function displays extremal oscillation in the following sense. The prime counting function of this number system satisfies…
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any…
A covering system is a finite collection of arithmetic progressions whose union is the set of integers. The study of covering systems with distinct moduli was initiated by Erd\H{o}s in 1950, and over the following decades numerous problems…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…