Related papers: The slopes determined by n points in the plane
We give an explicit presentation for each lower bound cluster algebra. Using this presentation, we show that each lower bound algebra Grobner degenerates to the Stanley-Reisner scheme of a vertex-decomposable ball or sphere, and is thus…
A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…
The Hilbert scheme of points $\mathrm{Hilb}^n(S)$ of a smooth surface $S$ is a well-studied parameter space, lying at the interface of algebraic geometry, commutative algebra, representation theory, combinatorics, and mathematical physics.…
A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of $G$ are represented by distinct points in the plane and every edge is represented by a straight-line segment connecting the corresponding pair of vertices…
The Hilbert scheme of n points in the projective plane parameterizes degree n zero-dimensional subschemes of the projective plane. We examine the dual cones of effective divisors and moving curves on the Hilbert scheme. By studying…
The purpose of this note is to study the Maulik-Okounkov $K-$theoretic stable basis for the Hilbert scheme of points on the plane, which depends on a "slope" $m \in \mathbb{R}$. When $m = \frac ab$ is rational, we study the change of stable…
The Hilbert scheme of $n$ points in the affine plane contains the open subscheme parametrizing $n$ distinct points in the affine plane, and the closed subscheme parametrizing ideals of codimension $n$ supported at the origin of the affine…
We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
The "slope-number" of a graph $G$ is the minimum number of distinct edge slopes in a straight-line drawing of $G$ in the plane. We prove that for $\Delta\geq5$ and all large $n$, there is a $\Delta$-regular $n$-vertex graph with…
Motivated by using combinatorics to study jets of monomial ideals, we extend a definition of jets from graphs to clutters. We offer some structural results on their vertex covers, and show an interesting connection between the cover ideal…
We study the Hilbert series of a family of ideals J_\phi generated by powers of linear forms in k[x_1,...,x_n]. Using the results of Emsalem-Iarrobino, we formulate this as a question about fatpoints in P^{n-1}. In the three variable case…
The integral variation map and algebraic monodromy of isolated plane curve singularities are important homological invariants of the singularity which are still far from being completely understood. This work provides effective ways of…
To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…
We are discussing certain combinatorial and counting problems related to quadratic algebras. First we give examples which confirm the Anick conjecture on the minimal Hilbert series for algebras given by n generators and n(n-1)/2 relations…
Cohen Macaulay property of fiber cones of ideals is characterized in terms of its Hilbert series. Hilbert series of fiber cones of ideals with minimal mixed multiplicity is calculated. It is proved that the fiber cone of an m-primary ideal…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
A well-known combinatorial theorem says that a set of n non-collinear points in the plane determines at least n distinct lines. Chen and Chv\'atal conjectured that this theorem extends to metric spaces, with an appropriated definition of…
A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…
In this article, we study algebraic properties of binomial edge ideals of Levi graphs associated with certain plane curve arrangements. Using combinatorial properties of Levi graphs, we discuss the Cohen-Macaulayness of binomial edge ideals…