Related papers: Complexity and heights of tori
A "simple trace formula" is used to derive an asymptotic result for class numbers of complex cubic orders.
We study the complexity of horizontality in the twistor space $\hat{E}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over a torus. If the horizontality has finite complexity of degree $d>2$ for…
We study a general model of random dynamical simplicial complexes and derive a formula for the asymptotic degree distribution. This asymptotic formula encompasses results for a number of existing models, including random Apollonian networks…
The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…
We present a new probabilistic proof of Otter's asymptotic formula for the number of unlabelled trees with a given number of vertices. We additionally prove a new approximation result, showing that the total variation distance between…
The vertices of the Cayley graph of a finitely generated semigroup form a set of sites which can be labeled by elements of a finite alphabet in a manner governed by a nonnegative real interaction matrix, respecting nearest neighbor…
We show that if a closed oriented $n$-manifold $M$ has a non-trivial cohomology class of even degree $k$, whose all pullbacks to products of type $S^1\times N$ vanish, then the topological complexity $\mathrm{TC}(M)$ is at least $6$, if $n$…
Let $D$ be a connected weighted digraph. The relation between the vertex weighted complexity (with a fixed root) of the line digraph of $D$ and the edge weighted complexity (with a fixed root) of $D$ has been given in (L. Levine, Sandpile…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…
Within the framework of generalized combinatorial approach, complexity is determined as a disorder measure for hierarchical statistical ensembles related to Cayley trees possessing arbitrary branching and number of levels. With…
The celebrated formula of Otter \emph{[Ann. of Math. (2) 49 (1948), 583--599]} asserts that the complete graph contains exponentially many non-isomorphic spanning trees. In this paper, we show that every connected almost regular graph with…
In the present paper, we investigate a family of circulant graphs with non-fixed jumps $$G_n=C_{\beta n}(s_1, \ldots,s_k,\alpha_1n,\ldots,\alpha_\ell n),\, 1\le s_1<\ldots<s_k\le[\frac{\beta n}{2}],\, 1\le \alpha_1<…
We study tori attached to the fundamental groups of plane curves with arbitrary singularities. These tori provide complete information about homology of finite abelian covers of the plane branched along the curve. We calculate these tori in…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
Two results (together with their relatively elementary proofs) are presented. The first one presents the upper boundary on the number of spanning trees in a finite planar multigraph, proving that the complexity (the number of spanning…
One of the themes in algebraic geometry is the study of the relation between the ``topology'' of a smooth projective variety and a (``general'') hyperplane section. Recent results of Nori produce cohomological evidence for a conjecture that…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
We compute the complexity of two infinite families of finite graphs: the Sierpi\'{n}ski graphs, which are finite approximations of the well-known Sierpi\'nsky gasket, and the Schreier graphs of the Hanoi Towers group $H^{(3)}$ acting on the…