F. Labourie [arXiv:1212.5015] characterized the Hitchin components for PSL(n,R) for any n>1 by using the swapping algebra, where the swapping algebra should be understood as a ring equipped with a Poisson bracket. We introduce the rank n swapping algebra, which is the quotient of the swapping algebra by the (n+1)×(n+1) determinant relations. The main results are the well-definedness of the rank n swapping algebra and the "cross-ratio" in its fraction algebra. As a consequence, we use the sub fraction algebra of the rank n swapping algebra generated by these "cross-ratios" to characterize the PSL(n,R) Hitchin component for a fixed n>1. We also show the relation between the rank 2 swapping algebra and the cluster X space.

A simplicial complex Δ is called$flag$if all minimal nonfaces of Δ have at most two elements. The following are proved: First, if Δ is a flag simplicial pseudomanifold of dimension$d$−1, then the graph of Δ (i) is (2$d$−2)-vertex-connected and (ii) has a subgraph which is a subdivision of the graph of the$d$-dimensional cross-polytope. Second, the$h$-vector of a flag simplicial homology sphere Δ of dimension$d$−1 is minimized when Δ is the boundary complex of the$d$-dimensional cross-polytope.

No abstract uploaded!

No abstract uploaded!

In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph with $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+\frac{107}{3}t+\frac{7}{3}$$ for $t=1260r+169 \,\ (r\geq 1)$ and $n \geq \frac{2119}{4}t^{2}+87978t+\frac{15957}{4}$. Consequently, $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + \frac{7654}{19071}},$ which is better than the previous bounds $\sqrt 2$ (Shi, 1988), $\sqrt {2.4}$ (Lai, 2003). The conjecture $\lim_{n \rightarrow \infty} {f(n)-n\over \sqrt n}=\sqrt {2.4}$ is not true.

We derive bounds for eigenvalues of the Laplacian of graphs using discrete versions of the Sobolev inequalities and heat kernel estimates.

In 1975, P. Erd\"{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph of $n$ vertices in which any two cycles are of different lengths. In this paper, it is proved that $$f(n)\geq n+36t$$ for $t=1260r+169 \,\ (r\geq 1)$ and $n \geq 540t^{2}+\frac{175811}{2}t+\frac{7989}{2}$. Consequently, $\liminf\sb {n \to \infty} {f(n)-n \over \sqrt n} \geq \sqrt {2 + {2 \over 5}},$ which is better than the previous bounds $\sqrt 2$ (see [2]), $\sqrt {2+{2562\over 6911}}$ (see [7]).

No abstract uploaded!

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by$δ$are called$δ$-$uniform$. The search for such bounds is motivated by their potential applicability to hardness of approximation, derandomization, and additive combinatorics.

No abstract uploaded!