Related papers: Limit Filters and Dependent Choice in Countable-Su…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
We construct in ZFC a countably compact group without non-trivial convergent sequences of size $2^{\mathfrak{c}}$, answering a question of Bellini, Rodrigues and Tomita. We also construct in ZFC a selectively pseudocompact group which is…
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…
We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…
A family $\mathcal{A} \subseteq [\omega]^\omega$ such that for all finite $\{X_i\}_{i\in n}\subseteq \mathcal A$ and $A \in \mathcal{A} \setminus \{X_i\}_{i\in n}$, the set $A \setminus \bigcup_{i \in n} X_i$ is infinite, is said to be…
We show the existence of an MA-complete homology problem for a certain subclass of simplicial complexes. The problem is defined through a new concept of orientability of simplicial complexes that we call a "uniform orientable filtration",…
A family $\mathscr{I} \subseteq [\omega]^\omega$ such that for all finite $\{X_i\}_{i\in n}\subseteq \mathcal I$ and $A \in \mathscr{I} \setminus \{X_i\}_{i\in n}$, the set $A \setminus \bigcup_{i < n} X_i$ is infinite, is said to be ideal…
We show that in a category with pullbacks, arbitrary sifted colimits may be constructed as filtered colimits of reflexive coequalizers. This implies that "lex sifted colimits", in the sense of Garner--Lack, decompose as Barr-exactness plus…
We consider the model-checking problem of Synchronized Computation-Tree Logic (CTL+Sync) over One-Counter Automata (OCAs). CTL+Sync augments CTL with temporal operators that require several paths to satisfy properties in a synchronous…
We study ultrafilters from the perspective of the algebra in the \v{C}ech-Stone compactification of the natural numbers, and idempotent elements therein. The first two results that we prove establish that, if $p$ is a Q-point (resp. a…
Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…
We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…
We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…
We study generalized symmetries of quantum field theories in 1+1D generated by topological defect lines with no inverse. This paper follows our companion paper on gapped phases and anomalies associated with these symmetries. In the present…
Discovering governing equations, whether manually or by data-driven methods, has been central in physics and related areas. Since governing equations are typically constrained by a set of symmetries, using symmetry constraints to restrict…
Using the numerical modular bootstrap, we constrain the space of 1+1d CFTs with a finite non-invertible global symmetry described by a fusion category $\mathcal{C}$. We derive universal and rigorous upper bounds on the lightest…
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…
This is an overview about a method of constructing ccc forcings: Suppose first that a continuous, commutative system of complete embeddings between countable forcings indexed along $\omega_1$ is given. Then its direct limit satisfies ccc by…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
It is shown that the consistency strength of ZF + DC + "the closed unbounded ultrafilter on omega_1 is an ultrafilter" is exactly ZFC + one measurable cardinal.