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

We introduce a new model for random simplicial complexes which with high probability generates a complex that has a simply-connected double cover. Hence we develop a model for random simplicial complexes with fundamental group…

We prove essentially sharp bounds for Ramsey numbers of ordered hypergraph matchings, inroduced recently by Dudek, Grytczuk, and Ruci\'{n}ski. Namely, for any $r \ge 2$ and $n \ge 2$, we show that any collection $\mathcal H$ of $n$ pairwise…

We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…

For a given hypergraph $H$ and a vertex $v\in V(H)$, consider a random matching $M$ chosen uniformly from the set of all matchings in $H.$ In $1995,$ Kahn conjectured that if $H$ is a $d$-regular linear $k$-uniform hypergraph, the…

Let $G$ be a finite almost simple group and let $H$ be a Sylow $p$-subgroup of $G$. As a special case of a theorem of Zenkov, there exist $x,y \in G$ such that $H \cap H^x \cap H^y = 1$. In fact, if $G$ is simple, then a theorem of Mazurov…

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…

We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…

We show that for a fixed k, Gromov random groups with any positive density have no non-trivial degree-k representations over any field, a.a.s. This is especially interesting in light of the results of Agol, Ollivier and Wise that when the…

In 1993, Lubotzky and Weiss conjectured that if a compact group admits two finitely generated dense subgroups, one of which is amenable and the other has Kazhdan's property (T), then it would be finite. This conjecture was resolved in the…

Let \Gamma(n,p) denote the binomial model of a random triangular group. We show that there exist constants c, C > 0 such that if p <= c/n^2, then a.a.s. \Gamma(n,p) is free and if p >= C log n/n^2 then a.a.s. \Gamma(n,p) has Kazhdan's…

In this paper, we pose the concepts of pre-topological groups and some generalizations of pre-topological groups. First, we systematically investigate some basic properties of pre-topological groups; in particular, we prove that each…

Consider a host hypergraph $G$ which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of $G$ are sampled at the appropriate rate then the spanning structure still appears…

In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…

Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

This is an extended version of the thesis presented to the Programa de P\'os-Gradua\c{c}\~ao em Matem\'atica of the Departamento de Matem\'atica, PUC-Rio, in September 2013, incorporating some suggestions from the examining commission.…

We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

A seminal result of Koml\'os, S\'ark\"ozy, and Szemer\'edi states that any n-vertex graph G with minimum degree at least (1/2 + {\alpha})n contains every n-vertex tree T of bounded degree. Recently, Pham, Sah, Sawhney, and Simkin extended…