Related papers: Containment problem and combinatorics
Constraint programming (CP) is a powerful tool for modeling mathematical concepts and objects and finding both solutions or counter examples. One of the major strengths of CP is that problems can easily be combined or expanded. In this…
We construct two connected plane sets which can be embedded into rational curves. The first is a biconnected set with a dispersion point. It answers a question of Joachim Grispolakis. The second is indecomposable. Both examples are…
We describe geometrically and algebraically the set of unattainable points for the Rational Hermite Interpolation Problem (i.e. those points where the problem does not have a solution). We show that this set is a union of equidimensional…
Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…
In this paper we describe the intersection between the balls of maximal symplectic packings of $\P^2$. This analysis shows the existence of singular points for maximal packings of $\P^2$ by more than three equal balls. It also yields a…
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
If o and * are two binary operations in a number system, then three elements a,b,c in that number system are said to satisfy the distributive property of the operation o over the operation * if, ao(b*c)= (aob)*(aoc) Now, suppose that the…
We give the first example of a mosaic of three combinatorial designs with distinct parameters $2$-$(13,3,1)$, $2$-$(13,4,2)$, and $2$-$(13,6,5)$. Furthermore, we give examples of mosaics of $2$-$(9,3,2)$ designs that are not resolvable,…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
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…
We show that the number of non-trivial rational points of height at most $B$, that lie on the cubic surface $x_1x_2x_3=x_4(x_1+x_2+x_3)^2$, has order of magnitude $B(\log B)^6$. This agrees with the Manin conjecture.
A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…
When searching for small 4-configurations of points and lines, polycyclic configurations, in which every symmetry class of points and lines contains the same number of elements, have proved to be quite useful. In this paper we construct and…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
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…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
An optimal control problem on finite-dimensional positive cones is stated. Under a critical assumption on the cone, the corresponding Bellman equation is satisfied by a linear function, which can be computed by convex optimization. A…
There are four non-isomorphic configurations of triples that can form a triangle in a $3$-uniform hypergraph. Forbidding different combinations of these four configurations, fifteen extremal problems can be defined, several of which already…
Planar central configurations can be seen as critical points of the reduced potential or solutions of a system of equations. By the homogeneity and invariance of the potential with respect to SO(2), it is possible to see that the…