Every class of $S$-acts having a flatness property is closed under directed colimits
Authors
Abstract:
Let $S$ be a monoid. In this paper, we prove every class of $S$-acts having a flatness property is closed underdirected colimits, it extends some known results. Furthermore thisresult implies that every $S$-act has a flatness cover if and only if it has a flatness precover.
similar resources
every class of $s$-acts having a flatness property is closed under directed colimits
let $s$ be a monoid. in this paper, we prove every class of $s$-acts having a flatness property is closed underdirected colimits, it extends some known results. furthermore thisresult implies that every $s$-act has a flatness cover if and only if it has a flatness precover.
full textEvery Property of Outerplanar Graphs is Testable
A D-disc around a vertex v of a graph G = (V,E) is the subgraph induced by all vertices of distance at most D from v. We show that the structure of an outerplanar graph on n vertices is determined, up to modification (insertion or deletion) of at most n edges, by a set of D-discs around the vertices, for D = D( ) that is independent of the size of the graph. Such a result was already known for ...
full textEvery Property Is Testable on a Natural Class of Scale-Free Multigraphs
In this paper, we introduce a natural class of multigraphs, Hierarchical-Scale-Free (HSF, in short), and consider constant-time testability on the class. We show that a very wide subclass, i.e., the power-low exponent is greater than two, of HSF is hyperfinite. Based on this result, an algorithm of deterministic partitioning oracle can be constructed. And finally we show that every property is ...
full textEvery Abelian Group Is a Class Group
Let T be the set of minimal primes of a Krull domain A. If S is a subset of T9 we form B = n AP for PeS and study the relation of the class group of B to that of A. We find that the class group of B is always a homomorphic image of that of A. We use this type of construction to obtain a Krull domain with specified class group and then alter such a Krull domain to obtain a Dedekind domain with t...
full textEvery Monotone 3-Graph Property is Testable
Let k ≥ 2 be a fixed integer and P be a property of k-uniform hypergraphs. In other words, P is a (typically infinite) family of k-uniform hypergraphs and we say a given hypergraph H satisfies P if H ∈ P . For a given constant η > 0 a k-uniform hypergraph H on n vertices is η-far from P if no hypergraph obtained from H by changing (adding or deleting) at most ηn edges in H satisfies P . More pr...
full textThe Class SNr3CAk is Not Closed Under Completions
We show that for for k≥6, the class SNx3CAk is not closed under completions and is not Sahlqvist axiomatizable. This generalizes results in [3] and [5] for RCAn when n=3.1
full textMy Resources
Journal title
volume 42 issue 2
pages 341- 351
publication date 2016-04-01
By following a journal you will be notified via email when a new issue of this journal is published.
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023