中文
相关论文

相关论文: On plane algebraic curves passing through $n$-inde…

200 篇论文

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…

代数几何 · 数学 2022-09-22 Hakop Hakopian

Let a set of nodes $\mathcal X$ in plain be $n$-independent, i.e., each node has a fundamental polynomial of degree $n.$ Suppose also that $|\mathcal X|= d(n,k-2)+2,$ where $d(n,k-2) = (n+1)+n+\cdots+(n-k+4)$ and $\ k\le n-1.$ In this paper…

代数几何 · 数学 2021-02-02 Hakop Hakopian , Harutyun Kloyan

A set of nodes is called $n$-independent if each its node has a fundamental polynomial of degree $n.$ We proved in a previous paper [H. Hakopian and S. Toroyan, On the minimal number of nodes determining uniquelly algebraic curves, accepted…

数值分析 · 数学 2015-10-20 H. Hakopian , S. Toroyan

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

数值分析 · 数学 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan

An $n$-correct set $\mathcal{X}$ in the plane is a set of nodes admitting unique interpolation with bivariate polynomials of total degree at most $n$. A $k$-node line is a line passing through exactly $k$ nodes of $\mathcal{X}.$ A line can…

数值分析 · 数学 2025-08-20 Hakop Hakopian , Gagik Vardanyan , Navasard Vardanyan

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…

代数几何 · 数学 2007-05-23 Steven Kleiman , Ragni Piene

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

数值分析 · 数学 2015-05-05 Vahagn Vardanyan

We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…

代数几何 · 数学 2007-05-23 S. Kleiman , R. Piene

Let $\mathcal{C}$ be a plane curve defined over the algebraic closure $K$ of a prime finite field $\mathbb{F}_p$ by a separated polynomial, that is $\mathcal{C}: A(y)=B(x)$, where $A(y)$ is an additive polynomial of degree $p^n$ and the…

代数几何 · 数学 2017-08-21 Matteo Bonini , Maria Montanucci , Giovanni Zini

Let $G$ be a subgroup of the three dimensional projective group $\mathrm{PGL}(3,q)$ defined over a finite field $\mathbb{F}_q$ of order $q$, viewed as a subgroup of $\mathrm{PGL}(3,K)$ where $K$ is an algebraic closure of $\mathbb{F}_q$.…

代数几何 · 数学 2022-02-14 H. Borges , G. Korchmáros , P. Speziali

In this paper we compute the number of rational curves with one node passing through a given number of points, lines and tangent to a given number of planes in $\mathbb{P}^3$.

代数几何 · 数学 2015-03-17 Dung Nguyen

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

度量几何 · 数学 2016-07-20 János Pach , Frank de Zeeuw

Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…

数论 · 数学 2017-05-12 Nazar Arakelian

We study the structure of collections of algebraic curves in three dimensions that have many curve-curve incidences. In particular, let $k$ be a field and let $\mathcal{L}$ be a collection of $n$ space curves in $k^3$, with…

代数几何 · 数学 2024-02-27 Larry Guth , Joshua Zahl

We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…

代数几何 · 数学 2023-09-22 Giulio Bresciani

In this paper we obtain an explicit formula for the number of curves in two dimensional complex projective space, of degree d, passing through d(d+3)/2-(k+1) generic points and having one node and one codimension k singularity, where k is…

代数几何 · 数学 2015-12-29 Somnath Basu , Ritwik Mukherjee

It is known for a long time that a nonsingular real algebraic curve of degree 2k in the projective plane cannot have more than 7/2*k^2-9/4*k+3/2$ even ovals. We show here that this upper bound is asymptotically sharp, that is to say we…

代数几何 · 数学 2007-05-23 Erwan brugalle

We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…

几何拓扑 · 数学 2011-12-20 Akio Kawauchi , Ayaka Shimizu

Let N_d be the number of degree d, nodal, rational plane curves through 3d-1 points in the complex projective plane. The number of degree d>=3, nodal, elliptic plane curves with a fixed (general) j-invariant through 3d-1 points is found to…

alg-geom · 数学 2008-02-03 R. Pandharipande

We initiate the study of a class of real plane algebraic curves which we call expressive. These are the curves whose defining polynomial has the smallest number of critical points allowed by the topology of the set of real points of a…

代数几何 · 数学 2023-08-29 Sergey Fomin , Eugenii Shustin
‹ 上一页 1 2 3 10 下一页 ›