On the dimension growth of groups

Dimension growth functions of groups have been introduced by Gromov in 1999. We prove that every solvable finitely generated subgroups of the R. Thompson group $F$ has polynomial dimension growth while the group $F$ itself, and some solvable groups of class 3 have exponential dimension growth with exponential control. We describe connections between dimension growth, expansion properties of finite graphs and the Ramsey theory.Comment: 20 pages; v3: Erratum and addendum included as Section 9. We can only prove that the lower bound of the dimension growth of $F$ is exp sqrt(n). New open questions and comments are added. v4: The paper is completely revised. Dimension growth with control is introduced, connections with graph expansion and Ramsey theory are include

Nonlinear spectral calculus and super-expanders

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 sub-multiplicatively under zigzag products. These results yield a combinatorial construction of super-expanders, i.e., a sequence of 3-regular graphs that does not admit a coarse embedding into any uniformly convex normed space.Comment: Typos fixed based on referee comments. Some of the results of this paper were announced in arXiv:0910.2041. The corresponding parts of arXiv:0910.2041 are subsumed by the current pape

Hardness of Graph Pricing through Generalized Max-Dicut

The Graph Pricing problem is among the fundamental problems whose approximability is not well-understood. While there is a simple combinatorial 1/4-approximation algorithm, the best hardness result remains at 1/2 assuming the Unique Games Conjecture (UGC). We show that it is NP-hard to approximate within a factor better than 1/4 under the UGC, so that the simple combinatorial algorithm might be the best possible. We also prove that for any $\epsilon > 0$, there exists $\delta > 0$ such that the integrality gap of $n^{\delta}$-rounds of the Sherali-Adams hierarchy of linear programming for Graph Pricing is at most 1/2 + $\epsilon$. This work is based on the effort to view the Graph Pricing problem as a Constraint Satisfaction Problem (CSP) simpler than the standard and complicated formulation. We propose the problem called Generalized Max-Dicut($T$), which has a domain size $T + 1$ for every $T \geq 1$. Generalized Max-Dicut(1) is well-known Max-Dicut. There is an approximation-preserving reduction from Generalized Max-Dicut on directed acyclic graphs (DAGs) to Graph Pricing, and both our results are achieved through this reduction. Besides its connection to Graph Pricing, the hardness of Generalized Max-Dicut is interesting in its own right since in most arity two CSPs studied in the literature, SDP-based algorithms perform better than LP-based or combinatorial algorithms --- for this arity two CSP, a simple combinatorial algorithm does the best.Comment: 28 page

Discrete Geometry

[no abstract available