English
Related papers

Related papers: Abelian groups from random hypergraphs

200 papers

In this paper, we show the fundamental theorems for rotationally symmetric hypersurfaces, and thus, together with the earlier results in [3] and [4], provide a complete classification of umbilic hypersurfaces in the Heisenberg groups…

Differential Geometry · Mathematics 2025-09-08 Hung-Lin Chiu , Sin-Hua Lai , Hsiao-Fan Liu

We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…

Combinatorics · Mathematics 2022-11-09 S. Ren

We prove that virtually torsion-free, residually finite groups that are inner-amenable and non-amenable have the cheap 1-rebuilding property, a notion recently introduced by Ab\'ert, Bergeron, Fr\k{a}czyk and Gaboriau. As a consequence, the…

Group Theory · Mathematics 2024-10-08 Matthias Uschold

As is well-known, the homology groups of the complement of a complex hyperplane arrangement are torsion-free. Nevertheless, as we showed in a recent paper [arXiv:1209.3414] the homology groups of the Milnor fiber of such an arrangement can…

Algebraic Geometry · Mathematics 2015-11-09 Graham Denham , Alexander Suciu

A finitely presented, torsion free, abelian-by-cyclic group can always be written as an ascending HNN extension Gamma_M of Z^n, determined by an n x n integer matrix M with det(M) \ne 0. The group Gamma_M is polycyclic if and only if…

Group Theory · Mathematics 2007-05-23 Benson Farb , Lee Mosher

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

Combinatorics · Mathematics 2011-02-09 Deepak Bal , Alan Frieze

A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set…

Combinatorics · Mathematics 2013-01-10 Travis Johnston , Linyuan Lu

Let $\p_N \colon \tX \to X$ be a regular covering projection of connected graphs with the group of covering transformations isomorphic to $N$. If $N$ is an elementary abelian $p$-group, then the projection $\p_N$ is called $p$-elementary…

Combinatorics · Mathematics 2007-05-23 A. Malnic , D. Marusic , S. Miklavic , P. Potocnik

Let $r \geq 2$ be a fixed integer. For infinitely many $n$, let $\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple…

Combinatorics · Mathematics 2015-07-13 Vladimir Blinovsky , Catherine Greenhill

Let $k$ be a division ring and let $G$ be either a torsion-free virtually compact special group or a finitely generated torsion-free $3$-manifold group. We embed the group algebra $kG$ in a division ring and prove that the embedding is…

Group Theory · Mathematics 2025-02-21 Sam P. Fisher , Pablo Sánchez-Peralta

Let k be a local field and G the set of k-points of a connected semisimple algebraic k-group of rank one. We describe all torsion-free discrete subgroups of G\times G acting properly discontinuously on G by left and right multiplication. To…

Group Theory · Mathematics 2009-04-20 Fanny Kassel

Given an ample groupoid, we construct a spectral sequence with groupoid homology with integer coefficients on the second sheet, converging to the K-groups of the (reduced) groupoid C*-algebra, provided the groupoid has torsion-free…

K-Theory and Homology · Mathematics 2022-07-12 Valerio Proietti , Makoto Yamashita

We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to…

Combinatorics · Mathematics 2025-09-09 András Mészáros

A $k$-book in a hypergraph consists of $k$ Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a $k$-book-free 3-uniform hypergraph on $n$ vertices is at most $\frac{n^2}{8}(1+o(1))$.

Combinatorics · Mathematics 2023-10-31 Debarun Ghosh , Ervin Győri , Judit Nagy-György , Addisu Paulos , Chuanqi Xiao , Oscar Zamora

We introduce the vertex-arboricity of group-labelled graphs. For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose edges are labelled by elements of $\Gamma$. For an abelian group $\Gamma$ and $A\subseteq \Gamma$, the…

Combinatorics · Mathematics 2023-05-03 O-joung Kwon , Xiaopan Lian

For a random matrix of entries sampled independently from a fairly general distribution in Z we study the probability that the cokernel is isomorphic to a given finite abelian group, or when it is cyclic. This includes the probability that…

Probability · Mathematics 2018-06-05 Hoi H. Nguyen , Melanie Matchett Wood

In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all…

Commutative Algebra · Mathematics 2022-06-02 Mehrdad Nasernejad , Ayesha Asloob Qureshi , Kazem Khashyarmanesh , Leslie G. Roberts

We show that the theory of the free group -- and more generally the theory of any torsion-free hyperbolic group -- is $n$-ample for any $n\geq 1$. We give also an explicit description of the imaginary algebraic closure in free groups.

Group Theory · Mathematics 2012-05-15 Abderezak Ould Houcine , Katrin Tent

We investigate the emergence of spanning structures in sparse pseudo-random $k$-uniform hypergraphs, using the following comparatively weak notion of pseudo-randomness. A $k$-uniform hypergraph $H$ on $n$ vertices is called…

Combinatorics · Mathematics 2021-08-11 Hiep Hàn , Jie Han , Patrick Morris

The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted with $\mathcal G(\mathbf…

Group Theory · Mathematics 2021-02-09 Samir Zahirović