English
Related papers

Related papers: Abelian groups from random hypergraphs

200 papers

Given an elliptic curve $E$ over a perfect defectless henselian valued field $(F,\mathrm{val})$ with perfect residue field $\textbf{k}_F$ and valuation ring $\mathcal{O}_F$, there exists an integral separated smooth group scheme…

Logic · Mathematics 2024-09-05 Yatir Halevi

We study random torsion-free nilpotent groups generated by a pair of random words of length $\ell$ in the standard generating set of $U_n(\mathbb{Z})$. Specifically, we give asymptotic results about the step properties of the group when the…

Group Theory · Mathematics 2016-02-04 Kelly Delp , Tullia Dymarz , Anschel Schaffer-Cohen

The Kneser hypergraph ${\rm KG}^r_{n,k}$ is an $r$-uniform hypergraph with vertex set consisting of all $k$-subsets of $\{1,\ldots,n\}$ and any collection of $r$ vertices forms an edge if their corresponding $k$-sets are pairwise disjoint.…

Combinatorics · Mathematics 2018-06-26 Meysam Alishahi , Ali Taherkhani

We initiate the study of torsion-free algebraically hyperbolic groups; these groups generalise torsion-free hyperbolic groups and are intricately related to groups with no Baumslag--Solitar subgroups. Indeed, for groups of cohomological…

Group Theory · Mathematics 2025-04-29 Giles Gardam , Dawid Kielak , Alan D. Logan

In this note, we construct torsion-free countable, amenable, weakly mixing groups, which answer a question of V. Bergelson. Some results related to verbal subgroups and crystallographic groups are also presented.

Dynamical Systems · Mathematics 2016-07-04 Rostislav Grigorchuk , Rostyslav Kravchenko , Alexander Olshanskii

We derive an asymptotic formula for the number of connected 3-uniform hypergraphs with vertex set $[N]$ and $M$ edges for $M=N/2+R$ as long as $R$ satisfies $R = o(N)$ and $R=\omega(N^{1/3}\ln^{2} N)$. This almost completely fills the gap…

Combinatorics · Mathematics 2014-01-30 Cristiane M. Sato , Nick Wormald

Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated quantum many-particle systems. For the simplest spinless fermion (or boson) systems with say $m$ fermions (or bosons) in $N$ single…

Mathematical Physics · Physics 2015-06-23 V. K. B. Kota

The collapsibility number of simplicial complexes was introduced by Wegner in order to understand the intersection patterns of convex sets. This number also plays an important role in a variety of Helly type results. We show that the…

Combinatorics · Mathematics 2024-04-26 Rekha Santhanam , Samir Shukla , Anurag Singh

In this paper, we will prove the random homogenization of general coercive non-convex Hamilton-Jacobi equations in one dimensional case. This extends the result of Armstrong, Tran and Yu when the Hamiltonian has a separable form…

Analysis of PDEs · Mathematics 2015-07-28 Hongwei Gao

For $\ell \geq 3$, an $\ell$-uniform hypergraph is disperse if the number of edges induced by any set of $\ell+1$ vertices is 0, 1, $\ell$ or $\ell+1$. We show that every disperse $\ell$-uniform hypergraph on $n$ vertices contains a clique…

Combinatorics · Mathematics 2025-08-26 Lior Gishboliner , Ethan Honest

We show that for every finitely presented pro-$p$ nilpotent-by-abelian-by-finite group $G$ there is an upper bound on $\dim_{\mathbb{Q}_p} (H_1(M, \mathbb{Z}_p) \otimes_{\mathbb{Z}_p} \mathbb{Q}_p )$, as $M$ runs through all pro-$p$…

Group Theory · Mathematics 2016-04-14 Martin R Bridson , Dessislava H. Kochloukova

We develop a method to show that some (abstract) groups can be embedded into a free pro-$p$ group. In particular, we show that a finitely generated subgroup of a free $\mathbb Q$-group can be embedded into a free pro-$p$ group for almost…

Group Theory · Mathematics 2026-02-05 Andrei Jaikin-Zapirain

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

Combinatorics · Mathematics 2022-11-07 Yulin Chang , Jie Han , Lubos Thoma

Peterzil and Steinhorn proved that if a group $G$ definable in an $o$-minimal structure is not definably compact, then $G$ contains a definable torsion-free subgroup of dimension one. We prove here a $p$-adic analogue of the…

Logic · Mathematics 2022-05-19 Will Johnson , Ningyuan Yao

Let $k$ be a field of characteristic different from $2$ and let $G$ be a nonabelian residually torsion-free nilpotent group. It is known that $G$ is an orderable group. Let $k(G)$ denote the subdivision ring of the Malcev-Neumann series…

Rings and Algebras · Mathematics 2018-05-23 Vitor O. Ferreira , Jairo Z. Goncalves , Javier Sanchez

We prove that affine Coxeter groups, even hyperbolic Coxeter groups and one-ended hyperbolic Coxeter groups are homogeneous in the sense of model theory. More generally, we prove that many (Gromov) hyperbolic groups generated by torsion…

Group Theory · Mathematics 2026-01-21 Simon André , Gianluca Paolini

Suppose $G$ is a $\mathcal{T}$-group (finitely generated torsion-free nilpotent) with centralizers outside of the derived subgroup being abelian of rank equal to $\text{rank}(Z_1)+1$. This includes the class of free nilpotent groups…

Group Theory · Mathematics 2024-09-25 Adam Moubarak

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. The soft random simplicial complexes is a model for random simplicial complexes built over the…

Probability · Mathematics 2025-07-15 Julián David Candela

The geometric torsion conjecture asserts that the torsion part of the Mordell--Weil group of a family of abelian varieties over a complex quasiprojective curve is uniformly bounded in terms of the genus of the curve. We prove the conjecture…

Algebraic Geometry · Mathematics 2015-04-09 Benjamin Bakker , Jacob Tsimerman

We provide a combinatorial characterization of all testable properties of $k$-uniform hypergraphs ($k$-graphs for short). Here, a $k$-graph property $P$ is testable if there is a randomized algorithm which makes a bounded number of edge…

Combinatorics · Mathematics 2025-05-08 Felix Joos , Jaehoon Kim , Daniela Kühn , Deryk Osthus