Dataset for Randomised measurements of a disorder-induced entanglement transition in a neutral atom quantum processor
Scholin, O
(01 Jan 2026)
doi:10.5287/ora-dow5oapxe
Data for paper "Different cadaver astigmatan mites (Arthropoda: Acari) are designed to bite flesh differently" by C E Bowman in The Science of Nature
Bowman, C
(01 Jan 2026)
doi:10.5287/ora-kzgngvyjj
Thu, 23 Apr 2026
17:00
17:00
L4
Conjugacy of trivial autohomeomorphisms of $\beta N\setminus N$.
Ilijas Farah
(York University, Toronto)
Abstract
An autohomeomorphism of the Čech--Stone remainder $\beta N\setminus N$ is called trivial if it has a continuous extension to a map from $\beta N$ into itself. Such map is determined by an almost permutation, which is a bijection between cofinite subsets of $N$. By results of W. Rudin and S. Shelah, the question whether nontrivial autohomeomorphisms of $\beta N\setminus N$ exist is independent from ZFC. We will be considering the so-called rotary autohomeomorphisms. An autohomeomorphism is called rotary if it corresponds to a permutation of $N$ all of whose cycles are finite. If all autohomeomorphisms are trivial, then the problem of their conjugacy is also trivial (in the usual sense of the word). However the Continuum Hypothesis makes the conjugacy relation nontrivial. While our results are somewhat incomplete, they suffice to decide whether for example the rotary autohomeomorphisms whose cycles have lengths $2^{2n}$, for $n\in N$, and $2^{2n+1}$, for $n\in N$, are conjugate. This is a joint work with Will Brian.
Tue, 16 Jun 2026
14:00 -
15:00
L6
The question of profinite isomorphism
Dan Segal
(Oxford)
Abstract
The question is this: can one effectively decide whether two given groups have isomorphic profinite completions? Thanks to Bridson and Wilton, it is known that the answer is `no' in general, even for finitely presented residually finite groups. However, if the groups are (and are given to be) virtually polycyclic, then the answer is 'yes'. This is not really surprising, as a lot is known both about the profinite completions of such groups and about how they are determined up to isomorphism; but it may be instructive to see how it is done.
A Data-Driven Market Simulator for Small Data Environments
Bühler, H
Horvath, B
Lyons, T
Perez Arribas, I
Wood, B
Stochastic Analysis and Applications 2025
273-310
(01 Apr 2026)
doi:10.1007/978-3-032-03914-9_10
A Data-Driven Market Simulator for Small Data Environments
Bühler, H
Horvath, B
Lyons, T
Perez Arribas, I
Wood, B
Stochastic Analysis and Applications 2025
273-310
(01 Apr 2026)
doi:10.1007/978-3-032-03914-9_10
Preface
Fowler, A
Ng, F
Springer Textbooks in Earth Sciences Geography and Environment
volume Part F10283
xi-xiii
(01 Jan 2021)
Robustness Verification of Graph Neural Networks Via Lightweight Satisfiability Testing
Lu, C
Tan, T
Benedikt, M
Tools and Algorithms for the Construction and Analysis of Systems
volume 16505
3-22
(16 Apr 2026)
doi:10.1007/978-3-032-22752-2_1
Thu, 11 Jun 2026
17:00
17:00
L3
Aspects of 2-categorical logic
Nicola Gambino
(Manchester University)
Abstract
Two ideas underpin categorical logic: first, that a theory can be identified with its associated syntactic category; secondly, that the set-theoretic models of a theory can be identified with functors from its syntactic category to the category of sets and functions preserving suitable structure. This point of view is useful because it often helps us to establish existence of free models. After reviewing these ideas, I will present joint work with Giacomo Tendas on variant in the context of 2-dimensional category theory, in which we are interested in categories, rather than sets, equipped with additional structure (often subject to universal properties). Extra subtleties emerge, as one needs to deal with a form of quantification in between `there exists’ and `there exists a unique’. As an application, we obtain a variety of free 2-categorical constructions, including Joyal’s free bicompletions.