Related papers: Cutting lemma and Zarankiewicz's problem in distal…
Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…
The fundamental result of Li, Long, and Srinivasan on approximations of set systems has become a key tool across several communities such as learning theory, algorithms, computational geometry, combinatorics and data analysis. The goal of…
We define and study semilattices and lattices for $E$-closed families of theories. Properties of these semilattices and lattices are investigated. It is shown that lattices for families of theories with least generating sets are…
We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…
The main result of the paper is an extension of the Dirichlet problem from (closures of) bounded open domains U to arbitrary compact subsets X of the complex plane, i.e. the closure of the corresponding space of functions which are harmonic…
We study the model theory of covers of groups definable in o-minimal structures. This includes the case of covers of compact real Lie groups. In particular we study categoricity questions, pointing out some notable differences with the case…
Given an o-minimal structure ${\mathcal M}$ with a group operation, we show that for a properly convex subset $U$, the theory of the expanded structure ${\mathcal M}'=({\mathcal M},U)$ has definable Skolem functions precisely when…
This thesis pertains to the study of elliptic and parabolic partial differential equations on "thin" structures. The first main objective is to establish the strong and weak low-dimensional counterparts of the parabolic Neumann problem. The…
The Steiner Tree problem is a classical problem in combinatorial optimization: the goal is to connect a set $T$ of terminals in a graph $G$ by a tree of minimum size. Karpinski and Zelikovsky (1996) studied the $\delta$-dense version of…
We establish versions of Szeg\H{o}'s distance formula and Widom's theorem on invertibility of (a family of) Toeplitz operators in a class of finite codimension subalgebras of uniform algebras, obtained by imposing a finite number of linear…
We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $t$ ranges. For set systems with shallow cell complexity…
A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…
Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.
Instead of formulating the state space of a quantum field theory over one big Hilbert space, it has been proposed by Kijowski [Kijowski 1977] to represent quantum states as projective families of density matrices over a collection of…
In this paper we study the semilinear partial differential equations in the plane the linear part of which is written in a divergence form. The main result is given as a factorization theorem. This theorem states that every weak solution of…
We prove a far-reaching strengthening of Szemer\'edi's regularity lemma for intersection graphs of pseudo-segments. It shows that the vertex set of such a graph can be partitioned into a bounded number of parts of roughly the same size such…
We discuss the problems of incompleteness and inexpressibility. We introduce almost self-referential formulas, use them to extend set theory, and relate their expressive power to that of infinitary logic. We discuss the nature of proper…
We give an example of two ordered structures M, N in the same language L with the same universe, the same order and admitting the same one-variable definable subsets such that M is a model of the common theory of o-minimal L-structures and…