相关论文: Kazhdan's Property (T) for Graphs

We investigate connections between various rigidity and softness properties for discrete quantum groups. After introducing a notion of residual finiteness, we show that it implies the Kirchberg factorization property for the discrete…

For non-amenable finitely generated virtually free groups, we show that the combinatorial Euler characteristic introduced by Emerson and Meyer is the preimage of the K-theory class of higher Kazhdan projections under the Baum-Connes…

We investigate properties of families $F$ of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any $A\notin F$, there is such set $A'\in F$ that either $A\subset A'$ or…

Let $A$ be a finite-dimensional gentle algebra over an algebraically closed field. We investigate the combinatorial properties of support $\tau$-tilting graph of $A$. In particular, it is proved that the support $\tau$-tilting graph of $A$…

Let $\Theta(G)$ denote the Shannon capacity of a graph $G$. We give an elementary proof of the equivalence, for any graphs $G$ and $H$, of the inequalities $\Theta(G\sqcup H)>\Theta(G)+\Theta(H)$ and $\Theta(G\boxtimes…

We set out some general criteria to prove the K-property, refining the assumptions used in arXiv:1906.09315 for the flow case, and introducing the analogous discrete-time result. We also introduce one-sided $\lambda$-decompositions, as well…

We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

We prove the Haagerup property (= Gromov's a-T-menability) for finitely generated groups defined by infinite presentations satisfying the graphical C'(lambda)-small cancellation condition with respect to graphs endowed with a compatible…

Property A is a form of weak amenability for groups and metric spaces introduced as an approach to the famous Novikov higher signature conjecture, one of the most important unsolved problems in topology. We show that property A can be…

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

We survey the relationship between the combinatorics and geometry of graphs and the algebraic structure of right-angled Artin groups. We concentrate on the defining graph of the right-angled Artin group and on the extension graph associated…

Let $G$ be a split connected reductive group defined over $\mathbb{Z}$. Let $F$ be a locally compact non-Archimedean field with residue characteristic $p$. For a locally compact non-Archimedean field $F'$ that is sufficiently close to $F$,…

We study the properties of a generic object $\mathbb{P}$ in the category of finite graphs. It turns out that this object, being topologically a Cantor set, has the Knaster--Reichbach type property. Namely, every homeomorphism and…

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

We give bounds on Kazhdan constants of abelian extensions of (finite) groups. As a corollary, we improved known results of Kazhdan constants for some meta-abelian groups and for the relatively free group in the variety of $p$-groups of…

In this paper, motivated by our previous work \cite{HY}, we prove that the minimum of the first Dirichlet eigenvalues for the normalized combinatorial $p$-Laplacian on connected finite graphs with boundary consisting of $n$ edges is only…

We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…

We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…

We exhibit an obstruction for groups with Relative Property (T) to act on the real line by bi-Lipschitz homeomorphisms. This condition is expressed in terms of the Lipschitz and Kazhdan constants associated to finite generating subsets. As…