Related papers: At most 10 cylinders mutually touch: a Ramsey-theo…

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

Let $\Lambda$ be a numerical semigroup, $\mathcal{C}\subseteq \mathbb{A}^n$ the monomial curve singularity associated to $\Lambda$, and $\mathcal{T}$ its tangent cone. In this paper we provide a sharp upper bound for the least positive…

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Let $A$ be an abelian surface over $\mathbb{Q}$ whose geometric endomorphism ring is a maximal order in a non-split quaternion algebra. Inspired by Mazur's theorem for elliptic curves, we show that the torsion subgroup of $A(\mathbb{Q})$ is…

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…

As was pointed out by Nikulin [8] and Vinberg [10], a right-angled polyhedron of finite volume in hyperbolic n-space $\mathbb{H}^n$ has at least one cusp for $n\geq 5$. We obtain non-trivial lower bounds on the number of cusps of such…

Consider the system of $n$ identical hard balls in $\mathbb R^3$ moving freely and colliding elastically. We show that there exist initial conditions such that the number of collisions is exponential in $n$.

In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…

We use polynomial method techniques to bound the number of tangent pairs in a collection of $N$ spheres in $\mathbb{R}^n$ subject to a non-degeneracy condition, for any $n \geq 3$. The condition, inspired by work of Zahl for $n=3$, asserts…

Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy…

The restricted $(m,n;N)$-online Ramsey game is a game played between two players, Builder and Painter. The game starts with $N$ isolated vertices. Each turn Builder picks an edge to build and Painter chooses whether that edge is red or…

Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…

We Prove That The Uniform Upper Bound for the Number Of Limit Cycles Of The Lienard Equation of Degree 4 Can be equals to 2. Further We Suggest to Embedding Planar Lienard Equations In Higher Dimension and Present question of completly…

We prove geometric Ramsey-type statements on collections of lines in 3-space. These statements give guarantees on the size of a clique or an independent set in (hyper)graphs induced by incidence relations between lines, points, and reguli…

The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains a copy of $F$ or its complement contains $H$. Burr in 1981 proved a pleasingly general result that for any graph $H$, provided $n$ is…

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…

I introduce the problem of finding maximal sets of equiangular lines, in both its real and complex versions, attempting to write the treatment that I would have wanted when I first encountered the subject. Equiangular lines intersect in the…

In this paper we study the maximum number $N$ of limit cycles that can exhibit a planar piecewise linear differential system formed by two pieces separated by a straight line. More precisely, we prove that this maximum number satisfies…