中文
相关论文

相关论文: Classification of Incidence Scrolls (II)

200 篇论文

R. Rim\'anyi defined the incidence class of two singularities X and Y as $[X]|_Y$, the restriction of the Thom polynomial of X to Y. He conjectured that (under mild conditions) the incidence is not zero if and only if Y is in the closure of…

代数几何 · 数学 2013-06-25 László M. Fehér , Zsolt Patakfalvi

We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…

组合数学 · 数学 2015-03-31 Hong Wang , Ben Yang , Ruixiang Zhang

Let $X\subset \mathbb P^N$ be a scroll over a $m$-dimensional variety $Y$. We find the locally free sheaves on $X$ governing the osculating behavior of $X$, and, under certain dimension assumptions, we compute the cohomology class and the…

代数几何 · 数学 2010-12-23 Antonio Lanteri , Raquel Mallavibarrena , Ragni Piene

A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line,' a line with slope $-1$. It is an open…

计算几何 · 计算机科学 2018-08-31 Felice De Luca , Md Iqbal Hossain , Stephen Kobourov , Anna Lubiw , Debajyoti Mondal

We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…

概率论 · 数学 2007-05-23 Rainer Siegmund-Schultze , Heinrich von Weizsaecker

The families EPT (resp. EPG) Edge Intersection Graphs of Paths in a tree (resp. in a grid) are well studied graph classes. Recently we introduced the graph classes Edge-Intersecting and Non-Splitting Paths in a Tree ENPT, and in a Grid…

离散数学 · 计算机科学 2023-06-22 Arman Boyacı , Tınaz Ekim , Mordechai Shalom , Shmuel Zaks

Consider a rooted binary tree with n nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa i the abscissa i-1 (resp. i+1). We prove that the number of binary trees of size n having exactly…

组合数学 · 数学 2025-04-11 Mireille Bousquet-Mélou , Guillaume Chapuy

A very interesting problem in the classical theory of minimal surfaces consists of the classification of such surfaces under some geometrical and topological constraints. In this short paper, we give a brief summary of the known…

微分几何 · 数学 2007-05-23 M. Magdalena Rodriguez

Let $P = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p$, $p$ a prime. Assume that $P= A\times A$ has $n$ elements, $n<p$. See $P$ as a set of points in the plane over $\mathbb{F}_p$. We show that the pairs of points in $P$ determine…

组合数学 · 数学 2014-01-14 Harald Andres Helfgott , Misha Rudnev

The training of deep neural network classifiers results in decision boundaries which geometry is still not well understood. This is in direct relation with classification problems such as so called adversarial examples. We introduce…

机器学习 · 计算机科学 2021-01-20 Adel Jaouen , Erwan Le Merrer

We study linear systems cut out by cones of fixed degree on a smooth complex curve $C\subset\mathbb{P}^{3}$. We develop a systematic study of the families of such systems, considering their limits, their infinitesimal behaviour and some…

代数几何 · 数学 2025-11-14 Riccardo Moschetti , Gian Pietro Pirola , Lidia Stoppino

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

组合数学 · 数学 2015-12-07 Misha Rudnev

An $(n_3)$ configuration is an incidence structure equivalent to a linear hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly…

组合数学 · 数学 2018-04-26 Peter Dukes , Kaoruko Iwasaki

We explore what could make recognition of particular intersection-defined classes hard. We focus mainly on unit grid intersection graphs (UGIGs), i.e., intersection graphs of unit-length axis-aligned segments and grid intersection graphs…

计算几何 · 计算机科学 2022-01-24 Irina Mustata , Martin Pergel

The goal of this paper is to explore the genus and degree of the Fano scheme of linear subspaces on a complete intersection in a complex projective space. Firstly, suppose that the expected dimension of the Fano scheme is one, we prove a…

代数几何 · 数学 2017-01-03 Dang Tuan Hiep

A product-quotient surface is the minimal resolution of the singularities of the quotient of a product of two curves by the action of a finite group acting separately on the two factors. We classify all minimal product-quotient surfaces of…

代数几何 · 数学 2011-04-06 Ingrid Bauer , Roberto Pignatelli

We show that the morphisms from the braid group with n strands in the mapping class group of a surface with a possible non empty boundary, assuming that its genus is smaller or equal to n/2 are either cyclic morphisms (their images are…

群论 · 数学 2011-04-20 Fabrice Castel

Let $X\subset \mathbb P^N$ be a scroll over a smooth curve $C$ and let $\L=\mathcal O_{\mathbb P^N}(1)|_X$ denote the hyperplane bundle. The special geometry of $X$ implies that some sheaves related to the principal part bundles of $\L$ are…

代数几何 · 数学 2007-05-23 Antonio Lanteri , Raquel Mallavibarrena , Ragni Piene

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…

To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an…

几何拓扑 · 数学 2009-04-29 Nathan Linial , Tahl Nowik