Related papers: Disjoint axis-parallel segments without a circumsc…
A set of n points in the plane which are not all collinear defines at least n distinct lines. Chen and Chv\'atal conjectured in 2008 that a similar result can be achieved in the broader context of finite metric spaces. This conjecture…
We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…
We completely describe the structure of the connected components of transversals to a collection of n line segments in R^3. We show that n>2 arbitrary line segments in R^3 admit 0, 1, ..., n or infinitely many line transversals. In the…
We construct a quasiconformally homogeneous hyperbolic Riemann surface-other than the hyperbolic plane-that does not admit a bounded pants decomposition. Also, given a connected orientable topological surface of infinite type with compact…
Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design…
We construct an infinite family of topologically slice 2--component boundary links $\ell_i$, none of which is smoothly concordant to a split link, such that $g_4(\ell_i)=i$.
For each finite configuration of distinct points in the plane, there is an associated lattice of noncrossing partitions. When these points form the vertices of a convex polygon, the result is the classical noncrossing partition lattice,…
In this article we give several examples of line bundles on certain non-compact surfaces that cannot be equipped with a flat connection.
We construct three families of pairs of genus 2 curves over a field K, whose Jacobians are isomorphic as unpolarized abelian varieties. Each family is parameterized by an open subset of the Projective line over K. Our construction is based…
In this paper we count the number of isomorphism classes of geometrically indecomposable quasi-parabolic structures of a given type on a given vector bundle on the projective line over a finite field. We give a conjectural cohomological…
The series-parallel (SP) graphs are those containing no topological $K_{_4}$ and are considered trivial. We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of $K_{_4}$ whose edges with both ends 3-valent…
The aim of the paper is to provide a series of new examples of smooth surfaces in P^4, not of general type, in degrees varying from 12 up to 14, and to describe their geometry. By using mainly syzygies and liaison techniques, we construct…
For a finite set $P$ of points in the plane in general position, a \emph{crossing family} of size $k$ in $P$ is a collection of $k$ line segments with endpoints in $P$ that are pairwise crossing. It is a long-standing open problem to…
It is shown that exactly 7 distance-transitive cubic graphs among the existing 12 possess a particular ultrahomogeneous property with respect to oriented cycles realizing the girth that allows the construction of a related Cayley digraph…
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
We study smooth threefolds of the projective space of dimension 5 whose quadrisecant lines don't fill up the space. We give a complete classification of those threefolds X whose only quadrisecant lines are the lines contained in X. Then we…
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…