Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.13042

Note on Samelson products in exceptional Lie groups

Daisuke Kishimoto·Akihiro Ohsita·Masahiro Takeda
View original source ↗Read source document ↗Export metadata ↓

Abstract

We determine (non-)triviality of Samelson products of inclusions of factors of the mod $p$ decomposition of $G_{(p)}$ for $(G,p)=(E_7,5),(E_7,7),(E_8,7)$. This completes the determination of (non-)triviality of those Samelson products in $p$-localized exceptional Lie groups when $G$ has $p$-torsion free homology.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daisuke Kishimoto, Akihiro Ohsita, Masahiro Takeda. 2020-07-26. Note on Samelson products in exceptional Lie groups. https://doi.org/10.1017/s0017089520000567

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Non-Orientable Topology of Condorcet's Paradox

Preference cycles are prevalent in problems of decision-making, and are contradictory when preferences are assumed to be transitive. This contradiction underlies Condorcet's Paradox, a pioneering result of social choice theory, wherein intuitive and seemingly desirable constraints on decision-making necessarily lead to contradictory preference cycles. Topological methods have since broadened social choice theory and elucidated existing results. However, characterisations of preference cycles in topological social choice theory are lacking. In this paper, we address this gap by introducing a framework for topologically modelling preference cycles that generalises Baryshnikov's existing topological model of strict, ordinal preferences on 3 alternatives. In our framework, the contradiction underlying Condorcet's Paradox topologically corresponds to the non-orientability of a surface homeomorphic to either the Klein bottle or real projective plane, depending on how preference cycles are represented. These findings allow us to reformulate Arrow's Impossibility Theorem in terms of the orientability of a surface as well.

math.AT↗
arXiv2026

Two-Sided Dimension Bounds for the Peterson Hit Problem via Projections and Matrix Minors

Let $\mathcal P_k=\mathbb F_2[x_1,\ldots,x_k]$ be the polynomial algebra over the prime field $\mathbb F_2$, viewed as an unstable module over the mod-$2$ Steenrod algebra $\mathcal A$. The well-known Peterson hit problem asks for a minimal set of generators for the $\mathcal A$-module $\mathcal P_k$. This is equivalent to determining the dimension of the cohit space $(Q\mathcal P_k)_d=(\mathcal P_k/\mathcal A^{+}\mathcal P_k)_d$, where $\mathcal A^{+}$ denotes the augmentation ideal of $\mathcal A$, for every $k\geq1$ and positive degree $d$. Although solved in every degree for at most four variables, it remains a difficult open problem in general. Furthermore, given the limitations of current tools, explicitly determining the dimension of $(Q\mathcal P_k)_d$ in the general case appears out of reach. Motivated by these limitations, we establish explicit upper and lower bounds for this dimension for arbitrary positive integers $k$ and $d.$ Our method combines binary combinatorics, linear algebra, and graph and simplicial structures associated with the generating Steenrod squares. We characterize zero rows, count zero columns, and refine rank estimates using Adem relations. Minors and zero rows of the resulting smaller matrix yield further two-sided cohit bounds without determining a complete basis or computing the full hit rank.

math.AT↗
arXiv2026

Persistent Magnitude Homology for Quantitative Equational Theories

A quantitative equational theory $U$ reasons about terms that agree up to a numerical error. It presents a free algebra $T_UA$ over a metric space $A$ of generators, the terms of the syntax at the least distance the axioms derive, and that metric is its semantic content. We give a functorial invariant of it, the persistent magnitude homology of $T_UA$: a barcode where the module is tame, finite linear algebra where $T_UA$ is finite, Lipschitz in each degree. Magnitude homology is graded by length and knows nothing of persistence, its persistent refinement nothing of where its bars begin and end, yet the two are one construction: filtering the length nerve by sublevel sets of the length yields the persistence module, and the associated graded of that filtration is the magnitude complex. A long exact sequence exchanges them, and each side gains what it lacked. Magnitude homology locates the critical values of the barcode, so a graded computation lists the lengths at which an endpoint can occur, and the barcode acquires a stability estimate of $(n+1)δ$ in degree $n$ under a perturbation of size $δ$, and a computed perturbation shows that the factor cannot be dropped. An inclusion of theories induces a morphism of the presenting monads and, where the induced map is bijective and shortens no distance by more than $δ$, a comparison of barcodes under the same bound, so a barcode movement measures the metric-semantic strength of the added axioms. Four examples are computed, one in every degree.

math.AT↗