Solving a longstanding problem on equiangular lines, we determine, for each given fixed angle and in all sufficiently large dimensions, the maximum number of lines pairwise separated by the given angle. Fix 0<α<1. Let N_α(d) denote the maximum number of lines through the origin in R^d with pairwise common angle arccos α. Let k denote the minimum number (if it exists) of vertices in a graph whose adjacency matrix has spectral radius exactly (1−α)/(2α). If k<∞, then N_α(d)= ⌊ k(d−1)/(k−1) ⌋ for all sufficiently large d, and otherwise N_α(d)=d+o(d). In particular, N_{1/(2k−1)}(d)= ⌊ k(d−1)/(k−1) ⌋ for every integer k≥2 and all sufficiently large d. A key ingredient is a new result in spectral graph theory: the adjacency matrix of a connected bounded degree graph has sublinear second eigenvalue multiplicity.

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.

Persistent homology is constrained to purely topological persistence, while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for revealing topological persistence and extracting geometric shapes from high-dimensional datasets. For a point-cloud dataset, a filtration procedure is used to generate a sequence of chain complexes and associated families of simplicial complexes and chains, from which we construct persistent combinatorial Laplacian matrices. We show that a full set of topological persistence can be completely recovered from the harmonic persistent spectra, that is, the spectra that have zero eigenvalues, of the persistent combinatorial Laplacian matrices. However, non-harmonic spectra of the Laplacian matrices induced by the filtration offer another powerful tool for data analysis, modeling, and prediction. In this work, fullerene stability is predicted by using both harmonic spectra and non-harmonic persistent spectra, while the latter spectra are successfully devised to analyze the structure of fullerenes and model protein flexibility, which cannot be straightforwardly extracted from the current persistent homology. The proposed method is found to provide excellent predictions of the protein B-factors for which current popular biophysical models break down.

In this paper, we give a necessary and sufficient condition that discrete Morse functions on a digraph can be extended to be Morse functions on its transitive closure, from this we can extend the Morse theory to digraphs by using quasi-isomorphism between path complex and discrete Morse complex, we also prove a general sufficient condition for digraphs that the Morse functions satisfying this necessary and sufficient condition.

No abstract uploaded!

In this paper, we prove that discrete Morse functions on digraphs are flat Witten-Morse functions and Witten complexes of transitive digraphs approach to Morse complexes. We construct a chain complex consisting of the formal linear combinations of paths which are not only critical paths of the transitive closure but also allowed elementary paths of the digraph, and prove that the homology of the new chain complex is isomorphic to the path homology. On the basis of the above results, we give the Morse inequalities on digraphs.

No abstract uploaded!

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.

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.

Let $f(n)$ be the maximum number of edges in a graph on $n$ vertices in which no two cycles have the same length. In 1975, Erdos raised the problem of determining $f(n)$ (see J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, New York, 1976), p.247, Problem 11). Given a graph $H$, what is the maximum number of edges of a graph with $n$ vertices not containing $H$ as a subgraph? This number is denoted $ex(n,H)$, and is known as the Turan number. Erdos conjectured that there exists a positive constant $c$ such that $ex(n,C_{2k})\geq cn^{1+1/k}$(see P. Erdos, Some unsolved problems in graph theory and combinatorial analysis, Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969) , pp. 97--109, Academic Press, London, 1971). Haj\'{o}s conjectured that every simple even graph on $n$ vertices can be decomposed into at most $n/2$ cycles (see L. Lovasz, On covering of graphs, in: P. Erdos, G.O.H. Katona (Eds.), Theory of Graphs, Academic Press, New York, 1968, pp. 231 - 236 ). We present the problems, conjectures related to these problems and we summarize the know results.

No abstract uploaded!

