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

推荐订阅源

H
Help Net Security
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
博客园 - 【当耐特】
Microsoft Azure Blog
Microsoft Azure Blog
Google DeepMind News
Google DeepMind News
Apple Machine Learning Research
Apple Machine Learning Research
有赞技术团队
有赞技术团队
Y
Y Combinator Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
爱范儿
爱范儿
L
LangChain Blog
IT之家
IT之家
酷 壳 – CoolShell
酷 壳 – CoolShell
MongoDB | Blog
MongoDB | Blog
Hugging Face - Blog
Hugging Face - Blog
G
Google Developers Blog
T
Tailwind CSS Blog
Engineering at Meta
Engineering at Meta
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
宝玉的分享
宝玉的分享
博客园 - 三生石上(FineUI控件)
D
DataBreaches.Net
Recent Announcements
Recent Announcements
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More

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}}$
Heights of posets associated with Green's relations on se...
Matthew Brookes, Craig Miller · 2024-02-09 · via math.CO updates on arXiv.org

Given a semigroup $S$, for each Green's relation $\mathcal{K}\in\{\mathcal{L},\mathcal{R},\mathcal{J},\mathcal{H}\}$ on $S,$ the $\mathcal{K}$-height of $S,$ denoted by $H_{\mathcal{K}}(S),$ is the height of the poset of $\mathcal{K}$-classes of $S.$ More precisely, if there is a finite bound on the sizes of chains of $\mathcal{K}$-classes of $S,$ then $H_{\mathcal{K}}(S)$ is defined as the maximum size of such a chain; otherwise, we say that $S$ has infinite $\mathcal{K}$-height. We discuss the relationships between these four $\mathcal{K}$-heights. The main results concern the class of stable semigroups, which includes all finite semigroups. In particular, we prove that a stable semigroup has finite $\mathcal{L}$-height if and only if it has finite $\mathcal{R}$-height if and only if it has finite $\mathcal{J}$-height. In fact, for a stable semigroup $S,$ if $H_{\mathcal{L}}(S)=n$ then $H_{\mathcal{R}}(S)\leq2^n-1$ and $H_{\mathcal{J}}(S)\leq2^n-1,$ and we exhibit a family of examples to prove that these bounds are sharp. Furthermore, we prove that if $2\leq H_{\mathcal{L}}(S)<\infty$ and $2\leq H_{\mathcal{R}}(S)<\infty,$ then $H_{\mathcal{J}}(S)\leq H_{\mathcal{L}}(S)+H_{\mathcal{R}}(S)-2.$ We also show that for each $n\in\mathbb{N}$ there exists a semigroup $S$ such that $H_{\mathcal{L}}(S)=H_{\mathcal{R}}(S)=2^n+n-3$ and $H_{\mathcal{J}}(S)=2^{n+1}-4.$ By way of contrast, we prove that for a regular semigroup the $\mathcal{L}$-, $\mathcal{R}$- and $\mathcal{H}$-heights coincide with each other, and are greater or equal to the $\mathcal{J}$-height. Moreover, in a stable, regular semigroup the $\mathcal{L}$-, $\mathcal{R}$-, $\mathcal{H}$- and $\mathcal{J}$-heights are all equal.