Related papers: On the minimum blocking semioval in PG(2,11)
We classify flag complexes on at most 12 vertices with torsion in the first homology group. The result is moderately computer-aided. As a consequence we confirm a folklore conjecture that the smallest poset whose order complex is homotopy…
We study a variational problem for the perimeter associated with the Grushin plane, called minimal partition problem with trace constraint. This consists in studying how to enclose three prescribed areas in the Grushin plane, using the…
In a previous paper, we obtained a cohomological obstruction to the existence of compact manifolds locally modelled on a homogeneous space. In this paper, we give a classification of the semisimple symmetric spaces to which this obstruction…
For a graph $G$ in which vertices are either black or white, a zero forcing process is an iterative vertex color changing process such that the only white neighbor of a black vertex becomes black in the next time step. A zero forcing set is…
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
A strong orientation of a graph $G$ is an assignment of a direction to each edge such that $G$ is strongly connected. The oriented diameter of $G$ is the smallest diameter among all strong orientations of $G$. A block of $G$ is a maximal…
A (Hasse) diagram of a finite partially ordered set (poset) P will be called quasiplanar if for any two incomparable elements u and v, either v is on the left of all maximal chains containing u, or v is on the right of all these chains.…
A blocker of $123$-avoiding permutation matrices refers to the set of zeros contained within an $n\times n$ $123$-forcing matrix. Recently, Brualdi and Cao provided a characterization of all minimal blockers, which are blockers with a…
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal non-percolating sets. Additional…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
The volume of a line bundle is defined in terms of a limsup. It is a fundamental question whether this limsup is a limit. It has been shown that this is always the case on generically reduced schemes. We show that volumes are limits in two…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
It is well known that a non-singular real plane projective curve of degree five with five connected components is separating if and only if its ovals are in non-convex position. In this article, this property is set into a different context…
A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons…
A compact classification of the projective lines defined over (commutative) rings (with unity) of all orders up to thirty-one is given. There are altogether sixty-five different types of them. For each type we introduce the total number of…
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes,…
We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…
The Hilbert scheme of n points in the projective plane parameterizes degree n zero-dimensional subschemes of the projective plane. We examine the dual cones of effective divisors and moving curves on the Hilbert scheme. By studying…
Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P…
In this paper, we study the problem of computing a minimum-width double-strip or parallelogram annulus that encloses a given set of $n$ points in the plane. A double-strip is a closed region in the plane whose boundary consists of four…