Related papers: Classification of Incidence Scrolls (II)
We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$. The dynamics of this…
Let $G$ be a finite, simple, and undirected graph of order $n$ and average degree $d$. Up to terms of smaller order, we characterize the minimal intervals $I$ containing $d$ that are guaranteed to contain some vertex degree. In particular,…
A sequence $\sigma$ of $p$ non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a $3$-connected, planar graph. We investigate which sequences are unigraphic with…
The main goal of this article is to expand the theory of invariants of Artin-Schreier curves by giving a complete classification in genus 3 and 4. To achieve this goal, we first establish standard forms of Artin-Schreier curves and…
We define a class a metric spaces we call Brownian surfaces, arising as the scaling limits of random maps on general orientable surfaces with a boundary and we study the geodesics from a uniformly chosen random point. These metric spaces…
We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…
In this article we introduce and study the intersection graph of graded ideals of graded rings. The intersection graph of $G-$graded ideals of a graded ring $(R,G)$ is a simple graph, denoted by $Gr_G(R)$, whose vertices are the nontrivial…
A rational normal scroll structure on an $(n+1)$-dimensional manifold $M$ is defined as a field of rational normal scrolls of degree $n-1$ in the projectivised cotangent bundle $\mathbb{P}T^*M$. We show that geometry of this kind naturally…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
We define a group stucture on the primitive integer points (A,B,C) of the algebraic variety Q_0(B,C)=A^n, where Q_0 is the principal binary quadratic form of fundamental discriminant \Delta and n is a fixed integer greater than 1. A…
In this paper, we first prove the 2-rank of full incidence matrix of PG(n,q) with $q$ an odd prime power. Then by the quadratic form defined on PG(n,q), the points of it are classified as isotropic and anisotropic points. We divide the full…
The families of smooth rational surfaces in $\PP^4$ have been classified in degree $\le 10$. All known rational surfaces in $\PP^4$ can be represented as blow-ups of the plane $\PP^2$. The fine classification of these surfaces consists of…
We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…
A configuration of the triple $(\mathcal{P}, \mathcal{L}, \mathcal{I})$ on the incidence relation which holds the properties of "Any two points are incident with at most one line" and "Any two lines are incident with at most one point". In…
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).
A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…
In a quest to thoroughly understand the first-order transduction hierarchy of hereditary graph classes, some questions in particular stand out; such as, what properties hold for graph classes that are first-order transductions of planar…
We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…
Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…
We consider congruences of straight lines in a plane with the combinatorics of the square grid, with all elementary quadrilaterals possessing an incircle. It is shown that all the vertices of such nets (we call them incircular or IC-nets)…