Related papers: Complexity and heights of tori
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
Let $K$ be a non-archimedean local field. In the local Langlands correspondence for tori over $K$, we prove an asymptotic result for the depths.
In this paper, we study the abelian complexity of the Rudin-Shapiro sequence and a related sequence. We show that these two sequences share the same complexity function $\rho(n)$ which satisfies certain recurrence relations. As a…
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…
The polytopic definition introduced recently describing the topology of manifolds is used to formulate a generating function pertinent to its topological properties. In particular, a polynomial in terms of one variable and a tori underlying…
We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…
The main result of this paper is that the isomorphism for omega-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov,…
Let $\A$ be a finite dimensional vector space and $\Phi$ be a finite root system in $\A$. To this data is associated an affine poly-simplicial complex. Motivated by a forthcoming construction of connectified higher buildings, we study…
Asymptotic tensor rank is notoriously difficult to determine. Indeed, determining its value for the $2\times 2$ matrix multiplication tensor would determine the matrix multiplication exponent, a long-standing open problem. On the other…
We construct monotone Lagrangian tori in the standard symplectic vector space, in the complex projective space and in products of spheres. We explain how to classify these Lagrangian tori up to symplectomorphism and Hamiltonian isotopy, and…
We study the related notions of curvature and perimeter for toric boundaries and their implications for symplectic packing problems; a natural setting for this is a generalized version of convex toric domain which we also study, where there…
Random increasing k-trees represent an interesting, useful class of strongly dependent graphs for which analytic-combinatorial tools can be successfully applied. We study in this paper a notion called connectivity-profile and derive…
We study the derived category of pseudo-coherent complexes over a noetherian commutative ring, building on prior work by Matsui-Takahashi. Our main theorem is a computation of the Balmer spectrum of this category in the case of a discrete…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
A cohomology class u of a topological space X is atoroidal if its pullback to the torus vanishes for every map from a torus to X. Furthermore, X is atoroidally symplectic if there is an atoroidal cohomology class $u\in H^2(X;F)$ such that…
We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.
We endow the set of persistence diagrams with the strong topology (the topology of countable direct limit of increasing sequence of bounded subsets considered in the bottleneck distance). The topology of the obtained space is described.…