Related papers: Computing Serre's intersection multiplicities
The characteristic numbers of smooth plane quartics are computed using intersection theory on a component of the moduli space of stable maps. This completes the verification of Zeuthen's prediction of characteristic numbers of smooth plane…
We present an efficient method for classifying the morphology of the intersection curve of two quadrics (QSIC) in PR3, 3D real projective space; here, the term morphology is used in a broad sense to mean the shape, topological, and…
The finite difference equation system introduced by Christiane Poupard in the study of tangent trees is reinterpreted in the alternating permutation environment. It makes it possible to make a joint study of both tangent and secant trees…
We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…
We use partitions to provide some formulae for counting s-collisions and other events in various forms of the Birthday Problem.
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
Using an alternate description of support varieties of pairs of modules over a complete intersection, we give several new applications of such varieties, including results for support varieties of intermediate complete intersections.…
We give a complete characterization of mixed unit interval graphs, the intersection graphs of closed, open, and half-open unit intervals of the real line. This is a proper superclass of the well known unit interval graphs. Our result solves…
We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…
This paper deals with the merging problem of segments of a composite B\'ezier curve, with the endpoints continuity constraints. We present a novel method which is based on the idea of using constrained dual Bernstein polynomial basis (P.…
In this paper we describe all possible reduced complete intersection sets of points on Veronese surfaces. We formulate a conjecture for the general case of complete intersection subvarieties of any dimension and we prove it in the case of…
Recently, we have witnessed tremendous applications of algebraic intersection theory to branches of mathematics, that previously seemed very distant. In this article we review some of them. Our aim is to provide a unified approach to the…
We find an algorithm to compute the quadratic Euler characteristic of a smooth projective complete intersection of hypersurfaces of the same degree. As an example, we compute the quadratic Euler characteristic of a smooth projective…
We explain how to compute top-dimensional intersections of psi-classes on moduli spaces of m-stable curves. On the moduli spaces of Deligne-Mumford stable pointed curves of genus one, these intersection numbers are determined by two…
The note derives an expression for the number of interchanges made by selection sort when the sorting elements are iid variates from geometric distribution. Empirical results reveal we can work with a simpler model compared to what is…
The celebrated Erdos, Faber and Lovasz conjecture may be stated as follows: Any linear hypergraph on v points has chromatic index at most v. We will introduce the linear intersection number of a graph, and use this number to give an…
This note provides very simple, efficient algorithms for computing the number of distinct longest common subsequences of two input strings and for computing the number of LCS embeddings.
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…
Expository article on the problem of determining the maximum number of equiangular lines with a fixed angle, and the associated problem of second eigenvalue multiplicity in graphs.