Related papers: Locally countable graphs of second projective clas…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
In the realm of generative models for graphs, extensive research has been conducted. However, most existing methods struggle with large graphs due to the complexity of representing the entire joint distribution across all node pairs and…
A subset $A$ of a topological space $X$ is called relatively functionally countable (RFC) in $X$, if for each continuous function $f : X \to \mathbb{R}$ the set $f[A]$ is countable. We prove that all RFC subsets of a product…
We define a signed count of real rational pseudo-holomorphic curves appearing in a one-parameter family of real Spin symplectic K3 surfaces. We show that this count is an invariant of the deformation class of the family. In the case of a…
In real world domains, most graphs naturally exhibit a hierarchical structure. However, data-driven graph generation is yet to effectively capture such structures. To address this, we propose a novel approach that recursively generates…
We present a general result about generating group topologies by pseudo-norms. Namely, we show that if a topology has a base of sets which are closed in a certain sense, then it can be generated by a collection of pseudo-norms such that the…
Two graphs $G$ and $H$ are \emph{hypomorphic} if there exists a bijection $\varphi \colon V(G) \rightarrow V(H)$ such that $G - v \cong H - \varphi(v)$ for each $v \in V(G)$. A graph $G$ is \emph{reconstructible} if $H \cong G$ for all $H$…
Using the theoretical basis developed by Yao and Zeilberger, we consider certain graph families whose structure results in a rational generating function for sequences related to spanning tree enumeration. Said families are Powers of Cycles…
Consider any locally checkable labeling problem $\Pi$ in rooted regular trees: there is a finite set of labels $\Sigma$, and for each label $x \in \Sigma$ we specify what are permitted label combinations of the children for an internal node…
We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
Considered will be properties of the set of real numbers $\Re$ generated by an operator that has form of an exponential function of Gelfond-Schneider type with rational arguments. It will be shown that such created set has cardinal number…
We propose a new constructive model of the real continuum based on the notion of fractal definability. Rather than assuming the continuum as a completed uncountable totality, we view it as the cumulative result of a vast space of stratified…
Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all…
We prove the existence of (non compact) complex surfaces with a smooth rational curve embedded such that there does not exist any formal singular foliation along the curve. In particular, at arbitray small neighborhood of the curve, any…
Exact representations of real numbers such as the signed digit representation or more generally linear fractional representations or the infinite Gray code represent real numbers as infinite streams of digits. In earlier work by the first…
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…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
We study the problem of counting real simple rational functions $\varphi$ with prescribed ramification data (i.e. a particular class of oriented real Hurwitz numbers of genus $0$). We introduce a signed count of such functions that is…