Related papers: Another classification of Incidence Scrolls
We consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
The main motivation of this work was practical, to offer computationally and theoretical scalable ways to structuring large classes of computation. It started from attempts to optimize R code for machine learning/artificial intelligence…
Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also…
We describe an algorithm for computing certain characteristic numbers of surface scrolls using degenerations. As a corollary we obtain a method for computing the corresponding Gromov-Witten invariants of Grassmannians.
In this paper the author provides a generalization of classical linkage, i.e. linkage by a complete intersection, in a different context. Namely she looks at residuals in the scheme theoretic intersection of a rational normal surface or…
We study curves consisting of unions of projective lines whose intersections are given by graphs. Under suitable hypotheses on the graph, these so-called \emph{graph curves} can be embedded in projective space as line arrangements. We…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
In multiplex networks, cycles cannot be characterized only by their length, as edges may occur in different layers in different combinations. We define a classification of cycles by the number of edges in each layer and the number of…
A descent of a labeled acyclic digraph is a directed edge $x\to y$ with $x>y$. In this paper, we find a recurrence for the number of labeled acyclic digraphs with a given number of descents.
We consider an incidence problem in $\mathbb{R}^4$ which asks, for a set of $L$ lines and a set of $S$ planes in general position, what the maximum number of line-plane incidences is. A line-plane incidence is defined as a point where a…
The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…
We obtain a formula for the number of genus one curves with a fixed complex structure of a given degree on a del-Pezzo surface that pass through an appropriate number of generic points of the surface. This enumerative problem is expressed…
The paper is devoted to a categorical study of the category of probabilistic metric spaces. The study is based on an isomorphic description of the category of probabilistic metric spaces. The isomorphic description was obtained in [3] and…
An operation on species corresponding to the inner plethysm of their associated cycle index series is constructed. This operation, the inner plethysm of species, is generalized to n-sorted species. Polynomial maps on species are studied and…
In this paper, we present a solution to the problem of the analytic classification of germs of plane curves with several irreducible components. Our algebraic approach follows precursive ideas of Oscar Zariski and as a subproduct allow us…
We consider quadric surface fibrations over curves, defined over algebraically closed and finite fields. Our goal is to understand, in geometric terms, spaces of sections for such fibrations. We analyze varieties of maximal isotropic…
In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to…