Related papers: Stabbing boxes with finitely many axis-parallel li…
For any natural number $d$ and positive number $\varepsilon$, we present a point set in the $d$-dimensional unit cube $[0,1]^d$ that intersects every axis-aligned box of volume greater than $\varepsilon$. These point sets are very easy to…
We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…
We show that for any finite partition of $\mathbb{N}$ there is an infinite sequence whose finite sums are monochromatic and such that infinitely many of the products with a fixed number of factors are monochromatic -- though not necessarily…
We study the problem of stabbing rectilinear polygons, where we are given $n$ rectilinear polygons in the plane that we want to stab, i.e., we want to select horizontal line segments such that for each given rectilinear polygon there is a…
We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…
We provide a complete classification of possible configurations of mutually pairwise touching infinite cylinders in Euclidian 3D space. It turns out that there is a maximum number of such cylinders possible in 3D independently on the shape…
The present paper is a continuation of \cite{jrz} and is devoted to the study of limit varieties of additively idempotent semirings. A limit variety is a nonfinitely based variety whose proper subvarieties are all finitely based. We present…
A set $\mathcal{G}$ of planar graphs on the same number $n$ of vertices is called simultaneously embeddable if there exists a set $P$ of $n$ points in the plane such that every graph $G \in \mathcal{G}$ admits a (crossing-free)…
In this paper, we study the number of compact sets needed in an infinite family of convex sets with a local intersection structure to imply a bound on its piercing number, answering a conjecture of Erd\H{o}s and Gr\"unbaum. Namely, if in an…
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…
This paper considers the problem of many-to-many disjoint paths in the hypercube $Q_n$ with $f$ faulty vertices and obtains the following result. For any integer $k$ with $1\leq k\leq n-2$, any two sets $S$ and $T$ of $k$ fault-free…
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of this paper is to delineate the boundary of decidability of…
For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds…
In this article we give combinatorial criteria to decide whether a transitive cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes, together with an explicit construction in the case that such a family…
In an earlier note [arXiv:2301.00295] it was shown that there is an upper bound to the number of disjoint Hopf links (and certain related links) that can be embedded in the unit cube where there is a fixed separation required between the…
We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…
Some aspects of a mathematical theory of rigidity and flexibility are developed for general infinite frameworks and two main results are obtained. In the first sufficient conditions, of a uniform local nature, are obtained for the existence…
We prove that, provided $d > k$, every sufficiently large subset of $\mathbf{F}_q^d$ contains an isometric copy of every $k$-simplex that avoids spanning a nontrivial self-orthogonal subspace. We obtain comparable results for simplices…
In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.
Given $n$ weighted points (positive or negative) in $d$ dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorithm for this problem is based on a reduction to a related…