中文
相关论文

相关论文: On the connectivity of some complete intersections

200 篇论文

The analysis of the dynamics on complex networks is closely connected to structural features of the networks. Features like, for instance, graph-cores and node degrees have been studied ubiquitously. Here we introduce the D-spectrum of a…

组合数学 · 数学 2019-12-17 Ricky X. F. Chen , Christian M. Reidys , Andrei C. Bura

We prove that the space of smooth rational curves of degree $e$ in a general complete intersection of multidegree $(d_1, ..., d_m)$ in $\PP^n$ is irreducible of the expected dimension if $\sum_{i=1}^m d_i <\frac{2n}{3}$ and $n$ is large…

代数几何 · 数学 2019-02-20 Roya Beheshti , N. Mohan Kumar

We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…

几何拓扑 · 数学 2017-09-12 Yohsuke Watanabe

Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…

alg-geom · 数学 2008-02-03 David B. Jaffe

Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…

组合数学 · 数学 2025-05-28 Pu Gao , Yuval Ohapkin

A hypergraph is a generalization of a graph, in which a hyperedge can connect multiple vertices, modeling complex relationships involving multiple vertices simultaneously. Hypergraph pattern matching, which is to find all isomorphic…

数据库 · 计算机科学 2025-12-23 Siwoo Song , Wonseok Shin , Kunsoo Park , Giuseppe F. Italiano , Zhengyi Yang , Wenjie Zhang

We give upper bounds for the dimension of the set of hypersurfaces of $\mathbb{P}^N$ whose intersection with a fixed integral projective variety is not integral. Our upper bounds are optimal. As an application, we construct, when possible,…

代数几何 · 数学 2019-11-11 Olivier Benoist

We analyse an extremal question on the degrees of the link graphs of a finite regular graph, that is, the subgraphs induced by non-trivial spheres. We show that if $G$ is $d$-regular and connected but not complete then some link graph of…

组合数学 · 数学 2022-06-13 Itai Benjamini , John Haslegrave

We prove that any smooth rational projective surface over the field of complex numbers has an open covering consisting of 3 subsets isomorphic to affine planes.

代数几何 · 数学 2022-03-23 Jorge Caravantes , J. Rafael Sendra , David Sevilla , Carlos Villarino

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

一般拓扑 · 数学 2023-03-07 Karim Chaira , Oleksiy Dovgoshey

We classify linearly normal surfaces $S \subset \mathbf{P}^{r+1}$ of degree $d$ such that $4g-4 \leq d \leq 4g+4$, where $g>1$ is the sectional genus (it is a classical result that for larger $d$ there are only cones). We apply this to the…

代数几何 · 数学 2026-05-27 Ciro Ciliberto , Thomas Dedieu

We prove that a smooth projective surface of degree $d$ in $\mathbb P^3$ contains at most $d^2(d^2-3d+3)$ lines. We characterize the surfaces containing exactly $d^2(d^2-3d+3)$ lines: these occur only in prime characterize $p$ and, up to…

代数几何 · 数学 2024-06-26 Janet Page , Tim Ryan , Karen E. Smith

We generalize a theorem of Finkelstein and Moriah and show that if a link $L$ has a $2n$-plat projection satisfying certain conditions, then its complement contains some closed essential surfaces. In most cases these surfaces remain…

几何拓扑 · 数学 2007-05-23 Ying-Qing Wu

Let $\mathcal{A}$ be a mathematical structure with an additional relation $R$. We are interested in the degree spectrum of $R$, either among computable copies of $\mathcal{A}$ when $(\mathcal{A},R)$ is a "natural" structure, or (to make…

逻辑 · 数学 2014-12-15 Matthew Harrison-Trainor

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

组合数学 · 数学 2017-11-06 Basudeb Datta , Subhojoy Gupta

We show that measures of irrationality on very general codimension two complete intersections and very general complete intersection surfaces are multiplicative in the degrees of the defining equations. This confirms some cases of a…

代数几何 · 数学 2021-11-11 Nathan Chen

We formulate and analyze a heterogeneous random hypergraph model, and we provide an achieveability result for recovery of hyperedges from the observed projected graph. We observe a projected graph which combines random hyperedges across all…

数据结构与算法 · 计算机科学 2026-03-03 Alexander Morgan , Chenghao Guo

We prove the existence of non-trivial phase transitions for the intersection of two independent random interlacements and the complement of the intersection. Some asymptotic results about the phase curves are also obtained. Moreover, we…

概率论 · 数学 2020-10-27 Zijie Zhuang

We extend the notions of complete intersection dimension and lower complete intersection dimension to the category of complexes with finite homology and verify basic properties analogous to those holding for modules. We also discuss the…

交换代数 · 数学 2007-05-23 Sean Sather-Wagstaff

In this short note we study foliations with rationally connected leaves on surfaces. Our main result is that on surfaces there exists a polarisation such that the Harder-Narasimhan filtration of the tangent bundle with respect to this…

代数几何 · 数学 2008-11-21 Sebastian Neumann