Related papers: Additive index and Carlitz rank
We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $\epsilon > 0$, with word complexity $p$ satisfying $\limsup \frac{p(q)}{q} < 1.5 + \epsilon$. For arbitrary $f(q) \to \infty$, said subshifts can be made to…
The article investigates the possibility of measuring the strength of a linear correlation relationship between nominal data and numerical data. Correlation coefficients for variables coded with real numbers as well as for variables coded…
We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differentiable function is an ordinal less than omega_1 which measures how complex it is to verify…
Measures of rank correlation are commonly used in statistics to capture the degree of concordance between two orderings of the same set of items. Standard measures like Kendall's tau and Spearman's rho coefficient put equal emphasis on each…
We prove that the multiplicity of an arbitrary dominant weight for an integrable highest weight representation of the affine Kac-Moody algebra $A_{r}^{(1)}$ is a polynomial in the rank $r$. In the process we show that the degree of this…
In this review paper we study non-compact operators and embeddings between function spaces, highlighting interesting phenomena and the significance of Bernstein numbers. In particular, we demonstrate that for non-compact maps the usual…
We confront two integrability criteria for rational mappings. The first is the singularity confinement based on the requirement that every singularity, spontaneously appearing during the iteration of a mapping, disappear after some steps.…
Cluster algebras are categorified by cluster categories, and $g$-vectors are categorified by the classic index with respect to cluster tilting subcategories. However, the recently introduced completed discrete cluster categories of Dynkin…
Some established and also novel techniques in the field of applications of algorithmic (Kolmogorov) complexity currently co-exist for the first time and are here reviewed, ranging from dominant ones such as statistical lossless compression…
Integrated time-slice correlation functions $G(t)$ with weights $K(t)$ appear, e.g., in the moments method to determine $\alpha_s$ from heavy quark correlators, in the muon g-2 determination or in the determination of smoothed spectral…
When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge…
We extend previously proposed measures of complexity, emergence, and self-organization to continuous distributions using differential entropy. This allows us to calculate the complexity of phenomena for which distributions are known. We…
We compared entropy for texts written in natural languages (English, Spanish) and artificial languages (computer software) based on a simple expression for the entropy as a function of message length and specific word diversity. Code text…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…
Several real-world systems can be represented as multi-layer complex networks, i.e. in terms of a superposition of various graphs, each related to a different mode of connection between nodes. Hence, the definition of proper mathematical…
Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…
Let $\overline{k}$ be a fixed algebraic closure of $k$. When the finite place $v$ is of degree one, we show that all $\overline{k}$-linear relations among $v$-adic Carlitz multiple polylogarithms at algebraic points arise from $k$-linear…
Given a closed orientable surface (\Sigma) of genus at least two, we establish an affine isomorphism between the convex compact set of isotopy-invariant topological measures on (\Sigma) and the convex compact set of additive functions on…