arXiv (All)
open access
Comparing word probabilities in finite groups
We use results from extremal graph theory and analysis to compare word probabilities in finite groups. In particular, we show that the probability of satisfying the 2-Engel word admits a positive lower bound in terms of the probability that an element has order dividing 3. More generally, using a gr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- "NepS: Normed Resource of Semantically Diverse Nepali Sentence Completions" Stage 1 Registered Report#977032
- Statistical mathematics#490569
- Detecting Inequality in Noisy Communication: Promises and Pitfalls of Large Language Models#1121743
- Detecting Inequality in Noisy Communication: Promises and Pitfalls of Large Language Models#1121373
- Introduction to the Science of Language#207550
Record · ID 1401025
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive