Related papers: Monomial ideals and the Scarf complex for coherent…
Recent decades have seen the discovery of numerous complex materials. At the root of the complexity underlying many of these materials lies a large number of possible contending atomic- and larger-scale configurations and the intricate…
Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…
Usually, methods evaluating system reliability require engineers to quantify the reliability of each of the system components. For series and parallel systems, there are some options to handle the estimation of each component's reliability.…
Motivated by the fact that as the number of generators of an ideal grows so does the complexity of calculating relations among the generators, this paper identifies collections of monomial ideals with a growing number of generators which…
For a commutative ring $A$, we have the category of (bounded-below) chain complexes of $A$-modules $Ch_{+}(A\mymod)$, a closed symmetric monoidal category with a compatible stable Quillen model structure. The associated homotopy category is…
We present the design and implementation of a \texttt{C++} class for reliability analysis of multi-state systems using an algebraic approach based on monomial ideals. The class is implemented within the open-source \verb|CoCoALib| library…
Quorum systems are a common way to formalize failure assumptions in distributed systems. Traditionally, these assumptions are shared by all involved processes. More recently, systems have emerged which allow processes some freedom in…
Coherent sheaves on general complex manifolds do not necessarily have resolutions by finite complexes of vector bundles. However D. Toledo and Y.L.L. Tong showed that one can resolve coherent sheaves by objects analogous to chain complexes…
We introduce monomial divisibility diagrams (MDDs), a data structure for monomial ideals that supports insertion of new generators and fast membership tests. MDDs stem from a canonical tree representation by maximally sharing equal…
In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…
Rigid monoidal 1-categories are ubiquitous throughout quantum algebra and low-dimensional topology. We study a generalization of this notion, namely rigid algebras in an arbitrary monoidal 2-category. Examples of rigid algebras include…
In this paper we review different definitions that multi-state $k$-out-of-$n$ systems have received along the literature and study them in a unified way using the algebra of monomial ideals. We thus obtain formulas and algorithms to compute…
A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…
Tolerance against failures and errors is an important feature of many complex networked systems [1,2]. It has been shown that a class of inhomogeneously wired networks called scale-free[1,3] networks can be surprisingly robust to failures,…
A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief derived from S may be false in the present state of the world.…
Let $k$ be a field, $ \mathcal{L}\subset \mathbb{Z}^n$ be a lattice such that $\L\cap \mathbb{N}^n=\{{\bf 0}\}$, and $I_\L\subset \Bbbk[x_1,..., x_n]$ the corresponding lattice ideal. We present the generalized Scarf complex of $I_\L$ and…
This paper presents a powerfull method to integrate general monomials on the classical groups with respect to their invariant (Haar) measure. The method has first been applied to the orthogonal group in [J. Math. Phys. 43, 3342 (2002)], and…
Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
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…