Related papers: Divisors on graphs, orientations, syzygies, and sy…
In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial…
We construct a nonminimal graded free resolution of Segre embeddings of $P^1\times P^1$, although we don't compute all maps. We use this to prove an explicit formula for certain nonzero entries in the graded Betti table, at the end of the…
We show that the algebraic rank of divisors on certain graphs is related to the realizability problem of matroids. As a consequence, we produce a series of examples in which the algebraic rank depends on the ground field. We use the theory…
We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…
We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…
Using the concept of $d$-collapsibility from combinatorial topology, we define chordal simplicial complexes and show that their Stanley-Reisner ideals are componentwise linear. Our construction is inspired by and an extension of "chordal…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
We study Stanley-Reisner ideals of broken circuits complexes and characterize those ones admitting a linear resolution or being complete intersections. These results will then be used to characterize arrangements whose Orlik-Terao ideal has…
An explicit construction is given of a minimal free resolution of the ideal generated by all squarefree monomials of a given degree. The construction relies upon and exhibits the natural action of the symmetric group on the syzygy modules.…
Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…
Let $R = \mathbb{K}[x_1, \ldots, x_n]$ and $I \subset R$ be a homogeneous ideal. In this article, we first obtain certain sufficient conditions for the subadditivity of $R/I$. As a consequence, we prove that if $I$ is generated by…
Probabilistic dependency graphs (PDGs) are a flexible class of probabilistic graphical models, subsuming Bayesian Networks and Factor Graphs. They can also capture inconsistent beliefs, and provide a way of measuring the degree of this…
We study the syzygies of secant ideals of Veronese subrings of a fixed commutative graded algebra over a field of characteristic 0. One corollary is that the degrees of the minimal generators of the ith syzygy module of the coordinate ring…
The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…
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…
Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…
We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…
Graph theory has successfully used to solve a wide range of problems encountered in diverse fields such as medical sciences, neural networks, control theory, transportation, clustering analysis, expert systems, image capturing, and network…
Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the…
Belief systems are rarely globally consistent, yet effective reasoning often persists locally. We propose a novel graph-theoretic framework that cleanly separates credibility--external, a priori trust in sources--from confidence--an…