• All Solutions All Solutions Caret
    • Editage

      One platform for all researcher needs

    • Paperpal

      AI-powered academic writing assistant

    • R Discovery

      Your #1 AI companion for literature search

    • Mind the Graph

      AI tool for graphics, illustrations, and artwork

    • Journal finder

      AI-powered journal recommender

    Unlock unlimited use of all AI tools with the Editage Plus membership.

    Explore Editage Plus
  • Support All Solutions Support
    discovery@researcher.life
Discovery Logo
Sign In
Paper
Search Paper
Cancel
Pricing Sign In
  • My Feed iconMy Feed
  • Search Papers iconSearch Papers
  • Library iconLibrary
  • Explore iconExplore
  • Ask R Discovery iconAsk R Discovery Star Left icon
  • Chat PDF iconChat PDF Star Left icon
  • Chrome Extension iconChrome Extension
    External link
  • Use on ChatGPT iconUse on ChatGPT
    External link
  • iOS App iconiOS App
    External link
  • Android App iconAndroid App
    External link
  • Contact Us iconContact Us
    External link
Discovery Logo menuClose menu
  • My Feed iconMy Feed
  • Search Papers iconSearch Papers
  • Library iconLibrary
  • Explore iconExplore
  • Ask R Discovery iconAsk R Discovery Star Left icon
  • Chat PDF iconChat PDF Star Left icon
  • Chrome Extension iconChrome Extension
    External link
  • Use on ChatGPT iconUse on ChatGPT
    External link
  • iOS App iconiOS App
    External link
  • Android App iconAndroid App
    External link
  • Contact Us iconContact Us
    External link

Related Topics

  • Inverse Semigroups
  • Inverse Semigroups
  • Inverse Monoid
  • Inverse Monoid
  • Finite Semigroups
  • Finite Semigroups

Articles published on Symmetric inverse semigroup

Authors
Select Authors
Journals
Select Journals
Duration
Select Duration
90 Search results
Sort by
Recency
  • Research Article
  • 10.1142/s1793557124501146
Listing the subsets of Xn to build a (minimal) quasi-idempotent generating set of In,r
  • Dec 4, 2024
  • Asian-European Journal of Mathematics
  • Leyla Bugay

Let [Formula: see text] be the symmetric inverse semigroup on the finite chain [Formula: see text] and let [Formula: see text] for [Formula: see text]. A quasi-idempotent element is an element [Formula: see text] with the property that [Formula: see text]. In this paper, we obtain a useful method by listing the subsets of [Formula: see text] to build a (minimal) quasi-idempotent generating set of [Formula: see text] both as a semigroup and also as an inverse semigroup for [Formula: see text] and [Formula: see text].

  • Open Access Icon
  • Research Article
  • Cite Count Icon 1
  • 10.55016/ojs/cdm.v19i2.62669
Combinatorial results for order-preserving partial injective contraction mappings
  • Apr 30, 2024
  • Contributions to Discrete Mathematics
  • Ahmed Bayo Musa + 4 more

Let $ \mathcal{I}_n$ be the symmetric inverse semigroup on $X_n = \{1, 2, \ldots , n\}$. Let $\mathcal{OCI}_n$ be the subsemigroup of $\mathcal{I}_n$ consisting of all order-preserving injective partial contraction mappings, and let $\mathcal{ODCI}_n$ be the subsemigroup of $\mathcal{I}_n$ consisting of all order-preserving and order-decreasing injective partial contraction mappings of $X_n$. In this paper, we investigate the cardinalities of some equivalences on $\mathcal{OCI}_n$ and $\mathcal{ODCI}_n$ which lead naturally to obtaining the order of these semigroups. Then, we relate the formulae obtained to Fibonacci numbers. Similar results about $\mathcal{ORCI}_n$, the semigroup of order-preserving or order-reversing injective partial contraction mappings, are deduced.

  • Open Access Icon
  • Research Article
  • 10.36347/sjpms.2024.v11i03.001
