Related papers: Metrics on trees I. The tower algorithm for interv…
We use model theory of metric structures to prove the pointwise convergence, with a uniform metastability rate, of averages of a polynomial sequence $\{T_n\}$ (in Leibman's sense) of unitary transformations of a Hilbert space. As a special…
A fast method is presented for computing the topological entropy of braids on the torus. This work is motivated by the need to analyze large braids when studying two-dimensional flows via the braiding of a large number of particle…
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist for trees.…
We consider a class of simple one parameter families of interval maps, and we study how metric (resp. topological) entropy changes as the parameter varies. We show that in many cases the entropy displays a semi-regular behaviour, i.e. it is…
We study Markov multi-maps of the interval from the point of view of topological dynamics. Specifically, we investigate whether they have various properties, including topological transitivity, topological mixing, dense periodic points, and…
Motivated by applications to spaces of embeddings and automorphisms of manifolds, we consider a tower of $\infty$-categories of truncated right-modules over a unital $\infty$-operad $\mathcal{O}$. We study monoidality and naturality…
Recent advances in cutting-plane strategies applied to robust optimization problems show that they are competitive with respect to problem reformulations and interior-point algorithms. However, although its application with polyhedral…
In this paper we present a combinatorial machinery, consisting of a graph tower $\overleftarrow \Gamma$ and vector towers $\overleftarrow v$ on $\overleftarrow \Gamma$, which allows us to efficiently describe all invariant measures $\mu =…
Now a days many algorithms are invented or being inventing to find the solution for Euclidean Minimum Spanning Tree, EMST, problem, as its applicability is increasing in much wide range of fields containing spatial or spatio temporal data…
The structure of interstellar medium can be characterised at large scales in terms of its global statistics (e.g. power spectra) and at small scales by the properties of individual cores. Interest has been increasing in structures at…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.
We study continuous countably piecewise monotone interval maps, and formulate conditions under which these are conjugate to maps of constant slope, particularly when this slope is given by the topological entropy of the map. We confine our…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
In aperiodic order, non-periodic but "ordered" objects such as tilings, Delone sets, functions and measures are investigated. In this article we depict the common structure of these objects by using the general framework of abstract pattern…
We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…
In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators of persistent homology. This estimation…
It has been known for some time that the topological entropy is a nondecreasing function of the parameter in the real quadratic family, which corresponds to the intuitive idea that more nonlinearity induces more complex dynamical behavior.…
We investigate the calibration of estimations to increase performance with an optimal monotone transform on the estimator outputs. We start by studying the traditional square error setting with its weighted variant and show that the optimal…
We give a hierarchy of many-parameter families of maps of the interval [0,1] with an invariant measure and using the measure, we calculate Kolmogorov--Sinai entropy of these maps analytically. In contrary to the usual one-dimensional maps…