pinecone/core-2020-05-10-deduplication huggingface dataset:
Annexin A1 protein attenuates cyclosporine-induced renal hemodynamics changes and macrophage infiltration in rats

Cyclosporine (CsA) remains an important immunosuppressant for transplantation and for treatment of autoimmune diseases. The most troublesome side effect of CsA is renal injury. Acute CsA-induced nephrotoxicity is characterized by reduced renal blood flow (RBF) and glomerular filtration rate (GFR) due to afferent arteriole vasoconstriction. Annexin A1 (ANXA1) is a potent anti-inflammatory protein with protective effect in renal ischemia/reperfusion injury. Here we study the effects of ANXA1 treatment in an experimental model of acute CsA nephrotoxicity. Salt-depleted rats were randomized to treatment with VH (vehicles 1 mL/kg body weight/day), ANXA1 (Ac2-26 peptide 1 mg/kg body weight/day intraperitoneally), CsA (20 mg/kg body weight/day subcutaneously) and CsA + ANXA1 (combination) for seven days. We compared renal function and hemodynamics, renal histopathology, renal tissue macrophage infiltration and renal ANXA1 expression between the four groups. CsA significantly impaired GFR and RBF, caused tubular dilation and macrophage infiltration and increased ANXA1 renal tissue expression. Treatment with ANXA1 attenuated CSA-induced hemodynamic changes, tubular injury and macrophage infiltration. ANXA1 treatment attenuated renal hemodynamic injury and inflammation in an acute CsA nephrotoxicity model.Fundacao de Amparo a Pesquisa do Estado de Sao Paulo - FAPESP [2008/01,048-9]Conselho Nacional de Desenvolvimento Cientifico e Tecnologico-CNPq [306,074/2007-9, 307,371/2006-9
Bosentan, an endothelin receptor antagonist, ameliorates collagen-induced arthritis: the role of TNF-alpha in the induction of endothelin system genes

Endothelins (ETs) are involved in several inflammatory events. The present study investigated the efficacy of bosentan, a dual ETA/ETB receptor antagonist, in collagen-induced arthritis (CIA) in mice. CIA was induced in DBA/1J mice. Arthritic mice were treated with bosentan (100 mg/kg) once a day, starting from the day when arthritis was clinically detectable. CIA progression was assessed by measurements of visual clinical score, paw swelling and hypernociception. Histological changes, neutrophil infiltration and pro-inflammatory cytokines were evaluated in the joints. Gene expression in the lymph nodes of arthritic mice was evaluated by microarray technology. PreproET-1 mRNA expression in the lymph nodes of mice and in peripheral blood mononuclear cells (PBMCs) was evaluated by real-time PCR. The differences were evaluated by one-way ANOVA or Student's t test. Oral treatment with bosentan markedly ameliorated the clinical aspects of CIA (visual clinical score, paw swelling and hyperalgesia). Bosentan treatment also reduced joint damage, leukocyte infiltration and pro-inflammatory cytokine levels (IL-1 beta, TNF alpha and IL-17) in the joint tissues. Changes in gene expression in the lymph nodes of arthritic mice returned to the levels of the control mice after bosentan treatment. PreproET mRNA expression increased in PBMCs from rheumatoid arthritis (RA) patients but returned to basal level in PBMCs from patients under anti-TNF therapy. In-vitro treatment of PBMCs with TNF alpha upregulated ET system genes. These findings indicate that ET receptor antagonists, such as bosentan, might be useful in controlling RA. Moreover, it seems that ET mediation of arthritis is triggered by TNF alpha.Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP)Fundacao de Amparo a Pesquisa do Estado de Sao Paulo (FAPESP)Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq) (Sao Paulo, Brazil)Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq) (Sao Paulo, Brazil
N-methyl pyrrolidone (NMP) inhibits lipopolysaccharide-induced inflammation by suppressing NF-κB signaling

OBJECTIVE: N-methyl pyrrolidone (NMP), a small bioactive molecule, stimulates bone formation and inhibits osteoclast differentiation and bone resorption. The present study was aimed to evaluate the anti-inflammatory potentials of NMP on the inflammatory process and the underlying molecular mechanisms in RAW264.7 macrophages.\ud
MATERIALS AND METHODS: RAW264.7 macrophages and mouse primary bone marrow macrophages (mBMMs) were used as an in vitro model to investigate inflammatory processes. Cells were pre-treated with or without NMP and then stimulated with lipopolysaccharides (LPS). The productions of cytokines and NO were determined by proteome profiler method and nitrite analysis, respectively. The expressions of nitric oxide synthase (iNOS) and cyclooxygenase-2 (COX-2) were measured by Western blotting and/or qPCR. Western blot, ELISA-base reporter assay, and immunofluorescence were used to evaluate the activation of MAP kinases and NF-κB.\ud
RESULTS: LPS-induced mRNA expressions of TNF-α, IL-1β, IL-6, iNOS, and COX-2 were inhibited by NMP in a dose-dependent manner. NMP also suppressed the LPS-increased productions of iNOS and NO. The proteome profiler array showed that several cytokines and chemokines involved in inflammation and up-regulated by LPS stimulation were significantly down-regulated by NMP. Additionally, this study shows that the effect of NMP is mediated through down-regulation of NFκB pathway.\ud
CONCLUSIONS: Our results show that NMP inhibits the inflammatory mediators in macrophages by an NFκB-dependent mechanism, based on the epigenetical activity of NMP as bromodomain inhibitor. In the light of its action on osteoblast and osteoclast differentiation process and its anti-inflammatory potential, NMP might be used in inflammation-related bone loss
Tissue factor levels in type 2 diabetes mellitus

INTRODUCTION : Type 2 diabetes mellitus is a pandemic associated with disturbance inhaemostasis that could contribute to the development of diabetic vascular disease and accelerated atherosclerosis. In this population, hypercoagulation is prevalent, as well as pathological changes to erythrocytes. This is mainly due to upregulated circulating inflammatory markers.
MATERIALS  AND METHODS : Here we looked at tissue factor (TF) levels using ELISA, in a sample of diabetics, with and without cardiovascular complications. Diabetic subjects were recruited from the diabetic clinic at Steve Biko Academic Hospital, Pretoria, South Africa. 20 diabetics with cardiovascular disease and 22 without were enrolled to participate. RESULTS AND CONCLUSION :  TF levels were significantly elevated in both diabetic groups when compared to the controls. We suggest that pathologic plasma TF activity, as marker of increased propensity of clot pathology, should be investigated. Agents that might lower TF levels might also possibly lower thrombotic complications.This work is based on the research supported in part by the National Research
 Foundation of South Africa (UNIQUE GRANT NO: 92709) and the MRC : E Pretorius
 (fund number A0X331).http://link.springer.com/journal/112018-02-28hb2017Physiolog
On lattices of convex sets in R^n

Properties of several sorts of lattices of convex subsets of R^n are
examined. The lattice of convex sets containing the origin turns out, for n>1,
to satisfy a set of identities strictly between those of the lattice of all
convex subsets of R^n and the lattice of all convex subsets of R^{n-1}. The
lattices of arbitrary, of open bounded, and of compact convex sets in R^n all
satisfy the same identities, but the last of these is join-semidistributive,
while for n>1 the first two are not. The lattice of relatively convex subsets
of a fixed set S \subseteq R^n satisfies some, but in general not all of the
identities of the lattice of ``genuine'' convex subsets of R^n.Comment: 35 pages, to appear in Algebra Universalis, Ivan Rival memorial
  issue. See also http://math.berkeley.edu/~gbergman/paper
Closed subgroups of the infinite symmetric group

Let S=Sym(\Omega) be the group of all permutations of a countably infinite
set \Omega, and for subgroups G_1, G_2\leq S let us write G_1\approx G_2 if
there exists a finite set U\subseteq S such that < G_1\cup U > = < G_2\cup U >.
It is shown that the subgroups closed in the function topology on S lie in
precisely four equivalence classes under this relation. Which of these classes
a closed subgroup G belongs to depends on which of the following statements
about pointwise stabilizer subgroups G_{(\Gamma)} of finite subsets
\Gamma\subseteq\Omega holds:
  (i) For every finite set \Gamma, the subgroup G_{(\Gamma)} has at least one
infinite orbit in \Omega.
  (ii) There exist finite sets \Gamma such that all orbits of G_{(\Gamma)} are
finite, but none such that the cardinalities of these orbits have a common
finite bound.
  (iii) There exist finite sets \Gamma such that the cardinalities of the
orbits of G_{(\Gamma)} have a common finite bound, but none such that
G_{(\Gamma)}=\{1\}.
  (iv) There exist finite sets \Gamma such that G_{(\Gamma)}=\{1\}.
  Some questions for further investigation are discussed.Comment: 33 pages. See also http://math.berkeley.edu/~gbergman/papers and
  http://shelah.logic.at (pub. 823). To appear, Alg.Univ., issue honoring
  W.Taylor. Main results as before (greater length due to AU formatting), but
  some new results in \S\S11-12. Errors in subscripts between displays (12) and
  (13) fixed. Error in title of orig. posting fixed. 1 ref. adde
Complemented congruences on double Ockham algebras

For $n ∈ \mathbb{N}$ and $m ∈ \mathbb{N}_0$, an algebra $L = (L, ∧, ∨, f, g, 0, 1)$ of type $(2, 2, 1, 1, 0, 0)$
is said to be a double $K_{n,m}$-algebra, if L is a double Ockham algebra that satisfies the
identities $f^{2n+m} = f^m, g^{2n+m} = g^m, fg = g^{2zn} and gf = f^{2zn}, where z is the smallest
natural number greater than or equal to m/2n. In this papaer we describe the complement (when it
exists) of a principal congruence and, using this description, we also determine when the
complement exists.Fundação para a Ciência e a Tecnologia (FCT) - programa POCT
Poset algebras over well quasi-ordered posets

A new class of partial order-types, class $\gbqo^+$ is defined and
investigated here. A poset $P$ is in the class $W^+ $ iff the free poset
algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the
free lattice $L(P)$.
  We prove that if $P$ is any well quasi-ordering, then $L(P)$ is well founded,
and is a countable union of well quasi-orderings. We prove that the class $W^+$
is contained in the class of well quasi-ordered sets. We prove that $W^+$ is
preserved under homomorphic image, finite products, and lexicographic sum over
better quasi-ordered index sets. We prove also that every countable well
quasi-ordered set is in $W^+$. We do not know, however if the class of well
quasi-ordered sets is contained in $W^+$. Additional results concern
homomorphic images of posets algebras.Comment: 28 page
Effect algebras with the maximality property

The maximality property was introduced in [9] in orthomodular posets as
a common generalization of orthomodular lattices and orthocomplete orthomodular
posets. We show that various conditions used in the theory of e ect
algebras are stronger than the maximality property, clear up the connections
between them and show some consequences of these conditions. In particular,
we prove that a Jauch{Piron e ect algebra with a countable unital set of states
is an orthomodular lattice and that a unital set of Jauch{Piron states on an
e ect algebra with the maximality property is strongly order determining
MacNeille completion and profinite completion can coincide on finitely
  generated modal algebras

Following Bezhanishvili & Vosmaer, we confirm a conjecture of Yde Venema by
piecing together results from various authors. Specifically, we show that if
$\mathbb{A}$ is a residually finite, finitely generated modal algebra such that
$\operatorname{HSP}(\mathbb{A})$ has equationally definable principal
congruences, then the profinite completion of $\mathbb{A}$ is isomorphic to its
MacNeille completion, and $\Diamond$ is smooth. Specific examples of such modal
algebras are the free $\mathbf{K4}$-algebra and the free
$\mathbf{PDL}$-algebra.Comment: 5 page
Derived Semidistributive Lattices

To appear in the journal Algebra UniversalisInternational audienceFor L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in this poset. Our main result states that C(L,g) is a semidistributive lattice if L is semidistributive, and that C(L,g) is a bounded lattice if L is bounded. Let S_n be the permutohedron on n letters and T_n be the associahedron on n+1 letters. Explicit computations show that C(S_n,a) = S_{n-1} and C(T_n,a) = T_{n-1}, up to isomorphism, whenever a is an atom. These results are consequences of new characterizations of finite join semidistributive and finite lower bounded lattices: (i) a finite lattice is join semidistributive if and only if the projection sending g in C(L) to g_0 in L creates pullbacks, (ii) a finite join semidistributive lattice is lower bounded if and only if it has a strict facet labelling. Strict facet labellings, as defined here, are generalization of the tools used by Barbut et al. to prove that lattices of Coxeter groups are bounded
Galois theory and commutators

We prove that the relative commutator with respect to a subvariety of a
variety of Omega-groups introduced by the first author can be described in
terms of categorical Galois theory. This extends the known correspondence
between the Froehlich-Lue and the Janelidze-Kelly notions of central extension.
As an example outside the context of Omega-groups we study the reflection of
the category of loops to the category of groups where we obtain an
interpretation of the associator as a relative commutator.Comment: 14 page
Galois connection for sets of operations closed under permutation,
  cylindrification and composition

We consider sets of operations on a set A that are closed under permutation
of variables, addition of dummy variables and composition. We describe these
closed sets in terms of a Galois connection between operations and systems of
pointed multisets, and we also describe the closed sets of the dual objects by
means of necessary and sufficient closure conditions. Moreover, we show that
the corresponding closure systems are uncountable for every A with at least two
elements.Comment: 22 pages; Section 4 adde
MV-algebras freely generated by finite Kleene algebras

If V and W are varieties of algebras such that any V-algebra A has a reduct
U(A) in W, there is a forgetful functor U: V->W that acts by A |-> U(A) on
objects, and identically on homomorphisms. This functor U always has a left
adjoint F: W->V by general considerations. One calls F(B) the V-algebra freely
generated by the W-algebra B. Two problems arise naturally in this broad
setting. The description problem is to describe the structure of the V-algebra
F(B) as explicitly as possible in terms of the structure of the W-algebra B.
The recognition problem is to find conditions on the structure of a given
V-algebra A that are necessary and sufficient for the existence of a W-algebra
B such that F(B) is isomorphic to A. Building on and extending previous work on
MV-algebras freely generated by finite distributive lattices, in this paper we
provide solutions to the description and recognition problems in case V is the
variety of MV-algebras, W is the variety of Kleene algebras, and B is finitely
generated--equivalently, finite. The proofs rely heavily on the Davey-Werner
natural duality for Kleene algebras, on the representation of finitely
presented MV-algebras by compact rational polyhedra, and on the theory of bases
of MV-algebras.Comment: 27 pages, 8 figures. Submitted to Algebra Universali
Large free sets in universal algebras

We prove that for each universal algebra $(A,\mathcal A)$ of cardinality
$|A|\ge 2$ and an infinite set $X$ of cardinality $|X|\ge|\mathcal A|$, the
$X$-th power $(A^X,\mathcal A^X)$ of the algebra $(A,\mathcal A)$ contains a
free subset $\mathcal F\subset A^X$ of cardinality $|\mathcal F|=2^{|X|}$. This
generalizes the classical Fichtenholtz-Kantorovitch-Hausdorff result on the
existence of an independent family $\mathcal I\subset\mathcal P(X)$ of
cardinality $|\mathcal I|=|\mathcal P(X)|$ in the Boolean algebra $\mathcal
P(X)$ of subsets of an infinite set $X$.Comment: 4 page
Subalgebras of FA-presentable algebras

Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First, an example is given to show that the class of finitely generated FA-presentable algebras is not closed under forming finitely generated subalgebras, even within the class of algebras with only unary operations. In contrast, a finitely generated subalgebra of an FA-presentable algebra with a single unary operation is itself FA-presentable. Furthermore, it is proven that the class of unary FA-presentable algebras is closed under forming finitely generated subalgebras and that the membership problem for such subalgebras is decidable.PostprintPeer reviewe
On polymorphism-homogeneous relational structures and their clones

A relational structure is homomorphism-homogeneous if every homomorphism
between finite substructures extends to an endomorphism of the structure. This
notion was introduced recently by Cameron and Ne\v{s}et\v{r}il. In this paper
we consider a strengthening of homomorphism-homogeneity --- we call a
relational structure polymorphism-homogeneous if every partial polymorphism
with a finite domain extends to a global polymorphism of the structure. It
turns out that this notion (under various names and in completely different
contexts) has been existing in algebraic literature for at least 30 years.
Motivated by this observation, we dedicate this paper to the topic of
polymorphism-homogeneous structures. We study polymorphism-homogeneity from a
model-theoretic, an algebraic, and a combinatorial point of view. E.g., we
study structures that have quantifier elimination for positive primitive
formulae, and show that this notion is equivalent to polymorphism-homogeneity
for weakly oligomorphic structures. We demonstrate how the Baker-Pixley theorem
can be used to show that polymorphism-homogeneity is a decidable property for
finite relational structures. Eventually, we completely characterize the
countable polymorphism-homogeneous graphs, the polymorphism-homogeneous posets
of arbitrary size, and the countable polymorphism-homogeneous strict posets.Comment: 31 page
Completion of continuity spaces with uniformly vanishing asymmetry

The classical Cauchy completion of a metric space (by means of Cauchy
sequences) as well as the completion of a uniform space (by means of Cauchy
filters) are well-known to rely on the symmetry of the metric space or uniform
space in question. For qausi-metric spaces and quasi-uniform spaces various
non-equivalent completions exist, often defined on a certain subcategory of
spaces that satisfy a key property required for the particular completion to
exist. The classical filter completion of a uniform space can be adapted to
yield a filter completion of a metric space. We show that this completion by
filters generalizes to continuity spaces that satisfy a form of symmetry which
we call uniformly vanishing asymmetry
Characterizations of several Maltsev conditions.

ame congruence theory identifies six Maltsev conditions associated with locally finite varieties omitting certain types of local behaviour. Extending a result of Siggers, we show that of these six Maltsev conditions only two of them are equivalent to strong Maltsev conditions for locally finite varieties. Besides omitting the unary type, the only other of these conditions that is strong is that of omitting the unary and affine types.\ud
\ud
We also provide novel presentations of some of the above Maltsev conditions
Joins of subalgebras and normals in 0-regular varieties

In any 0-normal variety (0-regular variety in which {0} is a subalgebra), every congruence class containing 0 is a subalgebra. These “normal subalgebras” of a fixed algebra constitute a lattice, isomorphic to its congruence lattice. We are interested in those 0-normal varieties for which the join of two normal subalgebras in the lattice of normal subalgebras of an algebra equals their join in the lattice of subalgebras, as happens with groups and rings. We characterise this property in terms of a Mal’cev condition, and use examples to show it is strictly stronger than being ideal determined but strictly weaker than being 0-coherent (classically ideal determined) and does not imply congruence permutability
Generating all finite modular lattices of a given size

Modular lattices, introduced by R. Dedekind, are an important subvariety of
lattices that includes all distributive lattices. Heitzig and Reinhold
developed an algorithm to enumerate, up to isomorphism, all finite lattices up
to size 18. Here we adapt and improve this algorithm to construct and count
modular lattices up to size 24, semimodular lattices up to size 22, and
lattices of size 19. We also show that $2^{n-3}$ is a lower bound for the
number of nonisomorphic modular lattices of size $n$.Comment: Preprint, 12 pages, 2 figures, 1 tabl
Groups with fix-set quasi-order

If X is a set, the fix-set quasiorder on a group of permutations of X is the quasiorder induced by containment of the fix-sets of elements of SX. Axioms for such quasiorders on groups have previously been given. We generalise these to allow non-faithful group actions, the resulting abstract quasiorders being called fix-orders. We characterise the possible fix-orders on a given group G in terms of certain families of subgroups of G. The special case in which the members of the defining family of subgroups are all normal is considered. Software is used to construct and analyse the lattices of fix-orders of many small finite groups
Galois theory for semiclones

We present a Galois theory connecting finitary operations with pairs of
finitary relations one of which is contained in the other. The Galois closed
sets on both sides are characterised as locally closed subuniverses of the full
iterative function algebra (semiclones) and relation pair clones, respectively.
Moreover, we describe the modified closure operators if only functions and
relation pairs of a certain bounded arity, respectively, are considered.Comment: 38 pages; supported by the Austrian Science Fund (FWF) under grant
  I836-N2
A topological characterisation of endomorphism monoids of countable
  structures

A topological monoid is isomorphic to an endomorphism monoid of a countable
structure if and only if it is separable and has a compatible complete
ultrametric such that composition from the left is non-expansive. We also give
a topological characterisation of those topological monoids that are isomorphic
to endomorphism monoids of countable omega-categorical structures. Finally we
present analogous characterisations for polymorphism clones of countable
structures and for polymorphism clones of countable omega-categorical
structures.Comment: 16 pages; minor corrections have been made in version
A special class of congruences on $\kappa$-frames

Madden has shown that in contrast to the situation with frames, the smallest
dense quotient of a $\kappa$-frame need not be Boolean. We characterise these
so-called d-reduced $\kappa$-frames as those which may be embedded as a
generating sub-$\kappa$-frame of a Boolean frame. We introduce the notion of
the closure of a $\kappa$-frame congruence and call a congruence clear if it is
the largest congruence with a given closure. These ideas are used to prove
$\kappa$-frame analogues of known results concerning Boolean frame quotients.
In particular, we show that d-reduced $\kappa$-frames are precisely the
quotients of $\kappa$-frames by clear congruences and that every $\kappa$-frame
congruence is the meet of clear congruences.Comment: 6 pages, 0 figures. To be published in Algebra Universali