Related papers: Divisors on graphs, orientations, syzygies, and sy…
In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…
We study Brill-Noether existence on a finite graph using methods from polyhedral geometry and lattices. We start by formulating analogues of the Brill-Noether conjectures (both the existence and non-existence parts) for…
Let $G$ be a finite simple graph on $n$ non-isolated vertices, and let $J_G$ be its binomial edge ideal. We determine almost all pairs $(\text{projdim}(J_G),\text{reg}(J_G))$, where $G$ ranges over all finite simple graphs on $n$…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
We explicitly describe cellular minimal free resolutions of certain classes of edge ideals of weighted complete bipartite graphs based on a construction of Visscher. Specifically, we show that Visscher's construction minimally resolves all…
We introduce to the context of multigraded modules the methods of modules over categories from algebraic topology and homotopy theory. We develop the basic theory quite generally, with a view toward future applications to a wide class of…
Let $I \subset k[x_1, \dotsc, x_n]$ be a squarefree monomial ideal a polynomial ring. In this paper we study multiplications on the minimal free resolution $\mathbb{F}$ of $k[x_1, \dotsc, x_n]/I$. In particular, we characterize the possible…
We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set. We solve this hard combinatorial optimization problem…
We demonstrate that the greedy algorithm for reduction of divisors on metric graphs need not terminate by modeling the Euclidean algorithm in this context. We observe that any infinite reduction has a well defined limit allowing us to treat…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a…
In this paper we study the Betti numbers of Stanley-Reisner ideals generated in degree 2. We show that the first six Betti numbers do not depend on the characteristic of the ground field. We also show that, if the number of variables $n$ is…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
We construct the first linear strand of the minimal free resolutions of edge ideals of $d$-partite $d$-uniform clutters. We show that the first linear strand is supported on a relative simplicial complex. In the case that the edge ideals of…
In this article, I present a conjecture on the number of independent sets on graph covers. I also show that the conjecture implies that the partition function of a binary pairwise attractive model is greater than that of the Bethe…
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…