Related papers: On the degrees of constructively immune sets
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
We introduce and study effective versions of the localization numbers introduced by Newelski and Roslanowski (cite in paper). We show that proper hierarchies are produced, and that the corresponding highness notions are relatively weak, in…
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…
We study an infection-age structured epidemic model in which both the infectivity and the rate of loss of immunity depend on the time-since-infection. The model can be equivalently viewed as a nonlinear renewal equation for the incidence of…
The concept of uniform tangent sets was introduced and discussed in [3 - Krastanov, Ribarska, SIAM J. Control Optim., 55(3), 2017]. This study is devoted to their further investigation and to generalization of the abstract Lagrange…
The basic idea of many effective immunization strategies is first to rank the importance of vertices according to the degrees of vertices and then remove the vertices from highest importance to lowest until the network becomes disconnected.…
These are notes for my Takagi lecture at the University of Tokyo in November, 2016. I survey what is known about simple modules for reductive algebraic groups. The emphasis is on characteristic p>0 and Lusztig's character formula. I explain…
We consider sets with infinite addition, called $\Sigma$-monoids, and contribute to their literature in three ways. First, our definition subsumes those from previous works and allows us to relate them in terms of adjuctions between their…
We consider three types of set-systems that have interesting applications in algebraic combinatorics and representation theory: maximal collections of the so-called strongly separated, weakly separated, and chord separated subsets of a set…
We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
Two different notions of {\mu}-equicontinuity that apply to topological dynamical systems and probability measures were studied by Gilman (1987) and Huang-Lu-Ye (2011). One was used to classify measure preserving topological dynamical…
In this note, we study a class of random subsets of positive integers induced by Bernoulli random variables. We obtain sufficient conditions such that the random set is almost surely lacunary, does not have bounded gaps and contains…
We present a detailed set-based analysis of the well-known SIR and SEIR epidemic models subjected to hard caps on the proportion of infective individuals, and bounds on the allowable intervention strategies, such as social distancing,…
We study reductions well suited to compare structures and classes of structures with respect to properties based on enumeration reducibility. We introduce the notion of a positive enumerable functor and study the relationship with…
Research in epidemiology often focusses on designing interventions that result in the number of infected individuals asymptotically approaching zero, without considering that this number may peak at high values during transients. Recent…
Accurate immunological models offer the possibility of performing highthroughput experiments in silico that can predict, or at least suggest, in vivo phenomena. In this chapter, we compare various models of immunological memory. We first…
We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…