Algebraic Properties of the Semigroup of Partial Isometries of a Finite Chain
  • Mar 11, 2024
  • Scholars Journal of Physics, Mathematics and Statistics
  • Udoaka, O G + 1 more

This work analyses the algebraic properties of the sub-semi group of partial Isometries (〖DP〗_n) and of order preserving partial isometries (〖ODP〗_n) of a finite chain X_n={1,2,…n}, with a symmetric inverse semigroup I_n defined on it. It also investigates the subsemigroups 〖DP〗_n and 〖ODP〗_n for cycle structure and shows that 〖ODP〗_n is a 0 -E- unitary inverse semigroup.

  • Open Access Icon
  • PDF Download Icon
  • Research Article
  • 10.15826/umj.2023.2.015
A PRESENTATION FOR A SUBMONOID OF THE SYMMETRIC INVERSE MONOID
  • Dec 27, 2023
  • Ural Mathematical Journal
  • Apatsara Sareeto + 1 more

In the present paper, we study a submonoid of the symmetric inverse semigroup \(I_n\). Specifically, we consider the monoid of all order-, fence-, and parity-preserving transformations of \(I_n\). While the rank and a set of generators of minimal size for this monoid are already known, we will provide a presentation for this monoid.

  • Open Access Icon
  • Research Article
  • Cite Count Icon 1
  • 10.1142/s1793557123502236
The rank of the semigroup of order-, fence-, and parity-preserving partial injections on a finite set
  • Nov 10, 2023
  • Asian-European Journal of Mathematics
  • Apatsara Sareeto + 1 more

The monoid of all partial injections on a finite set (the symmetric inverse semigroup) is of particular interest because of the well-known Wagner–Preston Theorem. Let [Formula: see text] be a positive natural number and [Formula: see text] be the semigroup of all fence-preserving partial one-to-one maps of [Formula: see text] into itself with respect to composition of maps and the fence [Formula: see text]. There is considered the inverse semigroup [Formula: see text] of all [Formula: see text] such that [Formula: see text] is regular in [Formula: see text], order-preserving with respect to the order [Formula: see text] and parity-preserving. According to the main result of the paper, it is [Formula: see text] the least of the cardinalities of the generating sets of [Formula: see text] for [Formula: see text]. There is determined a concrete representation of a generating set of minimal size.

  • Open Access Icon
  • Research Article
  • 10.12697/acutm.2023.27.02
On dominions of certain ample monoids
  • May 26, 2023
  • Acta et Commentationes Universitatis Tartuensis de Mathematica
  • Nasir Sohail + 1 more

A semigroup S is called left ample if it can be embedded in the symmetric inverse semigroup IX of partial bijections of a non-empty set X such that the image of S is closed under the unary operation α → αα⁻¹, where α⁻¹ is the inverse of α in IX. Right ample semigroups are defined dually. A semigroup is called ample if it is both left and right ample. A monoid is (left, right) ample if it is (left, right) ample as a semigroup. We observe that the dominion of an ample subsemigroup of IX coincides with the inverse subsemigroup of IX generated by it. We then determine the dominions of certain submonoids of In, the symmetric inverse semigroup over a finite chain 1<2<⋯<n.

  • Open Access Icon
  • Research Article
  • 10.1007/s00233-022-10262-w
Publisher Correction to: Topologies on the symmetric inverse semigroup
  • Mar 16, 2022
  • Semigroup Forum
  • J Pérez + 1 more

Publisher Correction to: Topologies on the symmetric inverse semigroup

  • Open Access Icon
  • Research Article
  • Cite Count Icon 4
  • 10.1007/s00233-021-10242-6
Topologies on the symmetric inverse semigroup
  • Jan 27, 2022
  • Semigroup Forum
  • J Pérez + 1 more

The symmetric inverse semigroup I(X) on a set X is the collection of all partial bijections between subsets of X with composition as the algebraic operation. We study the minimal Hausdorff inverse semigroup topology on I(X). We present some characterizations of it. When X is countable such topology is Polish.

  • Open Access Icon
  • PDF Download Icon
  • Research Article
  • 10.33003/fjs-2020-0404-501
