相关论文: A note of Zuk's criterion

We provide a full and rigorous proof of a theorem attributed to \.Zuk, stating that random groups in the Gromov density model for d > 1/3 have property (T) with high probability. The original paper had numerous gaps, in particular, crucial…

Property (T) for groups means a dichotomy: a representation either has an invariant vector or all vectors are far from being invariant. We show that, under a stronger condition of A.Zuk, a similar dichotomy holds for almost representations…

For any function that is real for real x, positivity of Tuck's function Q(x)=D'^2(x)/(D'^2(x)-D"(x) D(x)) is a condition for the absence of the complex zeros close to the real axis. Study of the probability distribution P(Q), for D(x) with…

We prove a Banach version of \.Zuk's criterion for groups acting on partite simplicial complexes. Using this new criterion we derive a new fixed point theorem for random groups in the Gromov density model with respect to several classes of…

We prove several Littlewood-Offord type inequalities for arbitrary groups. In groups having elements of finite order the worst case scenario is provided by the simple random walk on a certain cyclic subgroup. The inequalities we obtain are…

We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct…

We establish a lower bound on the spectral gap of the Laplace operator on special linear groups using conic optimisation. In particular, this provides a constructive (but computer assisted) proof that these groups have Kazhdan property (T).…

We prove that every sofic approximation of a property (T) group is approximately isomorphic to one having geometric property (T), and more generally, a box space of graphs which has boundary geometric property (T) is approximately…

We describe a simple criterion for showing that a group has Serre's property FA. By exhibiting a certain pattern of finite subgroups, we show that this criterion is satisfied by Aut(F_n) and SL(n,Z) when n>=3.

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…

We prove that the universal lattices -- the groups $G=\SL_d(R)$ where $R=\Z[x_1,...,x_k]$, have property $\tau$ for $d\geq 3$. This provides the first example of linear groups with $\tau$ which do not come from arithmetic groups. We also…

We obtain a tail bound for the least non-zero singular value of $A-z$ when $A$ is a random matrix and $z$ is an eigenvalue of $A$ in a neighbourhood of a given point $z_0$ in the bulk of the spectrum. The argument relies on a resolvent…

In this paper the limit probabilities of first-order properties are studied. The random graph $G(n,p)$ {\it obeys Zero-One $k$-Law} if for each first-order property with quantifier depth not greater than $k$ its probability tends to 0 or…

We establish a new characterization of property (T) in terms of the Furstenberg entropy of nonsingular actions. Given any generating measure $\mu$ on a countable group $G$, A. Nevo showed that a necessary condition for $G$ to have property…

We study a general transition operator, generated by a random walk on a graph $X$; in particular we give necessary and sufficient condition on the matrix coefficient (1-step transition probablilities) to be a bounded operator from…

D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic…

Let $q_{\min}(G)$ stand for the smallest eigenvalue of the signless Laplacian of a graph $G$ of order $n.$ This paper gives some results on the following extremal problem: How large can $q_\min\left( G\right) $ be if $G$ is a graph of order…

A graph $G$ is called $k$-factor-critical if after deleting any $k$ vertices the remaining subgraph still has a perfect matching. Fan and Lin [Adv. in Appl. Math. 174 (2026) 103019] posed an adjacency spectral condition for a graph with…

Let $G$ be a simple graph with $n$ vertices and $e(G)$ edges, and $q_1(G)\geq q_2(G)\geq\cdots\geq q_n(G)\geq0$ be the signless Laplacian eigenvalues of $G.$ Let $S_k^+(G)=\sum_{i=1}^{k}q_i(G),$ where $k=1, 2, \ldots, n.$ F. Ashraf et al.…

Let $\mathcal{T}_{\frac{k}{r}}$ denote the set of trees $T$ such that $i(T-S)\leq\frac{k}{r}|S|$ for any $S\subset V(T)$ and for any $e\in E(T)$ there exists a set $S^{*}\subset V(T)$ with $i((T-e)-S^{*})>\frac{k}{r}|S^{*}|$, where $r<k$…