中文
相关论文

相关论文: A sharp threshold for collapse of the random trian…

200 篇论文

If $G$ is a Polish group and $\Gamma$ is a countable group, denote by $\Hom(\Gamma, G)$ the space of all homomorphisms $\Gamma \to G$. We study properties of the group $\cl{\pi(\Gamma)}$ for the generic $\pi \in \Hom(\Gamma, G)$, when…

逻辑 · 数学 2014-02-10 Julien Melleray , Todor Tsankov

Let $K$ be a global function field of characteristic $p$, and let $\Gamma$ be a finite-index subgroup of an arithmetic group defined with respect to $K$ and such that any torsion element of $\Gamma$ is a $p$-torsion element. We define…

群论 · 数学 2018-03-28 Daniel Studenmund , Kevin Wortman

We study the probability that the random graph $G(n,p)$ is triangle-free. When $p =o(n^{-1/2})$ or $p = \omega(n^{-1/2})$ the asymptotics of the logarithm of this probability are known via Janson's inequality in the former case and via…

概率论 · 数学 2024-11-28 Matthew Jenssen , Will Perkins , Aditya Potukuchi , Michael Simkin

Archdeacon and Grable (1995) proved that the genus of the random graph $G\in\mathcal{G}_{n,p}$ is almost surely close to $pn^2/12$ if $p=p(n)\geq3(\ln n)^2n^{-1/2}$. In this paper we prove an analogous result for random bipartite graphs in…

组合数学 · 数学 2020-11-18 Yifan Jing , Bojan Mohar

We define and develop preliminary theoretical results for the $\Gamma$-switch Ramsey number, a variation on the classical $m$-colour Ramsey number for which we allow permuting the colours incident with a vertex using elements of a group…

组合数学 · 数学 2026-04-21 Christopher Duffy , Benjamin Fok , Gary MacGillivray

We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…

Modularity is a parameter indicating the presence of community structure in the graph. Nowadays it lies at the core of widely used clustering algorithms. We study the modularity of the most classical random graph, binomial $G(n,p)$. In 2020…

组合数学 · 数学 2025-04-24 Katarzyna Rybarczyk , Małgorzata Sulkowska

We determine the sharp threshold for Hamilton cycles in randomly perturbed sparse graphs. For any $\alpha=\alpha(n)=o(1)$, let $G_{\alpha}$ be an $n$-vertex graph with minimum degree $\delta(G_{\alpha})\ge\alpha n$. We prove that if…

组合数学 · 数学 2026-05-29 Guorui Ma , Zhifei Yan

Let $\mathcal{T}$ be a Krull-Schmidt, Hom-finite triangulated category with suspension functor $[1]$. Let $R$ be a basic rigid object, $\Gamma$ the endomorphism algebra of $R$, and $\operatorname{\mathsf{pr}}(R)\subseteq \mathcal{T}$ the…

环与代数 · 数学 2018-12-18 Changjian Fu , Shengfei Geng , Pin Liu

We discuss some new results concerning Gap Conjecture on group growth and present a reduction of it (and its *-version) to several special classes of groups. Namely we show that its validity for the classes of simple groups and residually…

群论 · 数学 2012-09-19 Rostislav Grigorchuk

We study robust versions of properties of $(n,d,\lambda)$-graphs, namely, the property of a random sparsification of an $(n,d,\lambda)$-graph, where each edge is retained with probability $p$ independently. We prove such results for the…

组合数学 · 数学 2025-11-04 Yaobin Chen , Yu Chen , Jie Han , Jingwen Zhao

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

群论 · 数学 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

Let $G$ be a finite group, and let $H$ be a subgroup of $G$. We compute the probability, denoted by $P_G(H)$, that a left transversal of $H$ in $G$ is also a right transversal, thus a two-sided one. Moreover, we define, and denote by…

群论 · 数学 2024-12-12 S. Aivazidis , M. Loukaki , T. W. Mueller

For $q = p^n$ with $p$ an odd prime, the projective linear group $PGL(2,q)$ can be seen as the stabilizer of a conic $O$ in a projective plane $\pi = PG(2,q)$. In that setting, involutions of $PGL(2,q)$ correspond bijectively to points of…

群论 · 数学 2025-09-24 Philippe Tranchida

The longstanding Nash-Williams conjecture asserts that every $K_3$-divisible graph $G$ with $\delta(G)\ge 3n/4$ admits a triangle decomposition. In the random setting, Frankl and R\"odl showed that, with high probability, $G(n,p)$ contains…

组合数学 · 数学 2026-04-29 Xinbu Cheng , Hong Liu , Lanchao Wang , Zhifei Yan

We introduce a family of groups $\Gamma_n^k$ for integer parameters $n>k$. These groups originate from discussion of braid groups on $2$-surfaces. On the other hand, they turn out to be related to 3-manifolds (in particular, they lead to…

几何拓扑 · 数学 2023-05-11 Vassily Olegovich Manturov , Igor Mikhailovich Nikonov

The $k$-gonal models of random groups are defined as the quotients of free groups on $n$ generators by cyclically reduced words of length $k$. As $k$ tends to infinity, this model approaches the Gromov density model. In this paper we show…

群论 · 数学 2021-04-14 MurphyKate Montee

The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…

组合数学 · 数学 2012-09-25 Michael Krivelevich , Benny Sudakov

Let $\Gamma_{0,n}^+(p)\subset \mathrm{SL}_n(\mathbb{Z})$ be the congruence subgroup of level-$p$ whose first column is of the form $(*,0,\dots,0)^t\bmod p$. We prove that the top-dimensional cohomology group…

代数拓扑 · 数学 2026-05-25 Tatiana Abdelnaim

We prove a conjecture of Benjamini and Curien stating that the local limits of uniform random triangulations whose genus is proportional to the number of faces are the Planar Stochastic Hyperbolic Triangulations (PSHT) defined in…

概率论 · 数学 2023-07-19 Thomas Budzinski , Baptiste Louf