相关论文: Classification of Incidence Scrolls(I)
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
We propose a means by which some categorifications can be evaluated at a root of unity. This is implemented using a suitable localization in the context of prior work by the authors on categorification of the Jones-Wenzl projectors. Within…
A collection of simple closed curves in $\rr^3$ is called a negative slice if it is the intersection of a flat-at-infinity planar Lagrangian surface and $\{y_2 = a \}$ for some $a < 0$. Examples and non-examples of negative slices are…
The primary goal of this paper is to abstract notions, results and constructions from the theory of categories to the broader setting of plots. Loosely speaking, a plot can be thought of as a non-associative non-unital category with a…
Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…
We observe that if $R:=(I,\rho, J)$ is an incidence We observe that if $R:=(I,\rho, J)$ is an incidence structure, viewed as a matrix, then the topological closure of the set of columns is the Stone space of the Boolean algebra generated by…
This is the first article in a series aimed at classifying normal del Pezzo surfaces of Picard rank one over algebraically closed fields of arbitrary characteristic up to an isomorphism. Our guiding invariant is the height of a del Pezzo…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
We present an approach over arbitrary fields to bound the degree of intersection of families of varieties in terms of how these concentrate on algebraic sets of smaller codimension. This provides in particular a substantial extension of the…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
Texture classification became one of the problems which has been paid much attention on by image processing scientists since late 80s. Consequently, since now many different methods have been proposed to solve this problem. In most of these…
Given a set of points $P$ and a set of regions $\mathcal{O}$, an incidence is a pair $(p,o ) \in P \times \mathcal{O}$ such that $p \in o$. We obtain a number of new results on a classical question in combinatorial geometry: What is the…
An embedding is a mapping from a set of nodes of a network into a real vector space. Embeddings can have various aims like capturing the underlying graph topology and structure, node-to-node relationship, or other relevant information about…
A \emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line,' a line with slope $-1$. It is an open…
A linear layout of a graph consists of a linear ordering of its vertices and a partition of its edges into pages such that the edges assigned to the same page obey some constraint. The two most prominent and widely studied types of linear…
One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan, and it…
In this paper we introduce congruence spaces, which are topological spaces that are canonically attached to monoid schemes and that reflect closed topological properties. This leads to satisfactory topological characterizations of closed…
Monodromy in analytic families of smooth complex surfaces yields groups of isotopy classes of orientation preserving diffeomorphisms for each family member X. For all deformation classes of minimal elliptic surfaces with p_g>q=0, we…
We show that a rational normal scroll can in general be set-theoretically defined by a proper subset of the 2-minors of the associated two-row matrix. This allows us to find a class of rational normal scrolls that are almost set-theoretic…
The methods of the space syntax have been the subject of extensive discussion, and several techniques to identify the axis lines have been proposed. The space syntax can be represented in terms of line graph, a graphs defined on the edge of…