Related papers: Divisors on graphs, orientations, syzygies, and sy…
The criterion commonly used in directed acyclic graphs (dags) for testing graphical independence is the well-known d-separation criterion. It allows us to build graphical representations of dependency models (usually probabilistic…
The independence complex of a chordal graph is known to be shellable due to a result of Van Tuyl and Villarreal. This is equivalent to the fact that cover ideal of a chordal graph has linear quotients. We use this result to obtain recursive…
A recent line of research has concentrated on exploring the links between analytic and combinatorial theories of submodularity, uncovering several key connections between them. In this context, Lov\'asz initiated the study of matroids from…
Let $\mathcal{D}$ be a weighted oriented graph and $I(\mathcal{D})$ be its edge ideal. In this paper, we investigate the Betti numbers of $I(\mathcal{D})$ via upper-Koszul simplicial complexes, Betti splittings and the mapping cone…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids. Here we consider a special case of…
We explore a family of monomial ideals derived as Gr\"obner degenerations of determinantal ideals. These ideals, previously examined as block diagonal matching field ideals within the realm of toric degenerations of Grassmannians, are…
We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set…
This paper studies the algebraic structure of a new class of hyperplane arrangement $A$ obtained by deleting two hyperplanes from a free arrangement. We provide information on the minimal free resolutions of the logarithmic derivation…
Correlation analysis is a fundamental problem in statistics. In this paper, we consider the correlation detection problem between a pair of Erdos-Renyi graphs. Specifically, the problem is formulated as a hypothesis testing problem: under…
The main focus of this thesis is a generalization of covering arrays, covering arrays on graphs. Two vectors v,w in Z_k^n are qualitatively independent if for all ordered pairs (a,b) in Z_k x Z_k there is a position i in the vectors where…
Let $X=(x_{ij})$ and $Y=(y_{ij})$ be generic $n$ by $n$ matrices and $Z=XY-YX$. Let $S=k[x_{11},...,x_{nn},y_{11},...,y_{nn}]$, where $k$ is a field, let $I$ be the ideal generated by the entries of $Z$ and let $R=S/I$. We give a conjecture…
The aim of this thesis is to investigate the Betti diagrams of squarefree monomial ideals in polynomial rings. We use two key tools to help us study these diagrams. The first is the Stanley-Reisner Correspondence, which assigns a unique…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Tropical geometry and its applications indicate a "theory of syzygies" over polytope semirings. Taking cue from this indication, we study a notion of syzygies over the polytope semiring. We begin our exploration with the concept of Newton…
In their paper on multiplicity bounds (1998), Herzog and Srinivasan study the relationship between the graded Betti numbers of a homogeneous ideal I in a polynomial ring R and the degree of I. For certain classes of ideals, they prove a…
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
A recent result of Eisenbud-Schreyer and Boij-S\"oderberg proves that the Betti diagram of any graded module decomposes as a positive rational linear combination of pure diagrams. When does this numerical decomposition correspond to an…
In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks---a generalization of the standard graph-based model…
Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ fail independently with probability $q \in[0,1]$. The \emph{all-terminal reliability} of $G$ is the probability that the resulting subgraph is connected.…