NUMERICAL AND GRAPHICAL RESULTS OF FINITE SYMMETRIC INVERSE (I_{n}) AND FULL (T_{n}) TRANSFORMATION SEMIGROUPS
  • Jun 14, 2021
  • FUDMA JOURNAL OF SCIENCES
  • R Kehinde + 1 more

Supposed is a finite set, then a function is called a finite partial transformation semigroup , which moves elements of from its domain to its co-domain by a distance of where . The total work done by the function is therefore the sum of these distances. It is a known fact that and . In this this research paper, we have mainly presented the numerical solutions of the total work done, the average work done by functions on the finite symmetric inverse semigroup of degree , and the finite full transformation semigroup of degree , as well as their respective powers for a given fixed time in space. We used an effective methodology and valid combinatorial results to generalize the total work done, the average work done and powers of each of the transformation semigroups. The generalized results were tested by substituting small values of and a specified fixed times in space. Graphs were plotted in each case to illustrate the nature of the total work done and the average work done. The results obtained in this research article have an important application in some branch of physics and theoretical computer science

  • Research Article
  • Cite Count Icon 1
  • 10.3906/mat-2001-3
Quasi-idempotent ranks of the proper ideals in finite symmetric inverse semigroups
  • Jan 21, 2021
  • TURKISH JOURNAL OF MATHEMATICS
  • Leyla Bugay

Quasi-idempotent ranks of the proper ideals in finite symmetric inverse semigroups

  • Open Access Icon
  • Research Article
  • 10.30970/vmm.2021.91.040-053
A note on feebly compact semitopological symmetric inverse semigroups of a bounded finite rank
  • Jan 1, 2021
  • Visnyk Lvivskogo Universytetu Seriya Mekhaniko-Matematychna
  • Oleg Gutik

A note on feebly compact semitopological symmetric inverse semigroups of a bounded finite rank

  • Research Article
  • 10.1080/00927872.2020.1782926
The structure of centralizers in the finite symmetric inverse semigroup
  • Jul 7, 2020
  • Communications in Algebra
  • Janusz Konieczny

For an integer let be the symmetric inverse semigroup of partial injective transformations on an n-element set. For denote by and respectively, the first and second centralizer of λ in We determine the structure of and in terms of Green’s relations, including the partial order of -classes, and express as a direct product of cyclic groups with zero adjoined and a monogenic monoid. For each individual Green relation we determine such that in is inherited from and λ such that all Green relations in are inherited from We also provide a representation of the partial order of -classes in as a known lattice, and describe such that which gives a class of maximal commutative subsemigroups of

  • Research Article
  • 10.1134/s001626632003003x
Characters of the Infinite Symmetric Inverse Semigroup
  • Jul 1, 2020
  • Functional Analysis and Its Applications
  • N I Nessonov

A complete description of indecomposable characters of the infinite symmetric inverse semigroup is given. The method essentially uses the decomposition of the elements of this semigroup into a product of independent quasi-cycles and the multiplicativity theorem. Realizations of all factor representations of finite type are constructed.

  • Open Access Icon
  • Research Article
  • 10.25092/baunfbed.745821
Certain ranks of some ideals in symmetric inverse semigroups contains S_n or A_n
  • Apr 10, 2020
  • Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi
  • Leyla Bugay

Let I_n, S_n and A_n be the symmetric inverse semigroup, the symmetric group and the alternating group on X_n={1,…,n}, for n≥2, respectively. Also let I_(n,r) be the subsemigroup consists of all partial injective maps with height less than or equal to r for 1≤r≤n-1, and let SI_(n,r)=I_(n,r)∪S_n and AI_(n,r)=I_(n,r)∪A_n. A non-idempotent element whose square is an idempotent is called a quasi-idempotent. In this paper we obtain the rank and the quasi-idempotent rank of SI_(n,r) (of AI_(n,r)). Also we obtain the relative rank and the relative quasi-idempotent rank of SI_(n,r) modulo S_n (of AI_(n,r) modulo A_n).

  • Open Access Icon
  • Research Article
  • 10.30970/vmm.2019.87.005-036
