Related papers: Intersection Norms and One-faced Collection of Cur…

In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…

We relate the Gromov norm on homology classes to the harmonic norm on the dual cohomology and obtain double sided bounds in terms of the volume and other geometric quantities of the underlying manifold. Along the way, we provide comparisons…

An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if…

Let $\Omega=(\omega_{j})_{j\in I}$ be a collection of pairwise non-isotopic simple closed curves on the closed, orientable, genus $g$ surface $S_{g}$, such that $\omega_{i}$ and $\omega_{j}$ intersect exactly once for $i\neq j$. It was…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

A conflict-free $k$-coloring of a graph $G=(V,E)$ assigns one of $k$ different colors to some of the vertices such that, for every vertex $v$, there is a color that is assigned to exactly one vertex among $v$ and $v$'s neighbors. Such…

The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of…

A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…

This paper defines new intersection homology groups. The basic idea is this. Ordinary homology is locally trivial. Intersection homology is not. It may have significant local cycles. A local-global cycle is defined to be a family of such…

Intersection homology is obtained from ordinary homology by imposing conditions on how the embedded simplices meet the strata of a space $X$. In this way, for the middle perversity, properties such as strong Lefschetz are preserved. This…

The Thurston norm of a 3-manifold measures the complexity of surfaces representing two-dimensional homology classes. We study the possible unit balls of Thurston norms of 3-manifolds $M$ with $b_1(M) = 2$, and whose fundamental groups admit…

We study geometric properties of linear strata of uni-singular curves. The singularities of closures of the strata are resolved and the resolutions are represent as projective bundles. This enables to study their geometry. In particular we…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

We define a norm on homology of punctured tori equipped with a complete hyperbolic metric of finite volume and use it to find asymptotics on the growth of the number of simple geodesics of bounded length.

This paper focuses on intersection of closed curves on translation surfaces. Namely, we investigate the question of determining the intersection of two closed curves of a given length on such surfaces. This question has been investigated in…

We address the problem of computing bounds for the self-intersection number (the minimum number of self-intersection points) of members of a free homotopy class of curves in the doubly-punctured plane as a function of their combinatorial…

We present a new framework for multi-view geometry in computer vision. A camera is a mapping between $\mathbb{P}^3$ and a line congruence. This model, which ignores image planes and measurements, is a natural abstraction of traditional…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

The properties of the intersection algebra of two principal monomial ideals in a polynomial ring are investigated in detail. Results are obtained regarding the Hilbert series and the canonical ideal of the intersection algebra using methods…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…