Related papers: On the computability of cofinal Fra\"iss\'e limits
We develop the theory of homogeneous Polish ultrametric structures. Our starting point is a Fraisse class of finite structures and the crucial tool is the universal homogeneous epimorphism. The new Fraisse limit is an inverse limit,…
The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property…
This is Part II of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. In Part I, we prove that every Fraisse structure in a finite…
We define a class of functions termed "Computable in the Limit", based on the Machine Learning paradigm of "Identification in the Limit". A function is Computable in the Limit if it defines a property P_p of a recursively enumerable class A…
An amorphic association scheme has the property that any of its fusion is also an association scheme. In this paper we generalize the property to be amorphic to an arbitrary C-algebra and prove that any amorphic C-algebra is determined up…
This article explores the limits of geometric construction using various tools, both classical and modern. Starting with ruler and compass constructions, we examine how adding methods such as origami, marked rulers (neusis), conic sections,…
Aging is associated with the accumulation of damage throughout a persons life. Individual health can be assessed by the Frailty Index (FI). The FI is calculated simply as the proportion $f$ of accumulated age related deficits relative to…
A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…
The main theme of this paper is higher virtual algebraic fibering properties of right-angled Coxeter groups (RACGs), with a special focus on those whose defining flag complex is a finite building. We prove for particular classes of finite…
We introduce a new filtration on Hopf algebras, the standard filtration, generalizing the coradical filtration. Its zeroth term, called the Hopf coradical, is the subalgebra generated by the coradical. We give a structure theorem: any Hopf…
Claims about recursive self-improvement in AI often slide from repeated internal revision to the possibility of qualitatively stronger capability without clearly distinguishing the underlying computational regimes. This paper gives a formal…
We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…
We develop a unified framework for iterated symmetric extensions with countable support and, more generally, with $<\kappa$-support. Set-length iterations are treated uniformly, and when the iteration template is first-order definable over…
We realise the algebra $\mathcal W$, the algebra $\mathcal Z_0$ and the algebras $\mathcal Z_0\otimes A$, where $A$ is a unital UHF algebra as Fra\"iss\'e limits of suitable classes of structures. In doing so, we show that such algebras are…
We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized over multiple levels of the processor/memory and network hierarchy. Using a common formalism to describe the…
Conformal Prediction (CP) stands out as a robust framework for uncertainty quantification, which is crucial for ensuring the reliability of predictions. However, common CP methods heavily rely on data exchangeability, a condition often…
Coded polynomial aggregation (CPA) enables the master to directly recover a weighted aggregation of polynomial evaluations without individually decoding each term, thereby reducing the number of required worker responses. In this paper, we…
The general theory developed by Ben Yaacov for metric structures provides Fra\"iss\'e limits which are approximately ultrahomogeneous. We show here that this result can be strengthened in the case of relational metric structures. We give an…
A Cylindrical Algebraic Decomposition (CAD) is a decomposition of R^n into a finite collection of semialgebraic cells. A CAD satisfies the "frontier condition" if, for every cell C, there is a collection of cells of the decomposition whose…
The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it…