Related papers: On the degrees of constructively immune sets
We use the gluing construction introduced by Jia Huang to explore the rings of invariants for a range of modular representations. We construct generating sets for the rings of invariants of the maximal parabolic subgroups of a finite…
This paper concerns the computation and identification of the (homological) Conley index over the integers, in the context of discrete dynamical systems generated by continuous maps. We discuss the significance with respect to nonlinear…
Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…
We adapt the Ping-Pong Lemma, which historically was used to study free products of groups, to the setting of the homeomorphism group of the unit interval. As a consequence, we isolate a large class of generating sets for subgroups of…
In order to study graded Frobenius algebras from a ring theoretical perspective, we introduce graded quasi-Frobenius rings, graded Frobenius rings and a shift-version of the latter ones, and we investigate the structure and representations…
An explanation is given for the initially surprising ubiquity of separating sets in normal complex surface germs. It is shown that they are quite common in higher dimensions too. The relationship between separating sets and the geometry of…
Compartmental models are valuable tools for investigating infectious diseases. Researchers building such models typically begin with a simple structure where compartments correspond to individuals with different epidemiological statuses,…
A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…
The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…
This paper is part of series on self-contained papers in which a large part, if not the full extent, of the asymptotic limit theory of summands of independent random variables is exposed. Each paper of the series may be taken as review…
We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…
In this paper, we summarize the work on the characterization of finite simple groups and the study on finite groups with the set of element orders and two orders (the order of group and the set of element orders). Some related topics, and…
We present statements equivalent to some fragments of the principle of non-deterministic inductive definitions (NID) by van den Berg (2013), working in a weak subsystem of constructive set theory CZF. We show that several statements in…
The problem of constructing maximal equiangular tight frames or SICs was raised by Zauner in 1998. Four years ago it was realized that the problem is closely connected to a major open problem in number theory. We discuss why such a…
Therapeutic antibody candidates often require extensive engineering to improve key functional and developability properties before clinical development. This can be achieved through iterative design, where starting molecules are optimized…
Structural properties of unitary groups over local, not necessarily commutative, rings are developed, with applications to the computation of the orders of these groups (when finite) and to the degrees of the irreducible constituents of the…
These open problems were presented in the Problem Sessions held during the Tianyuan Workshop on Computability Theory and Descriptive Set Theory, June 16-20, 2025. The problems are organized into sections named after their contributors, in…
A class of random graphs is introduced and studied. The graphs are constructed in an algorithmic way from five motifs which were found in [Milo R., Shen-Orr S., Itzkovitz S., Kashtan N., Chklovskii D., Alon U., Science, 2002, 298, 824-827].…
In this note, we use the theory of test ideals and Cartier algebras to examine the interplay between the tight and integral closures in a local ring of positive characteristic. Using work of Schwede, we prove the abundance of strong test…
As suggested by the title, this paper is a survey of recent results and questions on the collection of computably enumerable sets under inclusion. This is not a broad survey but one focused on the author's and a few others' current…