Related papers: Self-intersection numbers of curves on the punctur…

We give an explicitly computable lower bound for the arithmetic self-intersection number of the dualizing sheaf on a large class of arithmetic surfaces. If some technical conditions are satisfied, then this lower bound is positive. In…

Given a graph $G$, an {\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the…

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph $G$, denoted by $\theta(G)$, is the minimum number of colors $k$ so that every $k$-coloring of $G$ is…

An $r$-uniform hypergraph ($r$-graph for short) is linear if any two edges intersect at most one vertex. Let $\mathcal{F}$ be a given family of $r$-graphs. An $r$-graph $H$ is called $\mathcal{F}$-free if $H$ does not contain any member of…

In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…

In this paper we present a way of computing a lower bound for genus of any smooth representative of a homology class of positive self-intersection in a smooth four-manifold $X$ with second positive Betti number $b_2^+(X)=1$. We study the…

Minimum numbers of fixed points or of coincidence components (realized by maps in given homotopy classes) are the principal objects of study in topological fixed point and coincidence theory. In this paper we investigate fiberwise analoga…

The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same…

The limiting character, introduced by Tillmann, has been studied recently in the context of Culler-Shalen theory. We extend the methods of the author's previous work to show that certain families of essential twice-punctured tori are…

Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer parameter $L>0$, an {\em $L$-bounded cut} is a subset $F$ of edges (vertices) such that the every path between $s$ and $t$ in $G\setminus F$ has length more…

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…

We report on new numerical computations of the set of self-contacts in tightly knotted tubes of uniform circular cross-section. Such contact sets have been obtained before for the trefoil and figure eight knots by simulated annealing -- we…

Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…

We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…

We show that the asymptotic growth rate for the minimal cardinality of a set of simple closed curves on a closed surface of genus $g$ which fill and pairwise intersect at most $K\ge 1$ times is $2\sqrt{g}/\sqrt{K}$ as $g \to \infty$ . We…

The proper connection number $pc(G)$ of a connected graph $G$ is defined as the minimum number of colors needed to color its edges, so that every pair of distinct vertices of $G$ is connected by at least one path in $G$ such that no two…

Let $\Lambda$ be a numerical semigroup, $\mathcal{C}\subseteq \mathbb{A}^n$ the monomial curve singularity associated to $\Lambda$, and $\mathcal{T}$ its tangent cone. In this paper we provide a sharp upper bound for the least positive…

Let $\Sigma$ be a hyperbolic surface. We study the set of curves on $\Sigma$ of a given type, i.e. in the mapping class group orbit of some fixed but otherwise arbitrary $\gamma_0$. For example, in the particular case that $\Sigma$ is a…

We consider plane curves isomorphic to C*. We prove that with one exception the branches at infinity can be separated by an automorphism of C^2. We also give a bound for selfintersection number of the resolution curve.