相关论文: KL-randomness and effective dimension under strong…

The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…

A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complexity and the binary expansions of a very specific subset of…

We study the distribution of Mahler's measures of reciprocal polynomials with complex coefficients and bounded even degree. We discover that the distribution function associated to Mahler's measure restricted to monic reciprocal polynomials…

This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…

We suggest new recursive formulas to compute the exact value of the Kullback-Leibler distance (KLD) between two general Hidden Markov Trees (HMTs). For homogeneous HMTs with regular topology, such as homogeneous Hidden Markov Models (HMMs),…

The Lichtenbaum-Quillen conjecture for smooth complex varieties states that algebraic and topological K-theory with finite coefficients become isomorphic in high degrees. We define the "Lichtenbaum-Quillen dimension" of a variety in terms…

Let L be a finite-dimensional simple Lie algebra over an algebraically closed field of F characteristic p>3. We prove that if the p-envelope of L in the derivation algebra of L contains nonstandard tori of maximal dimension, then p=5 and L…

We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures…

Let $\mathcal K=\langle\mathcal R, \delta\rangle$ be a closed ordered differential field, in the sense of M. Singer, and $C$ its field of constants. In this note, we prove that, for sets definable in the pair $\mathcal M=\langle \mathcal R,…

We formulate a positivity conjecture relating the Verlinde ring associated with an untwisted affine Lie algebra at a positive integer level and a subcategory of finite-dimensional representations over the corresponding quantum affine…

We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…

In this paper, we study the statistical and geometrical properties of the Kullback-Leibler divergence with kernel covariance operators (KKL) introduced by Bach [2022]. Unlike the classical Kullback-Leibler (KL) divergence that involves…

For k a field of arbitrary characteristic, and R a k-algebra, we show that the PI degree of an iterated skew polynomial ring R[x_1;\tau_1,\delta_1]...b[x_n;\tau_n,\delta_n] agrees with the PI degree of R[x_1;\tau_1]...b[x_n;\tau_n] when…

In this thesis we study algebraic structures in M-theory, in particular the exceptional Lie algebras arising in dimensional reduction of its low energy limit, eleven-dimensional supergravity. We focus on e8 and its infinite-dimensional…

Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…

In a recent paper, Hauenstein, Sturmfels, and the second author discovered a conjectural bijection between critical points of the likelihood function on the complex variety of matrices of rank r and critical points on the complex variety of…

We introduce a class of recursions defined over the $d$-dimensional integer lattice. The discrete equations we study are interpreted as higher dimensional extensions to the discrete Toda lattice equation. We shall prove that the equations…

We compute numerically the dimensions of the graded quotients of the linearized Kashiwara-Vergne Lie algebra lkv in low weight, confirming a conjecture of Raphael-Schneps in those weights. The Lie algebra lkv appears in a chain of…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and Martin-Lof-random-low sets: three different definitions turns out to be equivalent for very…