Related papers: On the computability of cofinal Fra\"iss\'e limits
In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarantee that every finite part of the result can be evaluated in finitely…
We revisit facial reduction from the point of view of projective geometry. This leads us to a homogenization strategy in conic programming that eliminates the phenomenon of weak infeasibility. For semidefinite programs (and others), this…
In order to understand the structure of the `typical' element of an automorphism group, one has to study how large the conjugacy classes of the group are. When typical is meant in the sense of Baire category, a complete description of the…
We establish that constructive continued fraction dimension originally defined using $s$-gales is robust, but surprisingly, that the effective continued fraction dimension and effective (base-$b$) Hausdorff dimension of the same real can be…
A good feature representation is a determinant factor to achieve high performance for many machine learning algorithms in terms of classification. This is especially true for techniques that do not build complex internal representations of…
We present a simple set of data structures, and a collection of methods for constructing and updating the structures, designed to support the use of cohesive elements in simulations of fracture and fragmentation. Initially all interior…
Does a space enjoying good finiteness properties admit an algebraic model with commensurable finiteness properties? In this note, we provide a rational homotopy obstruction for this to happen. As an application, we show that the maximal…
We study pseudodeterministic constructions, i.e., randomized algorithms which output the same solution on most computation paths. We establish unconditionally that there is an infinite sequence $\{p_n\}_{n \in \mathbb{N}}$ of increasing…
Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…
Human aging is a process controlled by both genetics and environment. Many studies have been conducted to identify a subset of genes related to aging from the human genome. Biologists implicitly categorize age-related genes into genes that…
Let G be a noncocompact irreducible arithmetic group over a global function field K of characteristic p, and let H be a finite-index, residually p-finite subgroup of G. We show that the cohomology of H in the dimension of its associated…
We provide a characterization of the peak age of information (AoI) achievable in a random-access system operating according to the frameless ALOHA protocol. Differently from previous studies, our analysis accounts for the fact that the…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…
We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…
Let $S$ be an orientable, connected surface with infinitely-generated fundamental group. The main theorem states that if the genus of $S$ is finite and at least 4, then the isomorphism type of the pure mapping class group associated to $S$,…
It is shown that a Hopf algebra over a field admitting a Galois extension separable over its subalgebra of coinvariants is of finite dimension. This answers in the affirmative a question posed by Beattie et al. in [{\it Proc. Amer. Math.…
We investigate the computability-theoretic properties of valued fields, and in particular algebraically closed valued fields and $p$-adically closed valued fields. We give an effectiveness condition, related to Hensel's lemma, on a valued…
Sequential hypothesis testing asks for decision rules that update as data arrive. A natural goal is \emph{eventual correctness}: the rule may change its mind early on, but it should make only finitely many wrong decisions almost surely.…
Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…