相关论文: Effective Mixing and Counting in Bruhat-Tits Trees

If X is a proper CAT(-1)-space and $\Gamma$ a non-elementary discrete group of isometries acting properly discontinuously on X, it is shown that the geodesic flow on the quotient space Y=X/$\Gamma$ is topologically mixing, provided that the…

The arboreal gas is the random (unrooted) spanning forest of a graph in which each forest is sampled with probability proportional to $\beta^{\# \text{edges}}$ for some $\beta\geq 0$, which arises as the $q\to 0$ limit of the…

We prove that if $N\ge 2$ and $\alpha: F_N\to \pi_1(\Gamma)$ is a marking on $F_N$, then for any integer $r\ge 2$ and any $F_N$-invariant collection of non-negative integral "weights" associated to all subtrees $K$ of $\widetilde \Gamma$ of…

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

A compact graph rule for the effective action $\Gamma[\phi]$ of a local composite operator is given in this paper. This long-standing problem of obtaining $\Gamma[\phi]$ in this case is solved directly without using the auxiliary field. The…

The isotrivial Mordell-Lang theorem of Moosa and Scanlon describes the set $X\cap\Gamma$ when $X$ is a subvariety of a semiabelian variety $G$ over a finite field $\mathbb{F}_q$ and $\Gamma$ is a finitely generated subgroup of $G$ that is…

The trace set of a Fuchsian group $\Gamma$ ist the set of length of closed geodesics in the surface $\Gamma \backslash \mathbb{H}$. Luo and Sarnak showed that the trace set of a cofinite arithmetic Fuchsian group satisfies the bounded…

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every…

We prove a generalised Yuan--Hunt--Ma\~n\'e Conjecture: if $\mathcal{F}$ is the Banach space of $\alpha$-H\"older functions, and $\mathcal{T}$ is either a space of Lipschitz expanding maps, or of Anosov diffeomorphisms, or the family of…

Suppose that G is a compact Abelian topological group, m is the Haar measure on G and f is a measurable function. Given (n_k), a strictly monotone increasing sequence of integers we consider the nonconventional ergodic/Birkhoff averages…

Let $G$ be a semiabelian variety defined over an algebraically closed field $K$, endowed with a rational self-map $\Phi$. Let $\alpha\in G(K)$ and let $\Gamma\subseteq G(K)$ be a finitely generated subgroup. We show that the set…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…

We study the computational complexity of approximately counting the number of independent sets of a graph with maximum degree Delta. More generally, for an input graph G=(V,E) and an activity lambda>0, we are interested in the quantity…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

For a locally finite graph $\Gamma$, we consider its mapping class group $\text{Map}(\Gamma)$ as defined by Algom-Kfir-Bestvina. For these groups, we prove a generalization of the results of Laudenbach and Brendle-Broaddus-Putman, producing…

We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…