Related papers: Covering systems with odd moduli
Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…
A Parity Alternating Permutation of the set $[n] = \{1, 2,\ldots, n\}$ is a permutation with even and odd entries alternatively. We deal with parity alternating permutations having an odd entry in the first position, PAPs. We study the…
What is the largest constant $c\in [0,1]$ with the property that every finite collection $\mathcal{C}$ of axis-parallel squares in the plane admits a disjoint sub-collection $\mathcal{S}$ occupying at least a fraction $c$ of the area…
In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a characterization of spectra, i.e., sets of natural numbers that are the cardinalities of finite models of first order sentences. G\"unter Asser…
We present a list of open questions in the theory of holomorphic foliations, possibly with singularities. Some problems have been around for a while, others are very accessible.
A new ordering, extending the notion of universal cycles of Chung {\em et al.} (1992), is proposed for the blocks of $k$-uniform set systems. Existence of minimum coverings of pairs by triples that possess such an ordering is established…
We study variants of the Erd\H os distance problem and dot products problem in the setting of the integers modulo $q$, where $q = p^{\ell}$ is a power of an odd prime.
In 1985 Hopcroft, Joseph and Whitesides showed it is NP-complete to decide whether a carpenter's ruler with segments of given positive lengths can be folded into a line of at most a given length, such that the folded hinges alternate…
The study of Complex Systems is considered by many to be a new scientific field, and is distinguished by being a discipline that has applications within many separate areas of scientific study. The study of Neural Networks, Traffic…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
We approach the cycle double cover conjecture by looking for a circular 2-cell embedding of cubic graphs on an arbitrary surface. It is easy to see that if such an embedding exists, we can get to it from an arbitrary starting 2-cell…
We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…
Anomalous radio flux ratios in four-image gravitational lens systems can be explained by adding a clumpy cold dark matter (CDM) component to the potential of the lens galaxy. Evans & Witt (2003) recently suggested that smooth multipole…
A $k$-cycle with a pendant edge attached to each vertex is called a $k$-sun. The existence problem for $k$-sun decompositions of $K_v$, with $k$ odd, has been solved only when $k=3$ or $5$. By adapting a method used by Hoffmann, Lindner and…
For many years it was routine to use equal model prior probabilities in Bayesian model uncertainty analysis. At least twenty years ago it became clear that this was problematic, leading to support of much too large models in the…
Solutions for the fields in a coated cylinder where the core radius is bigger than the shell radius are seemingly unphysical, but can be given a physical meaning if one transforms to an equivalent problem by unfolding the geometry. In…
In this paper we study modules coinvariant under automorphisms of their projective covers. We first provide an alternative, and in fact, a more succinct and conceptual proof for the result that a module $M$ is invariant under automorphisms…
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…
Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such…
Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…