Related papers: Enumeration degrees and non-metrizable topology
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…
Tevelev degrees in Gromov-Witten theory are defined whenever there are virtually a finite number of genus $g$ maps of fixed complex structure in a given curve class $\beta$ through $n$ general points of a target variety $X$. These virtual…
Enumeration of tilings is the mathematical study concerning the total number of coverings of regions by similar pieces without gaps or overlaps. Enumeration of tilings has become a vibrant subfield of combinatorics with connections and…
This report introduces and investigates a family of metrics on sets of pointed Kripke models. The metrics are generalizations of the Hamming distance applicable to countably infinite binary strings and, by extension, logical theories or…
Given asymptotic counts in number theory, a question of Venkatesh asks what is the topological nature of lower order terms. We consider the arithmetic aspect of the inertia stack of an algebraic stack over finite fields to partially answer…
A topological space $L$ is called a linear ordered topological space (LOTS) whenever there is a linear order $\leq$ on $L$ such that the topology on $L$ is generated by the open sets of the form $(a, b)$ with $a < b$ and $a, b \in L \cup \{…
A generalization of metric space is presented which is shown to admit a theory strongly related to that of ordinary metric spaces. To avoid the topological effects related to dropping any of the axioms of metric space, first a new, and…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
Given a partially ordered set $P$ we study properties of topological spaces $X$ admitting a $P$-base, i.e., an indexed family $(U_\alpha)_{\alpha\in P}$ of subsets of $X\times X$ such that $U_\beta\subset U_\alpha$ for all $\alpha\le\beta$…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that for any property which may or may not be satisfied by any…
Robust and comprehensive characterization of the topological properties of complex networks requires the adoption of several respective measurements, among which the node degree has special importance. In the present work, we provide an…
Following Thurston's geometrisation picture in dimension three, we study geometric manifolds in a more general setting in arbitrary dimensions, with respect to the following problems: (i) The existence of maps of non-zero degree (domination…
Using nonstandard analysis we define a topology on the ring of germs of functions: $(mathbb R^n,0)\rightarrow(mathbb R,0)$. We prove that this topology is absolutely convex, Hausdorff, that convergent nets of continuous germs have…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
In spaces of metrics, we investigate topological distributions of the doubling property, the uniform disconnectedness, and the uniform perfectness, which are the quasi-symmetrically invariant properties appearing in the David--Semmes…
We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space $X$. When $X$ is second countable, we observe that the…
In this article we extend the notion of metric measure spaces to so-called metric two-level measure spaces (m2m spaces): An m2m space $(X, r, \nu)$ is a Polish metric space $(X, r)$ equipped with a two-level measure $\nu \in…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…