Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. Erd\"{o}s raised the problem of determining $f(n)$. Erd\"{o}s conjectured that there exists a positive constant $c$ such that $ex(n,C_{2k})\geq cn^{1+1/k}$. Haj\'{o}s conjecture that every simple even graph on $n$ vertices can be decomposed into at most $n/2$ cycles. We present the problems, conjectures related to these problems and we summarize the know results. We do not think Haj\'{o}s conjecture is true.

No abstract uploaded!

An analogue of the well-known $$ \frac{3}{{16}} $$ lower bound for the first eigenvalue of the Laplacian for a congruence hyperbolic surface is proven for a congruence tower associated with any non-elementary subgroup$L$of SL(2,$Z$). The proof in the case that the Hausdorff of the limit set of$L$is bigger than $$ \frac{1}{2} $$ is based on a general result which allows one to transfer such bounds from a combinatorial version to this archimedian setting. In the case that delta is less than $$ \frac{1}{2} $$ we formulate and prove a somewhat weaker version of this phenomenon in terms of poles of the corresponding dynamical zeta function. These “spectral gaps” are then applied to sieving problems on orbits of such groups.

The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let T(n,D
l) be the tree which minimizes the spectral radius of all trees of order n with exactly l vertices of maximum degree D
. In this paper, T(n,D
l) is determined for D=3, and for l<= 3 and n large enough. It is proven that for sufficiently large n, T(n, 3, l) is a caterpillar with (almost) uniformly distributed legs, T(n,D
2) is a dumbbell, and T(n,
D,3) is a tree consisting of three distinct stars of order D
connected by three disjoint paths of (almost) equal length from their centers to a common vertex. The unique tree with the largest spectral radius among all such trees is also determined. These extend earlier results of Lov´asz and Pelik´an, Simi´c and To˘si´c, Wu, Yuan and Xiao, and Xu, Lin and Shu.

In the first part of this paper, we study Koszul property of directed graded categories. In the second part of this paper, we prove a general criterion for an infinite directed category to be Koszul. We show that infinite directed categories in the theory of representation stability are Koszul over a field of characteristic zero

It is known that finitely generated FI-modules over a field of characteristic 0 are Noetherian. We generalize this result to the abstract setting of an infinite EI category satisfying certain combinatorial conditions.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

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.

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.

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]).

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy invariance of homologies of digraphs and the relation between the fundamental group of the digraph and its first homology group. The category of (undirected) graphs can be identified by a natural way with a full subcategory of digraphs. Thus we obtain also consistent homology and homotopy theories for graphs.

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.

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!

No abstract uploaded!

Szemerédi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that the desired vertex partition in the regularity lemma is equitable has a minimal effect on the number of parts of the partition. Second, we use an algorithmic version of the (weak) Frieze–Kannan regularity lemma to give a substantially faster deterministic approximation algorithm for counting subgraphs in a graph. Previously, only an exponential dependence for the running time on the error parameter was known, and we improve it to a polynomial dependence. Third, we revisit the problem of finding an algorithmic regularity lemma, giving approximation algorithms for several co-NP-complete problems. We show how to use the weak Frieze–Kannan regularity lemma to approximate the regularity of a pair of vertex subsets. We also show how to quickly find, for each ε′>ε, an ε′-regular partition with k parts if there exists an ε-regular partition with k parts. Finally, we give a simple proof of the permutation regularity lemma which improves the tower-type bound on the number of parts in the previous proofs to a single exponential bound.

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

No abstract uploaded!

No abstract uploaded!

We compute a momentum space version of the entanglement spectrum and entanglement entropy of general Young tableau states, and one-point functions on Young tableau states. These physical quantities are used to measure the topology of the dual spacetime geometries in the context of gauge/gravity correspondence. The idea that Young tableau states can be obtained by superposing coherent states is explicitly verified. In this quantum superposition, a topologically distinct geometry is produced by superposing states dual to geometries with a trivial topology. Furthermore we have a refined bound for the overlap between coherent states and the rectangular Young tableau state, by using the techniques of symmetric groups and representations. This bound is exponentially suppressed by the total edge length of the Young tableau. It is also found that the norm squared of the overlaps is bounded above by inverse powers of the exponential of the entanglement entropies. We also compute the overlaps between Young tableau states and other states including squeezed states and multi-mode entangled states which have similarities with those appeared in quantum information theory.

No abstract uploaded!

In 1975, P. Erdő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+32t-1$ for $t=27720r+169\ (r\geq 1)$ and $n\geq\frac{6911}{16}t^2+\frac{514441}{8}t-\frac{3309665}{16}$ . Consequently, $\liminf_{n\to\infty}\frac{f(n)-n}{\sqrt n}\geq\sqrt{2+\frac{2562}{6911}}$ .