相关论文: Classification of Incidence Scrolls(I)
Smooth complex polarized varieties $(X,L)$ with a vector subspace $V \subseteq H^0(X,L)$ spanning $L$ are classified under the assumption that the locus ${\Cal D}(X,V)$ of singular elements of $|V|$ has codimension equal to $\dim(X)-i$,…
We study linear systems cut out by cones of fixed degree on a smooth complex curve $C\subset\mathbb{P}^{3}$. We develop a systematic study of the families of such systems, considering their limits, their infinitesimal behaviour and some…
We study families of rational curves on an algebraic variety satisfying incidence conditions. We prove an analogue of bend-and-break: that is, we show that under suitable conditions, such a family must contain reducibles. In the case of…
We study ruled submanifolds of Euclidean space. First, to each (parametrized) ruled submanifold $\sigma$, we associate an integer-valued function, called degree, measuring the extent to which $\sigma$ fails to be cylindrical. In particular,…
The elementary divisors of the incidence matrix of lines in PG(3,q) are computed, where two lines are incident if and only if they are skew.
We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$…
We classify all rotational surfaces in Euclidean space whose principal curvatures $\kappa_1$ and $\kappa_2$ satisfy the linear relation $\kappa_1=a\kappa_2+b$, where $a$ and $b$ are two constants. We give a variational characterization of…
We investigate monodromy groups arising in enumerative geometry, with a particular focus on how these groups are influenced by prescribed symmetries. To study these phenomena effectively, we work in the framework of moduli stacks rather…
In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).
The incidence correspondence in the grassmannian which determines the tautological bundle defines a map between cycle spaces on grassmannians. These cycle spaces decompose canonically into a product of Eilenberg-MacLane spaces. These…
Let $X$ be a codimension two nonsingular subvariety of a nonsingular quadric $\Q{n}$ of dimension $n\geq 5$. We classify such subvarieties when they are scrolls. We also classify them when the degree $d\leq 10$. Both results were known when…
Similarity scores in face recognition represent the proximity between pairs of images as computed by a matching algorithm. Given a large set of images and the proximities between all pairs, a similarity score space is defined. Cluster…
We give an effective iterative characterization of the classes of (smooth, rational) (-1)-curves on the blowup of the projective plane at general points. Such classes are characterized as having self-intersection -1, arithmetic genus 0, and…
Related to the classification of regular foliations in a complex algebraic surface, we address the problem of classifying the complex surfaces which admit a flat pencil of foliations. On this matter, a classification of flat pencils which…
Shape grammars compute over shapes which are defined in the universe $U^*$. Shapes in the universe $U^*$ are analogous to line drawings that can be physically realized in the plane. Any shape is embedded or contained in an arrangement of…
Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank r,…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
Models of complex networks are generally defined as graph stochastic processes in which edges and vertices are added or deleted over time to simulate the evolution of networks. Here, we define a unifying framework - probabilistic inductive…
One-class classifiers offer valuable tools to assess the presence of outliers in data. In this paper, we propose a design methodology for one-class classifiers based on entropic spanning graphs. Our approach takes into account the…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…