On the uniqueness of algebraic curves passing through n-independent nodes

From MaRDI portal
Publication:302295

zbMATH Open1342.41004arXiv1510.05211MaRDI QIDQ302295FDOQ302295


Authors: Sofik Toroyan, Hakop Hakopian Edit this on Wikidata


Publication date: 5 July 2016

Published in: The New York Journal of Mathematics (Search for Journal in Brave)

Abstract: 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 in Proceedings of YSU] that the minimal number of n-independent nodes determining uniquely the curve of degree klen equals to mathcalK:=(1/2)(k1)(2n+4k)+2. Or, more precisely, for any n-independent set of cardinality mathcalK there is at most one curve of degree klen passing through its nodes, while there are n-independent node sets of cardinality mathcalK1 through which pass at least two such curves. In this paper we bring a simple characterization of the latter sets. Namely, we prove that if two curves of degree klen pass through the nodes of an n-independent node set mathcalX of cardinality mathcalK1 then all the nodes of mathcalX but one belong to a (maximal) curve of degree k1.


Full work available at URL: https://arxiv.org/abs/1510.05211

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (11)





This page was built for publication: On the uniqueness of algebraic curves passing through \(n\)-independent nodes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q302295)