Related papers: Classification of Incidence Scrolls (II)
In this paper, we introduce a novel non-linear uniform subdivision scheme for the generation of curves in $\mathbb{R}^n$, $n\geq2$. This scheme is distinguished by its capacity to reproduce second-degree polynomial data on non-uniform grids…
Osculating spaces of decomposable scrolls (of any genus and not necessarily normal)are studied and their inflectional loci are related to those of their generating curves by using systematically an idea introduced by Piene and Sacchiero in…
An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…
We study the geometry of varieties parametrizing degree d rational and elliptic curves in P^n intersecting fixed general linear spaces and tangent to a fixed hyperplane H with fixed multiplicities along fixed general linear subspaces of H.…
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices;…
The point-plane incidence theorem states that the number of incidences between $n$ points and $m\geq n$ planes in the projective three-space over a field $F$, is $$O\left(m\sqrt{n}+ m k\right),$$ where $k$ is the maximum number of collinear…
In this work we present the notion of greyscale of a graph as a colouring of its vertices that uses colours from the real interval [0,1]. Any greyscale induces another colouring by assigning to each edge the non-negative difference between…
We study a new kind of proximity graphs called proportional-edge proximity catch digraphs (PCDs)in a randomized setting. PCDs are a special kind of random catch digraphs that have been developed recently and have applications in statistical…
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…
Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…
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…
This article investigates the intersection numbers of the moduli space of p-spin curves with the help of matrix models. The explicit integral representations that are derived for the generating functions of these intersection numbers…
We make a systematic study of the focal surface of a congruence of lines in the projective space. Using differential techniques together with techniques from intersection theory, we reobtain in particular all the invariants of the focal…
We consider $(1,1)$-surfaces, namely, minimal compact complex surfaces $S$ with $p_g (S) =K_S^2=1$: for these the bicanonical map is a covering of degree $4$ of the plane $\mathbb{P}^2$. And we answer a question posed by Meng Chen, whether…
We take the fundamental group of the complement of the branch curve of a generic projection induced from canonical embedding of a surface. This group is stable on connected components of moduli spaces of surfaces. Since for many classes of…
Text classification is a fundamental task in natural language processing (NLP). Several recent studies show the success of deep learning on text processing. Convolutional neural network (CNN), as a popular deep learning model, has shown…
Due to their conceptual and mathematical simplicity, Erd\"os-R\'enyi or classical random graphs remain as a fundamental paradigm to model complex interacting systems in several areas. Although condensation phenomena have been widely…
The ordinary generating function of the number of complete subgraphs (cliques) of $G$, denoted by $C(G,x)$, is called the The clique polynomial of the graph $G$. In this paper, we first introduce some \emph{clique} incidence matrices…
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,…
In this paper, we first define a non-degenerate symmetric bilinear form on Fq^4. Then we get an incidence matrix G of Fq^4 by the bilinear form. By its corresponding quadratic form Q, the lines of Fq^4 are classified as isotropic and…