相关论文: Stable commutator length in right-angled Artin and…
In this paper we study the classification of right-angled Artin groups up to commensurability. We characterise the commensurability classes of RAAGs defined by trees of diameter 4. In particular, we prove a conjecture of Behrstock and…
Nonlinear spectral gaps with respect to uniformly convex normed spaces are shown to satisfy a spectral calculus inequality that establishes their decay along Cesaro averages. Nonlinear spectral gaps of graphs are also shown to behave…
We study the structure and compute the stable rank of C*-algebras of finite higher-rank graphs. We completely determine the stable rank of the C*-algebra when the k-graph either contains no cycle with an entrance, or is cofinal. We also…
A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow; both cooperative and noncooperative…
Consider the ring $R:=\Q[\tau,\tau^{-1}]$ of Laurent polynomials in the variable $\tau$. The Artin's Pure Braid Groups (or Generalized Pure Braid Groups) act over $R,$ where the action of every standard generator is the multiplication by…
We show that formal eigenvalue equations of analytic one-frequency Schr\"od-inger operators admit intrinsic analytic $Sp(2k,\C)$ structures, where $k=k(E)$ is the T-acceleration in global theory. For trigonometric potentials those…
The aim of this paper is to study the spectral gap and the logarithmic Sobolev constant for continuous spin systems. A simple but general result for estimating the spectral gap of finite dimensional systems is given by Theorem 1.1, in terms…
We give an algorithm to compute stable commutator length in free products of cyclic groups which is polynomial time in the length of the input, the number of factors, and the orders of the finite factors. We also describe some experimental…
We consider rectangular graph superlattices of sides l1, l2 with the wavefunction coupling at the junctions either of the delta type, when they are continuous and the sum of their derivatives is proportional to the common value at the…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…
We show that every right-angled Artin group AG defined by a graph G of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of G. Further, a characterization of all…
One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function…
We prove that a distance-regular graph with a dominant distance is a spectral expander. The key ingredient of the proof is a new inequality on the intersection numbers. We use the spectral gap bound to study the structure of the…
We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…
Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
The center $\mathscr{Z}_n(q)$ of the integral group algebra of the general linear group $GL_n(q)$ over a finite field admits a filtration with respect to the reflection length. We show that the structure constants of the associated graded…
We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally…
Finding the multiplicity of cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. Recently, Blake and Lin computed the number of shortest…