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

推荐订阅源

Martin Fowler
Martin Fowler
Jina AI
Jina AI
J
Java Code Geeks
Microsoft Security Blog
Microsoft Security Blog
Recent Announcements
Recent Announcements
I
InfoQ
L
LangChain Blog
The Cloudflare Blog
IT之家
IT之家
博客园 - 叶小钗
Apple Machine Learning Research
Apple Machine Learning Research
B
Blog
A
About on SuperTechFans
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Last Week in AI
Last Week in AI
Blog — PlanetScale
Blog — PlanetScale
罗磊的独立博客
云风的 BLOG
云风的 BLOG
Microsoft Azure Blog
Microsoft Azure Blog
Engineering at Meta
Engineering at Meta
F
Fortinet All Blogs
博客园 - 聂微东
美团技术团队
博客园_首页

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}}$
Invariant Subspaces of Nilpotent Operators. Level, Mean, ...
Claus Michael Ringel, Markus Schmidmeier · 2024-05-29 · via math.CO updates on arXiv.org

We consider the category $\mathcal S(n)$ of all pairs $X = (U,V)$, where $V$ is a finite-dimensional vector space with a nilpotent operator $T$ with $T^n = 0$, and $U$ is a subspace of $V$ such that $T(U) \subseteq U$. Our main interest in an object $X=(U,V)$ are the three numbers $uX=\dim U$ (for the subspace), $wX=\dim V/U$ (for the factor) and $bX=\dim {\rm Ker} T$ (for the operator). Actually, instead of looking at the reference space $\Bbb R^3$ with the triples $(uX,wX,bX)$, we will focus the attention to the corresponding projective space $\Bbb T(n)$ which contains for a non-zero object $X$ the level-colevel pair {\bf pr}$X = (uX/bX,wX/bX)$ supporting the object $X$. We use $\Bbb T(n)$ to visualize part of the categorical structure of $\mathcal S(n)$: The action of the duality $D$ and the square $τ_n^2$ of the Auslander-Reiten translation are represented on $\Bbb T(n)$ by a reflection and a rotation by $120^\circ$ degrees, respectively. Moreover for $n\geq 6$, each component of the Auslander-Reiten quiver of $\mathcal S(n)$ has support either contained in the center of $\Bbb T(n)$ or with the center as its only accumulation point. We show that the only indecomposable objects $X$ in $\mathcal S(n)$ with support having boundary distance smaller than 1 are objects with $bX=1$ which lie on the boundary, whereas any rational vector in $\Bbb T(n)$ with boundary distance at least 2 supports infinitely many indecomposable objects. At present, it is not clear at all what happens for vectors with boundary distance between 1 and 2. The use of $\Bbb T(n)$ provides even in the (quite well-understood) case $n = 6$ some surprises: In particular, we will show that any indecomposable object in $\mathcal S(6)$ lies on one of 12 central lines in $\Bbb T(6)$. The paper is essentially self-contained, all prerequisites which are needed are outlined in detail.