We study the cluster algebras arising from cluster tubes with rank bigger than 1. Cluster tubes are 2−Calabi-Yau triangulated categories which contain no cluster tilting objects, but maximal rigid objects. Fix a certain maximal rigid object T in the cluster tube C_n of rank n. For any indecomposable rigid object M in C_n, we define an analogous X_M of Caldero-Chapton's formula (or Palu's cluster character formula) by using the geometric information of M. We show that X_M,X_{M′} satisfy the mutation formula when M,M′ form an exchange pair, and that X_? : M↦X_M gives a bijection from the set of indecomposable rigid objects in C_n to the set of cluster variables of cluster algebra of type C_{n−1}, which induces a bijection between the set of basic maximal rigid objects in C_n and the set of clusters. This strengths a surprising result proved recently by Buan-Marsh-Vatne that the combinatorics of maximal rigid objects in the cluster tube Cn encode the combinatorics of the cluster algebra of type B_{n−1} since the combinatorics of cluster algebras of type B_{n−1} or of type C_{n−1} are the same by a result of Fomin and Zelevinsky. As a consequence, we give a categorification of cluster algebras of type C.

Let G=(V,E) be a locally finite graph. Firstly, using calculus of variations, including a direct method of variation and the mountain-pass theory, we get sequences of solutions to several local equations on G (the Schrödinger equation, the mean field equation, and the Yamabe equation). Secondly, we derive uniform estimates for those local solution sequences. Finally, we obtain global solutions by extracting convergent sequence of solutions. Our method can be described as a variational method from local to global.

No abstract uploaded!

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.

We introduce and study mutation of torsion pairs, as a generalization of mutation of cluster tilting objects, rigid objects and maximal rigid objects. It is proved that any mutation of a torsion pair is again a torsion pair. A geometric realization of mutation of torsion pairs in the cluster category of type A_n or A_\infty is given via rotation of Ptolemy diagrams.

Inspired by works of Castéras (Pac J Math 276:321–345, 2015), Li and Zhu (Calc Var Partial Differ Equ 58:1–18, 2019), Sun and Zhu (Calc Var Partial Differ Equ 60:1–26, 2021), we propose a heat flow for the mean field equation on a connected finite graph G=(V,E). Namely ∂_tϕ(u)=Δu−Q+ρ\frac{e^u}{∫_V e^u dμ} u(⋅,0)=u_0, where Δ is the standard graph Laplacian, ρ is a real number, Q:V→R is a function satisfying ∫_V Qdμ=ρ, and ϕ:R→R is one of certain smooth functions including ϕ(s)=es. We prove that for any initial data u_0 and any ρ∈R, there exists a unique solution u:V×[0,+∞)→R of the above heat flow; moreover, u(x, t) converges to some function u_∞:V→R uniformly in x∈V as t→+∞, and u_∞ is a solution of the mean field equation Δu_∞−Q+ρ\frac{e^{u_∞}}{∫_V e^{u_∞}dμ}=0. Though G is a finite graph, this result is still unexpected, even in the special case Q≡0. Our approach reads as follows: the short time existence of the heat flow follows from the ODE theory; various integral estimates give its long time existence; moreover we establish a Lojasiewicz–Simon type inequality and use it to conclude the convergence of the heat flow.

We study a certain discrete differentiation of piecewise-constant functions on the adjoint of the braid hyperplane arrangement, defined by taking finite-differences across hyperplanes. In terms of Aguiar-Mahajan's Lie theory of hyperplane arrangements, we show that this structure is equivalent to the action of Lie elements on faces. We use layered binary trees to encode flags of adjoint arrangement faces, allowing for the representation of certain Lie elements by antisymmetrized layered binary forests. This is dual to the well-known use of (delayered) binary trees to represent Lie elements of the braid arrangement. The discrete derivative then induces an action of layered binary forests on piecewise-constant functions, which we call the forest derivative. Our main result states that forest derivatives of functions factorize as external products of functions precisely if one restricts to functions which satisfy the Steinmann relations, which are certain four-term linear relations appearing in the foundations of axiomatic quantum field theory. We also show that the forest derivative satisfies the Lie properties of antisymmetry the Jacobi identity. It follows from these Lie properties, and also crucially factorization, that functions which satisfy the Steinmann relations form a left comodule of the Lie cooperad, with the coaction given by the forest derivative. Dually, this endows the adjoint braid arrangement modulo the Steinmann relations with the structure of a Lie algebra internal to the category of vector species. This work is a first step towards describing new connections between Hopf theory in species and quantum field theory.

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.

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

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!