Extensions of semigroups by symmetric inverse semigroups of a~bounded finite rank
  • Feb 28, 2020
  • Visnyk Lvivskogo Universytetu. Seriya Mekhaniko-Matematychna
  • Oleg Gutik + 1 more

We study the semigroup extension $\mathscr{I}_\lambda^n(S)$ of a semigroup $S$ by symmetric inverse semigroups of a bounded finite rank. We describe idempotents and regular elements of the semigroups $\mathscr{I}_\lambda^n(S)$ and $\overline{\mathscr{I}_\lambda^n}(S)$ show that the semigroup $\mathscr{I}_\lambda^n(S)$ ($\overline{\mathscr{I}_\lambda^n}(S)$) is regular, orthodox, inverse or stable if and only if so is $S$. Green's relations are described on the semigroup $\mathscr{I}_\lambda^n(S)$ for an arbitrary monoid $S$. We introduce the conception of a semigroup with strongly tight ideal series, and proved that for any infinite cardinal $\lambda$ and any positive integer $n$ the semigroup $\mathscr{I}_\lambda^n(S)$ has a strongly tight ideal series provides so has $S$. At the finish we show that for every compact Hausdorff semitopological monoid $(S,\tau_S)$ there exists a unique its compact topological extension $\left(\mathscr{I}_\lambda^n(S),\tau_{\mathscr{I}}^\mathbf{c}\right)$ in the class of Haudorff semitopological semigroups.

  • Open Access Icon
  • Research Article
  • Cite Count Icon 2
  • 10.1016/j.jalgebra.2019.09.027
Quiver mutations and Boolean reflection monoids
  • Oct 23, 2019
  • Journal of Algebra
  • Bing Duan + 2 more

Quiver mutations and Boolean reflection monoids

  • Open Access Icon
  • Research Article
  • Cite Count Icon 8
  • 10.1016/j.jalgebra.2019.05.022
Conjugacy in inverse semigroups
  • May 31, 2019
  • Journal of Algebra
  • João Araújo + 2 more

Conjugacy in inverse semigroups

  • Open Access Icon
  • Research Article
  • Cite Count Icon 6
  • 10.1007/s11128-019-2180-2
Quantum phase transitions and localization in semigroup Fredkin spin chain
  • Jan 24, 2019
  • Quantum Information Processing
  • Pramod Padmanabhan + 2 more

We construct an extended quantum spin chain model by introducing new degrees of freedom to the Fredkin spin chain. The new degrees of freedom called arrow indices are partly associated to the symmetric inverse semigroup $\cS^3_1$. Ground states of the model fall into three different phases, and quantum phase transition takes place at each phase boundary. One of the phases exhibits logarithmic violation of the area law of entanglement entropy and quantum criticality, whereas the other two obey the area law. As an interesting feature arising by the extension, there are excited states due to disconnections with respect to the arrow indices. We show that these states are localized without disorder.

  • Research Article
  • Cite Count Icon 1
  • 10.1140/epjst/e2018-00080-2
Quantum phase transitions in a frustration-free spin chain based on modified Motzkin walks
  • Sep 1, 2018
  • The European Physical Journal Special Topics
  • Fumihiko Sugino + 1 more

Area law violations for entanglement entropy in the form of a square root has recently been studied for one-dimensional frustration-free quantum systems based on the Motzkin walks and their variations. Here, we further modify the Motzkin walks using the elements of a symmetric inverse semigroup as basis states on each step of the walk. This change alters the number of paths allowed in the Motzkin walks and by introducing an appropriate term in the Hamiltonian with a tunable parameter we show that we can jump from a state that violates the area law logarithmically to a state that obeys the area law providing an example of quantum phase transition in a one-dimensional system.

  • Research Article
  • Cite Count Icon 7
  • 10.1007/s00233-018-9954-1
The ranks of certain semigroups of partial isometries
  • Jul 16, 2018
  • Semigroup Forum
  • Leyla Bugay + 2 more

