Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.00493v2

Help | Advanced Search

Mathematics > Rings and Algebras

arXiv:2306.00493v2 (math)
[Submitted on 1 Jun 2023 (v1) , last revised 1 Aug 2023 (this version, v2)]

Title: $S$-preclones and the Galois connection ${}^S\mathrm{Pol}$-${}^S\mathrm{Inv}$, Part I

Title: $S$-前克隆和伽罗瓦连接${}^S\mathrm{Pol}$-${}^S\mathrm{Inv}$,第一部分

Authors:Peter Jipsen, Erkko Lehtonen, Reinhard Pöschel
Abstract: We consider $S$-operations $f \colon A^{n} \to A$ in which each argument is assigned a signum $s \in S$ representing a "property" such as being order-preserving or order-reversing with respect to a fixed partial order on $A$. The set $S$ of such properties is assumed to have a monoid structure reflecting the behaviour of these properties under the composition of $S$-operations (e.g., order-reversing composed with order-reversing is order-preserving). The collection of all $S$-operations with prescribed properties for their signed arguments is not a clone (since it is not closed under arbitrary identification of arguments), but it is a preclone with special properties, which leads to the notion of $S$-preclone. We introduce $S$-relations $\varrho = (\varrho_{s})_{s \in S}$, $S$-relational clones, and a preservation property ($f \mathrel{\stackrel{S}{\triangleright}} \varrho$), and we consider the induced Galois connection ${}^S\mathrm{Pol}$-${}^S\mathrm{Inv}$. The $S$-preclones and $S$-relational clones turn out to be exactly the closed sets of this Galois connection. We also establish some basic facts about the structure of the lattice of all $S$-preclones on $A$.
Abstract: We consider $S$-operations $f \colon A^{n} \to A$ in which each argument is assigned a signum $s \in S$ representing a "property" such as being order-preserving or order-reversing with respect to a fixed partial order on $A$. The set $S$ of such properties is assumed to have a monoid structure reflecting the behaviour of these properties under the composition of $S$-operations (e.g., order-reversing composed with order-reversing is order-preserving). 所有具有特定性质的$S$操作,对于其带符号的参数而言,不是一个克隆(因为其不封闭于任意参数的识别),但它是一个具有特殊性质的前克隆,这导致了$S$前克隆的概念。 我们引入$S$-关系$\varrho = (\varrho_{s})_{s \in S}$,$S$-关系克隆,以及一个保持性质 ($f \mathrel{\stackrel{S}{\triangleright}} \varrho$),并考虑由此产生的伽罗瓦连接${}^S\mathrm{Pol}$-${}^S\mathrm{Inv}$。 $S$-前克隆和$S$-关系克隆恰好是这个伽罗瓦连接的闭集。 我们还建立了一些关于所有$S$-前克隆在$A$上的格结构的基本事实。
Comments: 33 pages
Subjects: Rings and Algebras (math.RA)
Cite as: arXiv:2306.00493 [math.RA]
  (or arXiv:2306.00493v2 [math.RA] for this version)
  https://doi.org/10.48550/arXiv.2306.00493
arXiv-issued DOI via DataCite
Journal reference: Algebra Universalis 85 (2024) Art. 34
Related DOI: https://doi.org/10.1007/s00012-024-00863-7
DOI(s) linking to related resources

Submission history

From: Erkko Lehtonen [view email]
[v1] Thu, 1 Jun 2023 09:43:49 UTC (35 KB)
[v2] Tue, 1 Aug 2023 17:20:52 UTC (144 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.RA
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号