English
Related papers

Related papers: Cutting Algebraic Curves into Pseudo-segments and …

200 papers

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

Algebraic Geometry · Mathematics 2007-05-23 Steven Kleiman , Ragni Piene

The Sparsest Cut is a fundamental optimization problem that has been extensively studied. For planar inputs the problem is in $P$ and can be solved in $\tilde{O}(n^3)$ time if all vertex weights are $1$. Despite a significant amount of…

Data Structures and Algorithms · Computer Science 2020-07-07 Amir Abboud , Vincent Cohen-Addad , Philip N. Klein

We prove a strong relation between Chern and log Chern invariants of algebraic surfaces. For a given arrangement of curves, we find nonsingular projective surfaces with Chern ratio arbitrarily close to the log Chern ratio of the log surface…

Algebraic Geometry · Mathematics 2008-06-11 Giancarlo Urzua

We study the intersection theory of punctured pseudoholomorphic curves in $4$-dimensional symplectic cobordisms. We first study the local intersection properties of such curves at the punctures. We then use this to develop topological…

Symplectic Geometry · Mathematics 2019-03-20 Richard Siefring

Let a set of nodes $\mathcal X$ in the plane be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Assume that\\ $\#\mathcal X=d(n,n-3)+3= (n+1)+n+\cdots+5+3.$ In this paper we prove that there are at most three…

Algebraic Geometry · Mathematics 2022-09-22 Hakop Hakopian

We study the local symplectic algebra of curves with semigroups $(4,5,6,7)$, $(4,5,6)$ and $(4,5,7)$. We use the method of algebraic restrictions to parameterized curves as in \cite{D1}. A new discrete invariant for algebraic restrictions…

Algebraic Geometry · Mathematics 2016-03-09 Fausto Assunção de Brito Lira , Wojciech Domitrz , Roberta Wik Atique

Given two distinct reduced, irreducible curves of given degrees, contained in projective space but whose union is not contained in a hyperplane, what is the largest number of points of intersection they can have? When the projective space…

In this paper, we present a novel approach to the problem of merging of B\'ezier curves with respect to the $L_2$-norm. We give illustrative examples to show that the solution of the conventional merging problem may not be suitable for…

Graphics · Computer Science 2017-02-10 Przemysław Gospodarczyk , Paweł Woźny

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on $n$ vertices up to a $1+\epsilon$ error must…

Data Structures and Algorithms · Computer Science 2018-01-01 Charles Carlson , Alexandra Kolla , Nikhil Srivastava , Luca Trevisan

It is known that Kolmogorov-Arnold-Moser boundaries appear in sufficiently smooth 2-dimensional area-preserving maps. When such boundaries are destroyed, they become pseudo-boundaries. We show that pseudo-boundaries can also be found in…

Statistical Mechanics · Physics 2009-10-30 Oded Farago , Yacov Kantor

We show how one may sometimes perform singular ambient surgery on the complex locus of a real algebraic curve and obtain what we call a floppy curve. A floppy curve is a certain kind of singular surface in CP(2), more general than the…

alg-geom · Mathematics 2015-12-22 Patrick M. Gilmer

We consider $n$-folding triangular curves, or $n$-folding t-curves, obtained by folding $n$ times a strip of paper in $3$, each time possibly left then right or right then left, and unfolding it with $\pi /3$ angles. An example is the well…

Combinatorics · Mathematics 2023-10-31 Francis Oger

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

Metric Geometry · Mathematics 2021-08-17 Brett Leroux , Luis Rademacher

Algebraic domains are regions in the plane surrounded by mutually disjoint non-singular real algebraic curves. Poincar'e-Reeb Graphs of them are graphs they naturally collapse: such graphs are formally formulated by Sorea, for example,…

Algebraic Geometry · Mathematics 2025-03-04 Naoki Kitazawa

Many of the classic graph problems cannot be solved in the Massively Parallel Computation setting (MPC) with strongly sublinear space per machine and $o(\log n)$ rounds, unless the 1-vs-2 cycles conjecture is false. This is true even on…

Data Structures and Algorithms · Computer Science 2022-11-22 Jacob Holm , Jakub Tětek

We study hyperplane covering problems for finite grid-like structures in $\mathbb{R}^d$. We call a set $\mathcal{C}$ of points in $\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\mathcal{C}$ in exactly $i$ points, for some…

Combinatorics · Mathematics 2025-01-28 Anurag Bishnoi , Shantanu Nene

We develop explicit techniques to investigate algebraic quasi-hyperbolicity of singular surfaces through the constraints imposed by symmetric differentials. We apply these methods to prove that rational curves on Barth's sextic surface,…

Algebraic Geometry · Mathematics 2022-09-28 Nils Bruin , Jordan Thomas , Anthony Várilly-Alvarado

A meander can be seen as a pair of transversally intersecting simple closed curves on a 2-sphere. We consider pairs of transversally intersecting simple closed curves on a closed oriented surface of arbitrary genus g. The number of such…

Geometric Topology · Mathematics 2023-04-06 Vincent Delecroix , Elise Goujard , Peter Zograf , Anton Zorich

According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…

Computational Geometry · Computer Science 2019-12-04 Adrian Dumitrescu

This paper presents active-set methods for minimizing nonconvex twice-continuously differentiable functions subject to bound constraints. Within the faces of the feasible set, we employ descent methods with Armijo line search, utilizing…

Optimization and Control · Mathematics 2025-08-29 Ernesto G. Birgin , Geovani N. Grapiglia , Diaulas S. Marcondes