Related papers: The Critical Exponent is Computable for Automatic …
We first obtain finiteness properties for the collection of closed normal subgroups of a compactly generated locally compact group. Via these properties, every compactly generated locally compact group admits an essentially chief series -…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…
We recast Euclid's proof of the infinitude of prime numbers as a Euclidean Criterion for a domain to have infinitely many atoms. We make connections with Furstenberg's "topological" proof of the infinitude of prime numbers and show that our…
Recent work on exact renormalization group flow equations has pointed out the possibility to study critical phenomena in continuous dimension D of space. In an investigation of the O(N) model the dimension N of the fields may be seen as a…
We study explorability, a measure of nondeterminism in pushdown automata, which generalises history-determinism. An automaton is k-explorable if, while reading the input, it suffices to follow k concurrent runs, built step-by-step based…
We develop a general, non-probabilistic model of prediction which is suitable for assessing the (un)predictability of individual physical events. We use this model to provide, for the first time, a rigorous proof of the unpredictability of…
We describe the necessary and sufficient numerical condition when an element $X$ in the Picard group of $K(2)$-local category at prime $p \geqslant 5$ is of finite type, i.e., $\pi_kX$ is finitely generated as a $\mathbb{Z}_p$-module for…
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…
In the Ising model on the simple cubic lattice, we describe the inverse temperature $\beta$ and other quantities relevant for the computation of critical quantities in terms of a dimensionless squared mass $M$. The critical behaviors of…
A statistical functional, such as the mean or the median, is called elicitable if there is a scoring function or loss function such that the correct forecast of the functional is the unique minimizer of the expected score. Such scoring…
We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…
We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…
Let $\mathcal{S}$ be a commutative semigroup, and let $T$ be a sequence of terms from the semigroup $\mathcal{S}$. We call $T$ an (additively) {\sl irreducible} sequence provided that no sum of its some terms vanishes. Given any element $a$…
Dynamic relaxation of the XY model and fully frustrated XY model quenched from an initial ordered state to the critical temperature or below is investigated with Monte Carlo methods. Universal power law scaling behaviour is observed. The…
Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…
We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…
The study of essential and strongly essential variables in functions defined on finite sets is a part of $k$-valued logic. We extend the main definitions from functions to terms. This allows us to apply concepts and results of Universal…
Products, multiplicative Chern characters, and finite coefficients, are unarguably among the most important tools in algebraic K-theory. Although they admit numerous different constructions, they are not yet fully understood at the…