English
Related papers

Related papers: Classification of Incidence Scrolls (II)

200 papers

The aim of this paper is to obtain a classification of scrolls of genus 0 and 1, which are defined by a one-dimensional family of lines meeting a certain set of linear spaces in ${\bf P}^n$. These ruled surfaces will be called incidence…

Algebraic Geometry · Mathematics 2007-05-23 Rosa Cid , Manuel Pedreira

The aim of this paper is the computation of the degree and genus of all incidence scrolls in Pn. For this, we fix the dimension of a linear space which have a base space of this fixed dimension. In this way, we can obtain all the incidence…

Algebraic Geometry · Mathematics 2007-05-23 Rosa Cid , Manuel Pedreira

We give a classification and a construction of all smooth $(n-1)$-dimensional varieties of lines in ${\bf P}\sp n$ verifying that all their lines meet a curve. This also gives a complete classification of $(n-1)$-scrolls over a curve…

alg-geom · Mathematics 2008-02-03 Enrique Arrondo , Marina Bertolini , Cristina Turrini

We study families of scrolls containing a given rational curve and families of rational curves contained in a fixed scroll via a stratification in terms of the degree of the induced map onto P^1 and we prove that there is no rational normal…

Algebraic Geometry · Mathematics 2018-11-27 Marco Franciosi

We consider the locus of irreducible nonsingular rational curves of degree d Pn, n>2, meeting a generic collection of linear subspaces. When this locus is 0 (resp 1)- dimensional, we compute (recursively) its degree (resp. geometric genus).…

alg-geom · Mathematics 2007-05-23 Z. Ran

An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or (ii) e = f , or (iii) vw = e or f. An incidence p-colouring…

Discrete Mathematics · Computer Science 2018-07-31 Brahim Benmedjdoub , Isma Bouchemakh , Eric Sopena , Â\' Sopena

We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…

Algebraic Geometry · Mathematics 2015-06-03 Micha Sharir , Noam Solomon

We study and classify linearly normal surfaces in $\mathbf{P}^n$, of degree $d$ and sectional genus $g$, such that $d\geq 2g-1$.

Algebraic Geometry · Mathematics 2025-03-31 Ciro Ciliberto , Thomas Dedieu , Margarida Mendes Lopes

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

In this article we study congruences of lines in $\mathbb{P}^n$, and in particular of order one. After giving general results, we obtain a complete classification in the case of $\mathbb{P}^4$ in which the fundamental surface $F$ is in fact…

Algebraic Geometry · Mathematics 2017-02-03 Pietro De Poi

We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or…

Combinatorics · Mathematics 2007-05-23 Peter Cameron , Thomas Prellberg , Dudley Stark

This study delves into the incidence matrices of hypergraphs, with a focus on two types: the edge-vertex incidence matrix and the vertex-edge incidence matrix. The edge-vertex incidence matrix is a matrix in which the rows represent…

Combinatorics · Mathematics 2025-10-10 Samiron Parui

The genus of a graph is a topological invariant that measures the minimum genus of a surface on which the graph can be embedded without any edges crossing. Graph genus plays a fundamental role in topological graph theory, used to classify…

Combinatorics · Mathematics 2023-01-31 Lucas Blakeslee

The elementary divisors of the incidence matrices of lines in $PG(3,p)$ are computed, where two lines are incident if and only if they are skew.

Combinatorics · Mathematics 2020-01-30 Joshua Ducey , Peter Sin

Taking inspiration from [1, 21, 24], we develop a general framework to deal with the model theory of open incidence structures. In this first paper we focus on the study of systems of points and lines (rank $2$). This has a number of…

Logic · Mathematics 2024-12-03 Gianluca Paolini , Davide Emilio Quadrellaro

We study the generic linearly normal special scroll of genus g in P^N. Moreover, we give a complete classification of the linearly normal scrolls in P^3 of genus 2 and 3.

Algebraic Geometry · Mathematics 2007-12-12 Luis Fuentes Garcia , Manuel Pedreira Perez

Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…

Dynamical Systems · Mathematics 2010-11-10 Nataša Kejžar , Zoran Nikoloski , Vladimir Batagelj

The elementary divisors of the incidence matrix of lines in PG(3,q) are computed, where two lines are incident if and only if they are skew.

Combinatorics · Mathematics 2011-10-07 Andries E. Brouwer , Joshua E. Ducey , Peter Sin

A finite \emph{$k$-net} of order $n$ is an incidence structure consisting of $k\ge 3$ pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with exactly one…

Combinatorics · Mathematics 2016-02-01 G. Korchmáros , G. P. Nagy

In this article we obtain a complete description of the congruences of lines in $\p^4$ of order one provided that the fundamental surface $F$ is non-reduced (and possibly reducible) at one of its generic points, and their classification…

Algebraic Geometry · Mathematics 2007-05-23 Pietro De Poi
‹ Prev 1 2 3 10 Next ›