Related papers: Disjoint axis-parallel segments without a circumsc…

This is the second report of our work on the construction of directed strongly regular graphs. In our previous work, we constructed a couple of infinite families of new directed strongly regular graphs on the sets of antiflags of partial…

We construct families of optical semi-discrete composite solitons (SDCSs), with one or two independent propagation constants, supported by a planar slab waveguide, XPM-coupled to a periodic array of stripes. Both structures feature the…

In this article, we generate large families of non-isomorphic and signless Lalacian cospectral graphs using partial transpose on graphs. Our constructions are significantly powerful. More than $70\%$ of non-isomorphic signless-Laplacian…

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve…

We show that every outerplanar graph $G$ can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and…

We construct symmetric convex bodies that are not intersection bodies, but all of their central hyperplane sections are intersection bodies. This result extends the studies by Weil in the case of zonoids and by Neyman in the case of…

We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected…

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

We prove that under certain combinatorial conditions, the realization spaces of line arrangements on the complex projective plane are connected. We also give several examples of arrangements with eight, nine and ten lines which have…

We discover a simple construction of a four-dimensional family of smooth surfaces of general type with $p_g(S)=q(S)=0$, $K^2_S=3$ with cyclic fundamental group $C_{14}$. We use a degeneration of the surfaces in this family to find…

In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius $\rho$ equal to $3$ or $4$, and are $1/2^i$-th parts, for $i\in\{1,\ldots,u\}$ of binary (respectively, extended…

We construct exceptional sequences of line bundles of maximal length on a family of surfaces isogenous to a higher product of unmixed type with $p_g=q=0$.

It is known that the long line supports $2^{\aleph_1}$ many non-diffeomorphic differential structures. We show that the long plane supports a similar number of exotic differential structures, ie structures which are not merely diffeomorphic…

We construct a series of examples of non--flat non--homogeneous parabolic geometries that carry a symmetry of the parabolic geometry at each point.

Let $P$ be a set of $n\geq 2$ points in general position in $R^2$. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if…

A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line, or block, is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points…

These last years an increasing interest appeared for studying the planar discontinuous piecewise differential systems motivated by the rich applications in modelling real phenomena. One of the difficulties for understanding the dynamics of…

We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most $k$ of its crossings. This definition is…