Related papers: Geometric intersection in representations of mappi…

We try to find a geometric interpretation of the wedge product of positive closed laminar currents in $\mathbb{C}^2$. We say such a wedge product is geometric if it is given by intersecting the disks filling up the currents. Uniformly…

We study closed geodesics on hyperbolic surfaces, and give bounds for their angles of intersection and self-intersection, and for the sides of the polygons that they form, depending only on the lengths of the geodesics

The mapping class group of an orientable surface, which records its symmetries up to isotopy, plays a central role in low-dimensional topology. This chapter explores the foundational problem of determining minimal generating sets for these…

A graph $G$ with vertex set $\{v_1,v_2,\ldots,v_n\}$ is an intersection graph of segments if there are segments $s_1,\ldots,s_n$ in the plane such that $s_i$ and $s_j$ have a common point if and only if $\{v_i,v_j\}$ is an edge of~$G$. In…

Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are…

The Johnson filtration of the mapping class group of a compact, oriented surface is the descending series consisting of the kernels of the actions on the nilpotent quotients of the fundamental group of the surface. Each term of the Johnson…

It is shown that a formal mapping between two real-analytic hypersurfaces in complex space is convergent provided that neither hypersurface contains a nontrivial holomorphic variety. For higher codimensional generic submanifolds,…

Let M be a closed hyperbolic three manifold. We construct closed surfaces which map by immersions into M so that for each one the corresponding mapping on the universal covering spaces is an embedding, or, in other words, the corresponding…

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…

The aim of this paper is to use the framework of incidence geometry to develop a theory that permits to model both the inner and outer automorphisms of a group G simultaneously. More precisely, to any group G, we attempt to associate an…

We prove for the first time a pointwise lower estimate of the normal injectivity radius of an embedded hypersurface in an arbitrary Riemannian manifold. Main applications include: (i) a pointwise lower estimate of the graphing radius of a…

We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…

We derive two finiteness properties as consequences of the geometrical non-degeneracy of an algebraic subvariety $W$ of a power of the multiplicative group, concerning the intersections of $W$ with translates of a subtorus $H$ of dimension…

The geometric mean of two matrices is considered and analyzed from a computational viewpoint. Some useful theoretical properties are derived and an analysis of the conditioning is performed. Several numerical algorithms based on different…

In [ES2], the first and the third authors introduced new classes in the Johnson cokernels of the mapping class groups of surfaces by a representation theoretic approach based on some previous results for the Johnson cokernels of the…

We show algorithms for computing representative families for matroid intersections and use them in fixed-parameter algorithms for set packing, set covering, and facility location problems with multiple matroid constraints. We complement our…

Let G be an arbitrary simple graph. The main results are explicit representations of the edge cone of G as a finite intersection of closed halfspaces. If G is bipartite and connected we determine the facets of the edge cone and present a…

Any finite configuration of curves with minimal intersections on a surface is a configuration of shortest geodesics for some Riemannian metric on the surface. The metric can be chosen to make the lengths of these geodesics equal to the…

In FOCS'2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied…

Let $G$ be a finite group. The intersection graph of $G$ is a graph whose vertex set is the set of all proper non-trivial subgroups of $G$ and two distinct vertices $H$ and $K$ are adjacent if and only if $H\cap K \neq \{e\}$, where $e$ is…