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

推荐订阅源

WordPress大学
WordPress大学
A
About on SuperTechFans
量子位
B
Blog RSS Feed
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
博客园_首页
MongoDB | Blog
MongoDB | Blog
小众软件
小众软件
Blog — PlanetScale
Blog — PlanetScale
Microsoft Azure Blog
Microsoft Azure Blog
V
V2EX
Google DeepMind News
Google DeepMind News
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
H
Hackread – Cybersecurity News, Data Breaches, AI and More
G
Google Developers Blog
U
Unit 42
D
DataBreaches.Net
博客园 - Franky
D
Docker
宝玉的分享
宝玉的分享
Y
Y Combinator Blog
月光博客
月光博客
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Hugging Face - Blog
Hugging Face - Blog

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}}$
The Weyl groupoid in Type A, Young diagrams and Borel sub...
Ian M. Musson · 2023-12-18 · via math.CO updates on arXiv.org

Let $\mathtt{k}$ be an algebraically closed field of characteristic zero. Let ${\stackrel{\rm o}{\mathfrak{g}}}$ be the Lie superalgebra ${\mathfrak{sl}}(n|m)$ and let $\mathfrak{W}$ be the Weyl groupoid introduced by Sergeev and Veselov using the root system of ${\stackrel{\rm o}{\mathfrak{g}}}$. An important subgroupoid $\mathfrak T_{iso}$ of ${\mathfrak{W}}$ has base $Δ_{iso}$, the set of all the isotropic roots. Motivated by deformed quantum Calogero-Moser problems, the same authors considered an action of $\mathfrak{W}$ on $\mathtt{k}^{n|m}$ depending on a parameter $κ$. %When $κ$ is negative special, they showed this action has infinite orbits. In the case $m>n$, with $m,n $ relatively prime and $κ=-n/m$ we study a particular infinite orbit of $\mathfrak T_{iso}$ with some special properties. This orbit, thought of as a directed graph is isomorphic to the graph of an orbit for the action of $\mathfrak T_{iso}$ on certain Borel subalgebras of the affinization ${\widehat{L}(\stackrel{\rm _o}{\mathfrak{g}})}$ of ${\stackrel{\rm o}{\mathfrak{g}}}$. %The root groupoid has a base consisting of Borel subalgebras with fixed even part, and morphisms are given by odd reflections. The underlying reason for this graph isomorphism is that both have combinatorics which can be described using Young diagrams and tableaux drawn on the surface of a rotating cylinder with circumference $n$ and length $m$. Allowing the cylinder to rotate produces an infinite orbit. This leads to a third graph which is isomorphic to the other two.