Related papers: Limit Filters and Dependent Choice in Countable-Su…
Bounded self-certification in Turing machines fails because self-simulation necessarily incurs a strictly positive temporal overhead. We translate this operational constraint into a domain-theoretic framework, defining an operator that…
We study higher analogues of the classical independence number on $\omega$. For $\kappa$ regular uncountable, we denote by $i(\kappa)$ the minimal size of a maximal $\kappa$-independent family. We establish ZFC relations between $i(\kappa)$…
We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…
Matched filters are widely used to localise signal patterns due to their high efficiency and interpretability. However, their effectiveness deteriorates for low signal-to-noise ratio (SNR) signals, such as those recorded on edge devices,…
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
By combining classical results of B\"uchi, some elementary Tauberian theorems and some basic tools from logic and combinatorics we show that every ordinal $\alpha$ with $\varepsilon_0\geq \alpha\geq \omega^\omega$ satisfies a natural…
There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…
We study non-autonomous conformal iterated function systems, with finite or countably infinite alphabet alike. These differ from the usual (autonomous) iterated function systems in that the contractions applied at each step in time are…
A novel, model free, approach to experimental closed-loop flow control is implemented on a separated flow. Feedback control laws are generated using genetic programming where they are optimized using replication, mutation and cross-over of…
The integration of Formal Verification tools with Large Language Models (LLMs) offers a path to scale software verification beyond manual workflows. However, current methods remain unreliable: without a solid theoretical footing, the…
Here we show that, given a finite homological system $({\cal P},\leq,\{\Delta_u\}_{u\in {\cal P}})$ for a finite-dimensional algebra $\Lambda$ over an algebraically closed field, the category ${\cal F}(\Delta)$ of $\Delta$-filtered modules…
The Axiom of Dependent Choice $\mathsf{DC}$ and the Axiom of Countable Choice $\mathsf{AC}_\omega$ are two weak forms of the Axiom of Choice that can be stated for a specific set: $\mathsf{DC}(X)$ asserts that any total binary relation on…
We show that from a supercompact cardinal \kappa, there is a forcing extension V[G] that has a symmetric inner model N in which ZF + not AC holds, \kappa\ and \kappa^+ are both singular, and the continuum function at \kappa\ can be…
It is well-known that the automorphism towers of infinite centreless groups of cardinality kappa terminate in less than (2^{kappa})^+ steps. But an easy counting argument shows that (2^{kappa})^+ is not the best possible bound. However, in…
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent. Firstly, we introduce the relaxed notion of…
Gapless quantum phases can become distinct when internal symmetries are enforced, in analogy with gapped symmetry-protected topological (SPT) phases. However, this distinction does not always lead to protected edge modes, raising the…
A major open question in the study of synchronization of coupled oscillators is to find necessary and sufficient condition for a system to synchronize on a given family of graphs. This is a difficult question that requires to understand…
We develop the notion of a "filtered cospan" as an algebraic object that stands in the same relation to interlevel persistence modules as filtered chain complexes stand with respect to sublevel persistence modules. This relation is…
We revisit the problem explored in [1] of guaranteeing satisfaction of multiple simultaneous state constraints applied to a single-input, single-output plant consisting of a chain of n integrators subject to input limitations. For this…
We introduce a new class of ultrafilters which generalizes the well-known class of simple $P$-point ultrafilters. We prove that for any well-founded $\sigma$-directed partial order $\mathbb{D}$ there is a mild forcing extension where there…