English
Related papers

Related papers: Proportion of blocking curves in a pencil

200 papers

We study the normal map for plane projective curves, i.e., the map associating to every regular point of the curve the normal line at the point in the dual space. We first observe that the normal map is always birational and then we use…

Algebraic Geometry · Mathematics 2021-06-15 Edoardo Ballico , Alessandro Oneto

The inverse spectral problem for the second-order differential pencil with quadratic dependence on the spectral parameter is studied. We obtain sufficient conditions for the global solvability of the inverse problem, prove its local…

Spectral Theory · Mathematics 2021-03-18 Natalia P. Bondarenko , Andrey V. Gaidel

In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…

Computational Geometry · Computer Science 2025-02-25 Simon D. Fink , Matthias Pfretzschner , Peter Stumpf

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

Combinatorics · Mathematics 2016-12-19 Tamás Héger , Zoltán Lóránt Nagy

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

Let $S$ be a smooth projective complex algebraic surface and $f\, :\, S\, \longrightarrow\, {\mathbb C}{\mathbb P}^2$ a finite map. Consider a pencil of hyperplane sections on ${\mathbb C}{\mathbb P}^2$ and pull it back to $S$. We address…

Algebraic Geometry · Mathematics 2018-06-07 Kalyan Banerjee

In this paper, we study the cardinality of the smallest set of lines of the finite projective spaces $\operatorname{PG}(n,q)$ such that every plane is incident with at least one line of the set. This is the first main open problem…

Combinatorics · Mathematics 2025-04-08 Benedek Kovács , Zoltán Lóránt Nagy , Dávid R. Szabó

We examine the maximum dimension of a linear system of plane cubic curves whose $\mathbb{F}_q$-members are all geometrically irreducible. Computational evidence suggests that such a system has a maximum (projective) dimension of $3$. As a…

Algebraic Geometry · Mathematics 2024-12-23 Shamil Asgarli , Dragos Ghioca

We study filling sets of simple closed curves on punctured surfaces. In particular we study lower bounds on the cardinality of sets of curves that fill and that pairwise intersect at most k times on surfaces with given genus and number of…

Geometric Topology · Mathematics 2015-08-17 Federica Fanoni , Hugo Parlier

Consider a Hamiltonian diffeomorphism $g$ on a surface. We describe several scenarios where a curve $L$ and its image $g(L)$ provide a simple evidence that $g$ is not autonomous.

Symplectic Geometry · Mathematics 2021-06-08 Michael Khanevsky

In this note we investigate three new pencils of symmetric surfaces in complex projective three-space. These have degree 6, 8 resp. 12 and are invariant under the action of subgroups of SO(4) containing the Heisenberg group. The pencils of…

Algebraic Geometry · Mathematics 2007-05-23 Alessandra Sarti

In this paper, we study the deformations of curves in the projective 3-space $\mathbb P^3$ (space curves), one of the most classically studied objects in algebraic geometry. We prove a conjecture due to J. O. Kleppe (in fact, a version…

Algebraic Geometry · Mathematics 2022-05-31 Hirokazu Nasu

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…

Algebraic Geometry · Mathematics 2008-02-03 G. Mikhalkin

A very general surface of degree at least four in projective space of dimension three contains no curves other than intersections with surfaces. We find a formula for the degree of the locus of surfaces of degree at least five which contain…

Algebraic Geometry · Mathematics 2014-07-09 Fernando Cukierman , Angelo Lopez , Israel Vainsencher

For a fixed integer $q$, the $q$-Coloring problem asks to decide if a given graph has a vertex coloring with $q$ colors such that no two adjacent vertices receive the same color. In a series of papers, it has been shown that for every $q…

Data Structures and Algorithms · Computer Science 2025-04-17 Ishay Haviv , Dror Rabinovich

The blocking number of a manifold is the minimal number of points needed to block out lights between any two given points in the manifold. It has been conjectured that if the blocking number of a manifold is finite, then the manifold must…

Differential Geometry · Mathematics 2008-08-27 Wing Kai Ho

Let $\mathcal{X}$ be a projective irreducible nonsingular algebraic curve defined over a finite field $\mathbb{F}_q$. This paper presents a variation of the St\"orh-Voloch theory and sets new bounds to the number of…

Algebraic Geometry · Mathematics 2016-08-18 Nazar Arakelian , Herivelto Borges

Nonsingular plane curves over a finite field $\mathbb{F}_q$ of degree $q+2$ passing through all the $\mathbb{F}_q$-points of the plane admita representation by $3\times 3$ matrices over $\mathbb{F}_q$. We classify their degenerations by…

Algebraic Geometry · Mathematics 2019-06-18 Masaaki Homma

A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…

Probability · Mathematics 2022-05-26 Ron Peled , Yinon Spinka

A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n^2) algorithm that, for any graph, finds…

Discrete Mathematics · Computer Science 2007-11-13 Kathie Cameron , Jack Edmonds , Benjamin Lévêque , Frédéric Maffray
‹ Prev 1 4 5 6 7 8 10 Next ›