Let $$I_{n}$$ be the symmetric inverse semigroup on $$X_{n}=\{1,\ldots ,n\}$$ , and let $$DP_{n}$$ and $$ODP_{n}$$ be its subsemigroups of partial isometries and of order-preserving partial isometries on $$X_{n}$$ under its natural order, respectively. In this paper we find the ranks of the subsemigroups $$DP_{n,r}=\{ \alpha \in DP_{n}:|\mathrm {im\, }(\alpha )|\le r\}$$ and $$ODP_{n,r}=\{ \alpha \in ODP_{n}: |\mathrm {im\, }(\alpha )|\le r\}$$ for $$2\le r\le n-1$$ .

  • 1
  • 2
  • 3
  • 4
  • 5
  • 1
  • 2
  • 3
  • 4
  • 5

Popular topics

  • Latest Artificial Intelligence papers
  • Latest Nursing papers
  • Latest Psychology Research papers
  • Latest Sociology Research papers
  • Latest Business Research papers
  • Latest Marketing Research papers
  • Latest Social Research papers
  • Latest Education Research papers
  • Latest Accounting Research papers
  • Latest Mental Health papers
  • Latest Economics papers
  • Latest Education Research papers
  • Latest Climate Change Research papers
  • Latest Mathematics Research papers

Most cited papers

  • Most cited Artificial Intelligence papers
  • Most cited Nursing papers
  • Most cited Psychology Research papers
  • Most cited Sociology Research papers
  • Most cited Business Research papers
  • Most cited Marketing Research papers
  • Most cited Social Research papers
  • Most cited Education Research papers
  • Most cited Accounting Research papers
  • Most cited Mental Health papers
  • Most cited Economics papers
  • Most cited Education Research papers
  • Most cited Climate Change Research papers
  • Most cited Mathematics Research papers

Latest papers from journals

  • Scientific Reports latest papers
  • PLOS ONE latest papers
  • Journal of Clinical Oncology latest papers
  • Nature Communications latest papers
  • BMC Geriatrics latest papers
  • Science of The Total Environment latest papers
  • Medical Physics latest papers
  • Cureus latest papers
  • Cancer Research latest papers
  • Chemosphere latest papers
  • International Journal of Advanced Research in Science latest papers
  • Communication and Technology latest papers

Latest papers from institutions

  • Latest research from French National Centre for Scientific Research
  • Latest research from Chinese Academy of Sciences
  • Latest research from Harvard University
  • Latest research from University of Toronto
  • Latest research from University of Michigan
  • Latest research from University College London
  • Latest research from Stanford University
  • Latest research from The University of Tokyo
  • Latest research from Johns Hopkins University
  • Latest research from University of Washington
  • Latest research from University of Oxford
  • Latest research from University of Cambridge

Popular Collections

  • Research on Reduced Inequalities
  • Research on No Poverty
  • Research on Gender Equality
  • Research on Peace Justice & Strong Institutions
  • Research on Affordable & Clean Energy
  • Research on Quality Education
  • Research on Clean Water & Sanitation
  • Research on COVID-19
  • Research on Monkeypox
  • Research on Medical Specialties
  • Research on Climate Justice
Discovery logo
FacebookTwitterLinkedinInstagram

Download the FREE App

  • Play store Link
  • App store Link
  • Scan QR code to download FREE App

    Scan to download FREE App

  • Google PlayApp Store
FacebookTwitterTwitterInstagram
  • Universities & Institutions
  • Publishers
  • R Discovery PrimeNew
  • Ask R Discovery
  • Blog
  • Accessibility
  • Topics
  • Journals
  • Open Access Papers
  • Year-wise Publications
  • Recently published papers
  • Pre prints
  • Questions
  • FAQs
  • Contact us
Lead the way for us

Your insights are needed to transform us into a better research content provider for researchers.

Share your feedback here.

FacebookTwitterLinkedinInstagram
Cactus Communications logo

Copyright 2025 Cactus Communications. All rights reserved.

Privacy PolicyCookies PolicyTerms of UseCareers