中文
相关论文

相关论文: Random groups and Property (T): \.Zuk's theorem re…

200 篇论文

The present paper is concerned with the various algebraic structures supported by the set of Tur\'an densities. We prove that the set of Tur\'an densities of finite families of r-graphs is a non-trivial commutative semigroup, and as a…

组合数学 · 数学 2016-07-04 Codrut Grosu

We give a cohomological characterization of Gromov relative hyperbolicity. As an application we prove a converse to the combination theorem for graphs of relatively hyperbolic groups given in a previous paper of the first author. We build…

群论 · 数学 2007-10-25 F. Gautero , M. Heusener

We study the logical properties of infinite geometric random graphs, introduced by Bonato and Janssen. These are graphs whose vertex set is a dense ``generic'' subset of a metric space, where two vertices are adjacent with probability $p>0$…

逻辑 · 数学 2023-04-24 Omer Ben-Neria , Itay Kaplan , Tingxiang Zou

Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…

物理与社会 · 物理学 2015-02-03 Jun Zhao , Osman Yağan , Virgil Gligor

We prove that a random group, in Gromov's density model with $d<1/16$, satisfies a universal sentence $\sigma$ (in the language of groups) if and only if $\sigma$ is true in a nonabelian free group.

群论 · 数学 2024-10-29 O. Kharlampovich , R. Sklinos

In 1963, Anton Kotzig famously conjectured that $K_{n}$, the complete graph of order $n$, where $n$ is even, can be decomposed into $n-1$ perfect matchings such that every pair of these matchings forms a Hamilton cycle. The problem is still…

组合数学 · 数学 2025-10-03 Stefan Glock , Amedeo Sgueglia

Drawing on some recent results that provide the formalism necessary to definite stationarity for infinite random graphs, this paper initiates the study of statistical and learning questions pertaining to these objects. Specifically, a…

机器学习 · 计算机科学 2017-08-11 Daniil Ryabko

A topological gyrogroup is a gyrogroup endowed with a topology such that the binary operation is jointly continuous and the inverse mapping is also continuous. In this paper, it is proved that if $G$ is a sequential topological gyrogroup…

一般拓扑 · 数学 2021-03-23 Meng Bao , Xiaoyuan Zhang , Xiaoquan Xu

Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference generalisation of Cockayne-Lorimer, which (informally) says that…

组合数学 · 数学 2026-03-24 Peter Keevash , Peleg Michaeli

Let a_1,...,a_k satisfy a_1+...+a_k=1 and suppose a k-uniform hypergraph on n vertices satisfies the following property; in any partition of its vertices into k sets A_1,...,A_k of sizes a_1*n,...,a_k*n, the number of edges intersecting…

组合数学 · 数学 2010-02-02 Asaf Shapira , Raphael Yuster

This survey is concerned with random walks on mapping class groups. We illustrate how the actions of mapping class groups on Teichm\"uller spaces or curve complexes reveal the nature of random walks, and vice versa. Our emphasis is on the…

几何拓扑 · 数学 2021-10-12 Inhyeok Choi , Hyungryul Baik

We investigate conformal dimension for the class of infinite hyperbolic groups in the Gromov density model $\mathcal{G}^d_{m,l}$ of random groups with $m \geq 2$ fixed generators, density $0 < d < 1/2$ and relator length $l \to \infty$. Our…

群论 · 数学 2022-04-12 Jordan Frost

This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turan's theorem, which…

组合数学 · 数学 2017-07-31 Peter Allen , Julia Böttcher , Jan Hladký , Diana Piguet

An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…

组合数学 · 数学 2020-03-10 Sebastian Jeon , Tanya Khovanova

We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…

组合数学 · 数学 2007-05-23 Harry Buhrman , Ming Li , John Tromp , Paul Vitanyi

We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…

组合数学 · 数学 2019-07-30 Michael Anastos , Peleg Michaeli , Samantha Petti

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

群论 · 数学 2015-12-02 Narutaka Ozawa

Strong bounds - going beyond Sarnak's density hypothesis - are obtained for the number of automorphic forms for the congruence subgroup Gamma_0(q) of SL_n(Z) violating the Ramanujan conjecture at any given unramified place. The proof is…

数论 · 数学 2022-11-11 Valentin Blomer

A proof of a theorem of M. Hertweck presented during a seminar in January 2013 in Stuttgart is given. The proof is based on a preprint given to me by Hertweck. Let $R$ be a commutative ring, $G$ a finite group, $N$ a normal $p$-subgroup of…

环与代数 · 数学 2017-06-08 Leo Margolis

In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…

组合数学 · 数学 2015-04-06 Balazs Szegedy