Related papers: Intersections of complex structures

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

We investigate the regularity of the marginals onto hyperplanes for sets of finite perimeter. We prove, in particular, that if a set of finite perimeter has log-concave marginals onto a.e. hyperplane then the set is convex.

We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…

Over the complex numbers, the complement of a collection of hyperplanes is a widely-studied object; the cohomology ring, in particular, is known to have a structure depending only on the combinatorial properties of the intersection of…

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…

This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…

Let $V$ be a finite dimensional complex vector space and $W\subseteq \GL(V)$ be a finite complex reflection group. Let $V^{\reg}$ be the complement in $V$ of the reflecting hyperplanes. We prove that $V^{\reg}$ is a $K(\pi,1)$ space. This…

In this note we study curves (arrangements) in the complex projective plane which can be considered as generalizations of free curves. We construct families of arrangements which are nearly free and possess interesting geometric properties.…

Understanding the structure of indecomposable $n$-dimensional persistence modules is a difficult problem, yet is foundational for studying multipersistence. To this end, Buchet and Escolar showed that any finitely presented rectangular…

We prove an estimate for arbitrary measure of sections of convex bodies. The proof is based on a stability result for intersection bodies.

In this paper we consider the complex vector spaces of holomorphic cross-sections of homogeneous holomorphic vector bundles over elliptic adjoint orbits, and provide a sufficient condition for the vector spaces to be finite dimensional in…

Geometric embedding of graphs in a point set in the plane is a well known problem. In this paper, the complexity of a variant of this problem, where the point set is bounded by a simple polygon, is considered. Given a point set in the plane…

Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

Fake projective planes are smooth complex surfaces of general type with Betti numbers equal to those of the usual projective plane. They come in complex conjugate pairs and have been classified as quotients of the two-dimensional ball by…

Given a plane geometric graph $G$ on $n$ vertices, we want to augment it so that given parity constraints of the vertex degrees are met. In other words, given a subset $R$ of the vertices, we are interested in a plane geometric supergraph…