Related papers: Topological complexity of finding flex points on c…

For quantum (quasi)particles living on complex toboggan-shaped curves which spread over N Riemann sheets the approximate evaluation of topology-controlled bound-state energies is shown feasible. In a cubic-oscillator model the low-lying…

A quadric in $\R P^3$ cuts a curve of degree 6 on a cubic surface in $\R P^3$. The papers classifies the nonsingular curves cut in this way on non-singular cubic surfaces up to homeomorphism. Two issues new in the study related to the first…

For a superelliptic curve $\mathcal X$, defined over $\mathbb Q$, let $\mathfrak p$ denote the corresponding moduli point in the weighted moduli space. We describe a method how to determine a minimal integral model of $\mathcal X$ such…

Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…

Consider a component of the Hilbert scheme whose general point corresponds to a degree d genus g smooth irreducible and nondegenerate curve in a projective variety X. We give lower bounds for the dimension of such a component when X is P^3,…

This paper addresses weak approximation for rationally connected varieties defined over the function field of a curve, especially at places of bad reduction. Our approach entails analyzing the rational connectivity of the smooth locus of…

We give a topological bound on the number of minimal models of a class of three dimensional log smooth pairs of general type.

We prove that holomorphic maps from an open subset of a complex smooth projective curve to a complex smooth projective rationally simply connected variety can be approximated by algebraic maps for the compact-open topology. This theorem can…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…

Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…

Let K be the function field of a connected regular scheme S of dimension 1, and let f : X -> Y be a finite cover of projective smooth and geometrically connected curves over K with g(X) greater or equal to 2. Suppose that f can be extended…

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The $t$-tessellability problem aims to decide whether there is a…

Let $X$ be a closed indefinite $4$-manifold with $b_+(X) = 3 \; ({\rm mod} \; 4)$ and with non-vanishing mod $2$ Seiberg--Witten invariants. We prove a new lower bound on the genus of a properly embedded surface in $X \setminus B^4$…

There is a close relationship between the embedded topology of complex plane curves and the (group-theoretic) arithmetic of elliptic curves. In a recent paper, we studied the topology of some arrangements of curves which include a special…

A taming symplectic structure provides an upper bound on the area of an approximately pseudoholomorphic curve in terms of its homology class. We prove that, conversely, an almost complex manifold with such an area bound admits a taming…

Analysis of motion algorithms for autonomous systems operating under variable external conditions leads to the concept of parametrized topological complexity \cite{CFW}. In \cite{CFW}, \cite{CFW2} the parametrized topological complexity was…

In this paper we begin to study curves on a weighted projective plane with one trivial weight, ${\mathbb P}(1,m,n)$, by determining the genus of curves of Fermat type. These are curves defined by a ``homogeneous'' polynomial analagous to…

Discrete Morse theory has emerged as a powerful tool for a wide range of problems, including the computation of (persistent) homology. In this context, discrete Morse theory is used to reduce the problem of computing a topological invariant…

We describe an algorithm that provably computes the rational torsion subgroup of the Jacobian of a curve without relying on height bounds. Instead, the strategy is to find upper bounds for the torsion subgroup using reduction modulo primes,…