惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
V2EX
P
Proofpoint News Feed
D
DataBreaches.Net
C
Check Point Blog
L
LangChain Blog
量子位
美团技术团队
Vercel News
Vercel News
人人都是产品经理
人人都是产品经理
N
Netflix TechBlog - Medium
V
Visual Studio Blog
Microsoft Security Blog
Microsoft Security Blog
博客园 - 【当耐特】
MongoDB | Blog
MongoDB | Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Last Week in AI
Last Week in AI
The GitHub Blog
The GitHub Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
U
Unit 42
腾讯CDC
M
MIT News - Artificial intelligence
Microsoft Azure Blog
Microsoft Azure Blog
Blog — PlanetScale
Blog — PlanetScale

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Submonoids of Infinite Symmetric Inverse Monoids
Martin Hampenberg · 2025-09-04 · via math.CO updates on arXiv.org

In this thesis we study the subsemigroup structure of the symmetric inverse monoid $I_X$, the inverse semigroup of bijections between subsets of the set $X$, when $X$ is an infinite set. We explore three different approaches to this task. First, we classify the maximal subsemigroups of $I_X$ containing certain subgroups of the symmetric group on $X$. The subgroups in question are the symmetric group itself, the pointwise stabiliser of a finite non-empty subset of $X$, the stabiliser of an ultrafilter on $X$, and the stabiliser of a finite partition of $X$. Next, we study subsemigroups of $I_X$ which are closed in semigroup topologies on $I_X$ introduced by Elliot et al. in 2023. We discover that the closed subsemigroups in these topologies that contain all the idempotents of $I_X$ coincide exactly with semigroups of partial endomorphisms and partial automorphisms of relational structures defined on $X$. Furthermore, we show that if a relational structure $R$ on a countable set $X$ only contains a finite number of relations, then there exists a finite subset $U$ of $I_X$ such that the union of the partial automorphisms of $R$ together with $U$ generates all of $I_X$. Finally, we study the subsemigroup structure of $I_X$ under a preorder introduced by George Bergman and Saharon Shelah in 2006 for the symmetric group. Extending the preorder to $I_X$, if $S_1$ and $S_2$ are subsemigroups of $I_X$, we say that $S_1 \preccurlyeq S_2$ if there exists a finite subset $U$ of $I_X$ such that $S_1$ is contained in the semigroup generated by the union of $S_2$ and $U$. We classify certain types of subsemigroups of $I_X$ according the Bergman-Shelah preorder, and we formulate a conjecture analogous to the main result by Bergman and Shelah.