Related papers: Identifying logarithmic tracts
We define a suitably tame class of singular symplectic curves in 4-manifolds, namely those whose singularities are modeled on complex curve singularities. We study the corresponding symplectic isotopy problem, with a focus on rational…
A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial set $S$ of vertices such that every vertex can be reached…
We study tori attached to the fundamental groups of plane curves with arbitrary singularities. These tori provide complete information about homology of finite abelian covers of the plane branched along the curve. We calculate these tori in…
We classify simple singularities of functions on space curves. We show that their bifurcation sets have properties very similar to those of functions on smooth manifolds and complete intersections [1,2]: the k(pi, 1)-theorem for the…
We prove that every curve on a rationally connected variety is algebraically equivalent to a (non-effective) integral sum of rational curves.
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…
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…
We show that the direct image of the filtered logarithmic de Rham complex is a direct sum of filtered logarithmic complexes with coefficients in variations of Hodge structures, using a generalization of the decomposition theorem of…
In this expository note we present an elementary direct rigorous definition and the simplest properties of the winding number. This definition is simpler than the one given in some textbooks. We show how to compute the winding number…
We give an effective iterative characterization of the classes of (smooth, rational) (-1)-curves on the blowup of the projective plane at general points. Such classes are characterized as having self-intersection -1, arithmetic genus 0, and…
Denoting by ${\mathcal L}_d(m_0,m_1,...,m_r)$ the linear system of plane curves passing through $r+1$ generic points $p_0,p_1,...,p_r$ of the projective plane with multiplicity $m_i$ (or larger) at each $p_i$, we prove the…
There are noninjective maps from surface groups to limit groups that don't kill any simple closed curves. As a corollary, there are noninjective all-loxodromic representations of surface groups to SL(2,C) that don't kill any simple closed…
We initiate the study of a class of real plane algebraic curves which we call expressive. These are the curves whose defining polynomial has the smallest number of critical points allowed by the topology of the set of real points of a…
The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…
We consider fibrations by affine lines on smooth affine surfaces obtained as complements of smooth rational curves $B$ in smooth projective surfaces $X$ defined over an algebraically closed field of characteristic zero. We observe that…
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…
We show that a sequence of smooth analytic curves of the unit ball of the complex plane, for which the genus is bounded by the area, converges to a lamination in a weak sense.
The natural logarithm can be represented by an infinite series that converges for all positive real values of the variable, and which makes concavity patently obvious. Concavity of the natural logarithm is known to imply, among other…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
The polylogarithmic time hierarchy structures sub-linear time complexity. In recent work it was shown that all classes $\tilde{\Sigma}_{m}^{\mathit{plog}}$ or $\tilde{\Pi}_{m}^{\mathit{plog}}$ ($m \in \mathbb{N}$) in this hierarchy can be…