English
Related papers

Related papers: Abelian groups from random hypergraphs

200 papers

In this paper, we consider an analog of the well-studied extremal problem for triangle-free subgraphs of graphs for uniform hypergraphs. A loose triangle is a hypergraph $T$ consisting of three edges $e,f$ and $g$ such that $|e \cap f| = |f…

Combinatorics · Mathematics 2020-05-11 Jiaxi Nie , Sam Spiro , Jacques Verstraete

Suppose that G is a compact Abelian topological group, m is the Haar measure on G and f is a measurable function. Given (n_k), a strictly monotone increasing sequence of integers we consider the nonconventional ergodic/Birkhoff averages…

Dynamical Systems · Mathematics 2019-02-20 Zoltan Buczolich , Gabriella Keszthelyi

Given a principally polarized abelian variety $A$ of dimension $g$ over an algebraically closed field $k$ of characteristic $p$, the $p$ torsion $A[p]$ is a finite flat $p$-torsion group scheme of rank $p^{2g}$. There are exactly $2^g$…

Algebraic Geometry · Mathematics 2017-12-14 Sanath Devalapurkar , John Halliday

For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…

Probability · Mathematics 2016-05-18 Michael Drmota , Emma Yu Jin , Benedikt Stufler

Consider the random Cayley graph of a finite Abelian group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$. Draw a vertex $U \sim \operatorname{Unif}(G)$. We show that the graph distance…

Probability · Mathematics 2025-10-14 Jonathan Hermon , Sam Olesker-Taylor

Bollob\'{a}s and Thomason (1985) proved that for each $k=k(n) \in [1, n-1]$, with high probability, the random graph process, where edges are added to vertex set $V=[n]$ uniformly at random one after another, is such that the stopping time…

Combinatorics · Mathematics 2015-03-10 Daniel Poole

We study fundamental groups of clique complexes associated to random graphs. We establish thresholds for their cohomological and geometric dimension and torsion. We also show that in certain regime any aspherical subcomplex of a random…

Algebraic Topology · Mathematics 2015-06-12 Armindo Costa , Michael Farber , Danijela Horak

Let $k,a,b$ be positive integers with $a+b=k$. A $k$-uniform hypergraph is called an $(a,b)$-cycle if there is a partition $(A_0,B_0,A_1,B_1,\ldots,A_{t-1},B_{t-1})$ of the vertex set with $|A_i|=a$, $|B_i|=b$ such that $A_i\cup B_i$ and…

Combinatorics · Mathematics 2022-08-19 Jian Wang

Let $k \geq 2$ be an integer. We say that a graph $G$ is $(K_2 \cup kK_1)$-free if it does not contain $K_2 \cup kK_1$ as an induced subgraph. Recently, Shi and Shan conjectured that every $1$-tough and $2k$-connected $(K_2 \cup kK_1)$-free…

Combinatorics · Mathematics 2023-02-22 Katsuhiro Ota , Masahiro Sanka

We prove that given any $\epsilon>0$, random integral $n\times n$ matrices with independent entries that lie in any residue class modulo a prime with probability at most $1-\epsilon$ have cokernels asymptotically (as $n\rightarrow\infty$)…

Number Theory · Mathematics 2015-04-20 Melanie Matchett Wood

We prove that the Borel space of torsion-free Abelian groups with domain $\omega$ is Borel complete, i.e., the isomorphism relation on this Borel space is as complicated as possible, as an isomorphism relation. This solves a long-standing…

Logic · Mathematics 2023-02-22 Gianluca Paolini , Saharon Shelah

We prove an asymptotic formula for the number of $k$-uniform hypergraphs with a given degree sequence, for a wide range of parameters. In particular, we find a formula that is asymptotically equal to the number of $d$-regular $k$-uniform…

Combinatorics · Mathematics 2022-02-01 Nina Kamčev , Anita Liebenau , Nick Wormald

In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…

Combinatorics · Mathematics 2016-02-10 Mihyun Kang , Angelica Pachón , Pablo M. Rodriguez

We investigate the $K$-theory of unital UCT Kirchberg algebras $\mathcal{Q}_S$ arising from families $S$ of relatively prime numbers. It is shown that $K_*(\mathcal{Q}_S)$ is the direct sum of a free abelian group and a torsion group, each…

Operator Algebras · Mathematics 2019-02-08 Selçuk Barlak , Tron Omland , Nicolai Stammeier

According to the well-known Heyde theorem, the Gaussian distribution on the real line is characterized by the symmetry of the conditional distribution of one linear form of $n$ independent random variables given another. In the article, we…

Probability · Mathematics 2026-01-07 Gennadiy Feldman

Free groups are known to be homogeneous, meaning that finite tuples of elements which satisfy the same first-order properties are in the same orbit under the action of the automorphism group. We show that virtually free groups have a…

Group Theory · Mathematics 2018-10-29 Simon André

A $k$-lift of an $n$-vertex base graph $G$ is a graph $H$ on $n\times k$ vertices, where each vertex $v$ of $G$ is replaced by $k$ vertices $v_1,\cdots{},v_k$ and each edge $(u,v)$ in $G$ is replaced by a matching representing a bijection…

Discrete Mathematics · Computer Science 2016-12-20 Naman Agarwal , Karthekeyan Chandrasekaran , Alexandra Kolla , Vivek Madan

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…

Combinatorics · Mathematics 2015-07-28 Pablo Candela , Balázs Szegedy , Lluís Vena

Let F be a non-abelian finite rank free group, and let H_g be the fundamental group of a surface of genus g with one boundary component represented by D_g in H_g. So, H_g is the free group <a_1,b_1,...,a_g,b_g> and D_g is the product of…

Geometric Topology · Mathematics 2007-05-23 Mladen Bestvina , Mark Feighn

A {\it weak (Berge) cycle} is an alternating sequence of vertices and (hyper)edges $C=(v_0, e_1, v_1, ..., v_{\ell-1}, e_\ell, v_{\ell}=v_0)$ such that the vertices $v_0, ..., v_{\ell-1}$ are distinct with $v_k, v_{k+1} \in e_{k}$ for each…

Combinatorics · Mathematics 2014-10-29 Daniel Poole
‹ Prev 1 8 9 10 Next ›