Forcing linearity numbers for coatomic modules
نویسندگان
چکیده
منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملModules over Monads and Linearity
Inspired by the classical theory of modules over a monoid, we give a first account of the natural notion of module over a monad, which encompasses the notion of algebra. The associated notion of morphism of modules (”linear” natural transformations) captures important formal properties about substitution. In this paper, we present basic constructions of modules and we show examples concerning i...
متن کاملcomplete forcing numbers of polyphenyl systems
the idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as latin squares, block designs and steiner systems in combinatorics (see [1] and the references therein). recently, the forcing on perfect matchings has been attracting more researchers attention. a forcing set of m is a subset of m contained...
متن کاملLinearity Defects of Modules over Commutative Rings
This article concerns linear parts of minimal resolutions of finitely generated modules over commutative local, or graded rings. The focus is on the linearity defect of a module, which marks the point after which the linear part of its minimal resolution is acyclic. The results established track the change in this invariant under some standard operations in commutative algebra. As one of the ap...
متن کاملGraphs with Extremal Connected Forcing Numbers
Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the smallest set of initially colored vertices which forces the entire graph to eventually become colored. Connected forcing is a variant of zero forcing in which t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Advanced Mathematical Sciences
سال: 2018
ISSN: 2651-4001
DOI: 10.33434/cams.446020