Related papers: An Unexpected Class of 5+gon-free Line Patterns
There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…
Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…
We prove that for any cubic polynomial of slice rank $r$, the intersection of all linear subspaces of minimal codimension contained in the corresponding hypersurface has codimension $\le r^2+\frac{(r+1)^2}{4}+r$ in the affine space. This is…
We give a geometric characterisation of plus-one generated projective line arrangements that are next-to-free. We present new succinct proofs, via associated line bundles, for some properties of plus-one generated projective line…
Let $A$ be a transcendental entire function of finite order. We show that if the differential equation $w''+Aw=0$ has two linearly independent solutions with only real zeros, then the order of $A$ must be an odd integer or one half of an…
Given a finite grid in $\mathbb{R}^2$, how many lines are needed to cover all but one point at least $k$ times? Problems of this nature have been studied for decades, with a general lower bound having been established by Ball and Serra. We…
We classify the unimodular equivalence classes of inclusion-minimal polygons with a certain fixed lattice width. As a corollary, we find a sharp upper bound on the number of lattice points of these minimal polygons.
A matching of the set $[2n]=\{ 1,2,\ldots ,2n\}$ is a partition of $[2n]$ into blocks with two elements, i.e. a graph on $[2n]$ such that every vertex has degree one. Given two matchings $\sigma$ and $\tau$ , we say that $\sigma$ is a…
By characterizing all orthogonal polynomials sequences $(P_n)_{n\geq 0}$ for which $$ (ax+b)(\triangle +2\,\mathrm{I})P_n(x(s-1/2))=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\,\mathrm{I}$ is the identity operator, $x$…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
We construct a countable infinite graph G that does not contain cycles of length four having the property that the sequence of graphs $G_n$ induced by the first $n$ vertices has minimum degree $\delta(G_n)> n^{\sqrt{2}-1+o(1)}$.
A set without tangents in $\PG(2,q)$ is a set of points S such that no line meets S in exactly one point. An exterior set of a conic $\mathcal{C}$ is a set of points $\E$ such that all secant lines of $\E$ are external lines of…
We address the problem of covering a target segment $\overline{uv}$ using a finite set of guards $\mathcal{S}$ placed on a source segment $\overline{xy}$ within a simple polygon $\mathcal{P}$, assuming weak visibility between the target and…
The main purpose of the present paper is to study the numerical properties of supersolvable resolutions of line arrangements. We provide upper-bounds on the so-called extension to supersolvability numbers for certain extreme line…
The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…
In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…
We consider sets of positive integers containing no sum of two elements in the set and also no product of two elements. We show that the upper density of such a set is strictly smaller than 1/2 and that this is best possible. Further, we…