Related papers: Complexity and heights of tori
We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…
We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
A result of Lehrer describes a beautiful relationship between topological and combinatorial data on certain families of varieties with actions of finite reflection groups. His formula relates the cohomology of complex varieties to point…
In this paper, we study the structure of the complete asymptotic expansion of the probability that a large combinatorial object is connected or consists of a given number of connected components. For rapidly growing labeled families of…
In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the…
We introduce amorphic complexity as a new topological invariant that measures the complexity of dynamical systems in the regime of zero entropy. Its main purpose is to detect the very onset of disorder in the asymptotic behaviour. For…
The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…
To any integer matrix $A$ one can associate a matroid structure consisting of a graph and another integer matrix $A_B$. The connected components of this graph are called bouquets. We prove that bouquets behave well with respect to the…
In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological…
A hypertree, or $\mathbb{Q}$-acyclic complex, is a higher-dimensional analogue of a tree. We study random $2$-dimensional hypertrees according to the determinantal measure suggested by Lyons. We are especially interested in their…
The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial…
We give a general procedure for gluing together possibly noncompact manifolds of constant scalar curvature which satisfy an extra nondegeneracy hypothesis. Our aim is to provide a simple paradigm for making `analytic' connected sums. In…
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. The Wiener complexity of $G$ is the number of different transmissions of its vertices. Similarly, the eccentric complexity of…
Tensor parameters that are amortized or regularized over large tensor powers, often called "asymptotic" tensor parameters, play a central role in several areas including algebraic complexity theory (constructing fast matrix multiplication…
This is an elementary presentation of the arithmetic of trees. We show how it is related to the Tamari poset. In the last part we investigate various ways of realizing this poset as a polytope (associahedron), including one inferred from…
In the present paper a behavior of the "average case" approximation complexity for d-parametric random fields of tensor-type is studied. It was shown in [Lifshits and Tulyakova, 2006] that for a given approximation accuracy level the…
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…
These lecture notes are intended as an introduction to several notions of tensor rank and their connections to the asymptotic complexity of matrix multiplication. The latter is studied with the exponent of matrix multiplication, which will…