Related papers: Linear pencils on graphs and on real curves
We give two examples of plane curve arrangements of pencil type which are very close to line arrangements, though the action of the monodromy operator on the first cohomology group of the Milnor Fiber has eigenvalues of order 5 and 6,…
Green's conjecture is proved for smooth curves C lying on a rational surface S with an anticanonical pencil, under some mild hypotheses on the line bundle L defined by C. Constancy of Clifford dimension, Clifford index and gonality of…
The class of ordinary linear constant coefficient differential equations is naturally embedded into a wider class by associating differential equations to algebraic curves.
The paper studies functions defined on continuous branching lines connected into a system. A notion of spectrum degeneracy for these functions is introduced. This degeneracy is based on the properties of the Fourier transforms for processes…
A real algebraic plane curve $A$ is said to be dividing if its real part $\mathbb{R}A$ disconnects its complex part $\mathbb{C}A$. A pencil of curves is totally real with respect to $A$ if it has only real intersections with $\mathbb{C}A$.…
We show that limit linear series spaces for chains of curves are reduced. Using new advances in the foundations of limit linear series, we then use degenerations to study the question of connectedness for spaces of linear series with…
Spine spaces can be considered as fragments of a projective Grassmann space. We prove that the structure of lines together with binary coplanarity relation, as well as with binary relation of being in one pencil of lines, is a sufficient…
Deep learning has been shown to be successful in a number of domains, ranging from acoustics, images, to natural language processing. However, applying deep learning to the ubiquitous graph data is non-trivial because of the unique…
The edge-degeneracy model is an exponential random graph model that uses the graph degeneracy, a measure of the graph's connection density, and number of edges in a graph as its sufficient statistics. We show this model is relatively…
We consider variational problems that model the bending behavior of curves that are constrained to belong to given hypersurfaces. Finite element discretizations of corresponding functionals are justified rigorously via Gamma-convergence.…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
We prove a number of basic vanishing results for modified diagonal classes. We also obtain some sharp results for modified diagonals of curves and abelian varieties, and we prove a conjecture of O'Grady about modified diagonals on double…
Via multilinear algebra, we formulate a criterion for connectedness in the parametric geometry of numbers in terms of pencils, which are certain algebraic varieties in the space of matrices. As a consequence, we obtain a connectedness…
We use slicing by nongeneric pencils of hypersurfaces and prove a new theorem of Lefschetz type for singular non compact spaces, at the homotopy level. As applications, we derive results on the topology of the fibres of polynomial functions…
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and in which each edge $(u,v)$ is represented…
In this paper we study the degeneration of convex real projective structures on bordered surfaces.
We examine logarithmic connections with vanishing p-curvature on smooth curves by studying their kernels, describing them in terms of formal local decomposition. We then apply our results in the case of connections of rank 2 on P^1,…
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and practical constraints associated with point clouds in computer…
Model repair is an essential topic in model-driven engineering. Since models are suitably formalized as graph-like structures, we consider the problem of rule-based graph repair: Given a rule set and a graph constraint, try to construct a…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…