Related papers: Additive index and Carlitz rank
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…
Measure and integral are two closely related, but distinct objects of study. Nonetheless, they are both real-valued lattice valuations: order preserving real-valued functions $\phi$ on a lattice $L$ which are modular, i.e.,…
We study connections between classical asymptotic density and c.e. sets. We prove that a c.e. Turing degree d is not low if and only if d contains a c.e. set A of density 1 which has no computable subsets of density 1, giving a natural…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
Multi-task learning promises better model generalization on a target task by jointly optimizing it with an auxiliary task. However, the current practice requires additional labeling efforts for the auxiliary task, while not guaranteeing…
We go back to the roots of enriched category theory and study categories enriched in chain complexes; that is, we deal with differential graded categories (DG-categories for short). In particular, we recall weighted colimits and provide…
In contrast to entropy, which increases monotonically, the "complexity" or "interestingness" of closed systems seems intuitively to increase at first and then decrease as equilibrium is approached. For example, our universe lacked complex…
We provide new insights on eluder dimension, a complexity measure that has been extensively used to bound the regret of algorithms for online bandits and reinforcement learning with function approximation. First, we study the relationship…
Complex systems are found in most branches of science. It is still argued how to best quantify their complexity and to what end. One prominent measure of complexity (the statistical complexity) has an operational meaning in terms of the…
Downarowicz and Maass (2008) proposed topological ranks for all homeomorphic Cantor minimal dynamical systems using properly ordered Bratteli diagrams. In this study, we adopt this definition to the case of all essentially minimal…
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the…
Complex networks are characterized by heterogeneous distributions of the degree of nodes, which produce a large diversification of the roles of the nodes within the network. Several centrality measures have been introduced to rank nodes…
This is the second of a series of articles providing a foundation for the theory of Drinfeld modular forms of arbitrary rank. In the present part, we compare the analytic theory with the algebraic one that was begun in a paper of the third…
We classify locally finite joinings with respect to the Burger-Roblin measure for the action of a horospherical subgroup $U$ on $\Gamma \backslash G$, where $G = \operatorname{SO}(n,1)^\circ$ and $\Gamma$ is a convex cocompact and Zariski…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
The nature of concept learning is a core question in cognitive science. Theories must account for the relative difficulty of acquiring different concepts by supervised learners. For a canonical set of six category types, two distinct…
Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…
We prove detailed asymptotics for the number of spanning trees, called complexity, for a general class of discrete tori as the parameters tend to infinity. The proof uses in particular certain ideas and techniques from an earlier paper. Our…
We give a proof, based on the rigidity of tilting complexes, that the class of self-injective finite-dimensional algebras over an algebraically closed field is closed under derived equivalence.
Let $X$ and $Y$ be compact Hausdorff spaces, $E$ and $F$ be real or complex normed spaces and $A(X,E)$ be a subspace of $C(X,E)$. For a function $f\in C(X,E)$, let $\coz(f)$ be the cozero set of $f$. A pair of additive maps $S,T: A(X,E) \lo…