Related papers: A sharp threshold for collapse of the random trian…

Recently there has been much interest in studying random graph analogues of well known classical results in extremal graph theory. Here we follow this trend and investigate the structure of triangle-free subgraphs of $G(n,p)$ with high…

In this paper, we determine the sharp threshold for universality of cokernels of random matrices over finite fields. More precisely, we prove the following: given any constant $c>1$, let $A(n)$ be a random $n \times n$ matrix over…

We present randomized versions of the {\it triangle algorithm} introduced in \cite{kal14}. The triangle algorithm tests membership of a distinguished point $p \in \mathbb{R} ^m$ in the convex hull of a given set $S$ of $n$ points in…

We prove that random triangulations of high genus contain very large expander subgraphs, answering a question of Benjamini. Our approach relies on new general criteria for arbitrary graphs to contain large expander subgraphs.

Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

In a series of papers the authors associated to an $L^2$-acyclic group $\Gamma$ an invariant $\mathcal{P}(\Gamma)$ that is a formal difference of polytopes in the vector space $H_1(\Gamma;\Bbb{R})$. This invariant is in particular defined…

The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…

The scramble number of a graph is an invariant recently developed to aid in the study of divisorial gonality. In this paper we prove that scramble number is NP-hard to compute, also providing a proof that computing gonality is NP-hard even…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

In this paper we determine the threshold for collapsibility in the probabilistic model $X_d(n,p)$ of $d$-dimensional simplicial complexes. A lower bound for this threshold $p=\frac{c_d}{n}$ was established in \cite{ALLM}. Here we show that…

We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ conditioned on triangle-freeness? Can we efficiently approximate the probability that $G(n,p)$…

A triangle group is denoted by $\Delta(p,q,r)$ and has finite presentation $$ \Delta(p,q,r)=\langle x,y | x^p=y^q=(xy)^r=1 \rangle .$$ We examine a method for composition of permutation representations of a triangle group $\Delta(p,q,r)$…

We prove that the random flag complex has a probability regime where the probability of nonvanishing homology is asymptotically bounded away from zero and away from one. Related to this main result we also establish new bounds on a sharp…

We prove for a $\Theta-$positive representation from a discrete subgroup $\Gamma\subset \mathsf{PSL}(2,\mathbb{R})$, the critical exponent for any $\alpha\in \Theta$ is not greater than one. When $\Gamma$ is geometrically finite, the…

Let $\Gamma$ be an $N\times n$ random matrix with independent entries and such that in each row entries are i.i.d. Assume also that the entries are symmetric, have unit variances, and satisfy a small ball probabilistic estimate uniformly.…

Let $\Lambda$ be the limiting smallest eigenvalue in the general (\beta, a)-Laguerre ensemble of random matrix theory. Here \beta>0, a >-1; for \beta=1,2,4 and integer a, this object governs the singular values of certain rank n Gaussian…

We consider the structure of finite $p$-groups $G$ having precisely three characteristic subgroups, namely $1$, $\Phi(G)$ and $G$. The structure of $G$ varies markedly depending on whether $G$ has exponent $p$ or $p^2$, and, in both cases,…