Related papers: Complexities and Representations of F-Borel Spaces
We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…
We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…
It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…
In the present paper, as we did previously in [7], we investigate the relations between the geometric properties of tilings and the algebraic properties of associated relational structures. Our study is motivated by the existence of…
In chapter 1 we define period mappings of Hodge-de Rahm type for certain submersive, yet not necessarily locally topologically trivial, morphisms of complex manifolds. Generalizing Griffiths's theory, we interpret the differential of such…
We propose a sequential topology on the space of sub-$\sigma$-algebras of a separable probability space $(\Omega,\mathcal{F},\mathbb{P})$ by linking conditional expectations on $L^{2}$ along sequences of sub-$\sigma$-algebras. The varying…
This paper provides a unifying framework for a range of categorical constructions characterised by universal mapping properties, within the realm of compactifications of discrete structures. Some classic examples fit within this broad…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
For groups of a topological origin, such as braid groups and mapping class groups, an important source of interesting and highly non-trivial representations is given by their actions on the twisted homology of associated spaces; these are…
We compute the topological complexity of Eilenberg-Mac Lane spaces associated to the group of automorphisms of a finitely generated free group which act by conjugation on a given basis, and to certain subgroups.
We prove that for a countable, commutative ring $R$, the class of countable $R$-modules either has only countably many isomorphism types, or else it is Borel complete. The machinery gives a succinct proof of the Borel completeness of TFAB,…
We place the representation variety in the broader context of abelian and nonabelian cohomology. We outline the equivalent constructions of the moduli spaces of flat bundles, of smooth integrable connections, and of holomorphic integrable…
Consider the middle perversity intersection cohomology groups of various compactifications of a Hermitian locally symmetric space. Rapoport and independently Goresky and MacPherson have conjectured that these groups coincide for the…
We generalize a recent result by J.F. Carlson to finite tensor categories having finitely generated cohomology. Specifically, we show that if the Krull dimension of the cohomology ring is sufficiently large, then there exist infinitely many…
We review our present understanding of heterotic compactifications on non-Kahler complex manifolds with torsion. Most of these manifolds can be obtained by duality chasing a consistent F-theory compactification in the presence of fluxes. We…
Factorization algebras have been defined using three different topologies on the Ran space. We study these three different topologies on the exponential, which is the union of the Ran space and the empty configuration, and show that an…
Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space). Total representations make the well known analogy between numberings and…
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…
We study Polish spaces for which a set of possible distances $A \subseteq \mathbb{R}^+$ is fixed in advance. We determine, depending on the properties of $A$, the complexity of the collection of all Polish metric spaces with distances in…