Related papers: On some recent selective properties involving netw…
Hurwitz numbers, which count certain covers of the projective line (or, equivalently, factorizations of permuations into transpositions), have been extensively studied for over a century. The Gromov-Witten potential F of a point, the…
Our aim is to investigate spaces with sigma-discrete and meager dense sets, as well as selective versions of these properties. We construct numerous examples to point out the differences between these classes while answering questions of…
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…
We establish several new characterizations of amenable $W^*$- and $C^*$-dynamical systems over arbitrary locally compact groups. In the $W^*$-setting we show that amenability is equivalent to (1) a Reiter property and (2) the existence of a…
In this paper, we consider some additive properties of integers with restricted digit expansions. Let $b\geq 3$ be an integer and $B_b$ be the set of integers whose base $b$ expansions have only digits $\{0,1\}.$ Let $a,b,c$ be three…
We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…
The generalized Hamming weights (GHWs) of linear codes are fundamental parameters, the knowledge of which is of great interest in many applications. However, to determine the GHWs of linear codes is difficult in general. In this paper, we…
With the advent of future-generation interferometers a huge number of Gravitational Wave (GW) signals is expected to be measured without an electromagnetic counterpart. Although these signals do not allow a simultaneous measurement of the…
The mark weighted correlation function (MCF) $W(s,\mu)$ is a computationally efficient statistical measure which can probe clustering information beyond that of the conventional 2-point statistics. In this work, we extend the traditional…
In this paper, we propose a new homological method to study weighted directed networks. Our model of such networks is a directed graph $Q$ equipped with a weight function $w$ on the set $Q_{1}$ of arrows in $Q$. We require that the range…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
Selection comparator networks have been studied for many years. Recently, they have been successfully applied to encode cardinality constraints for SAT-solvers. To decrease the size of generated formula there is a need for constructions of…
It is proved that if some boundary $B$ of a convex compact subset $X$ of a locally convex linear space has a countable network, then the convex compact space $X$ is metrizable. If the boundary $B$ is a Lindelof $\Sigma$-space, then the…
This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
For one-dimensional interval and integrable weight function $w$ we define via completion a weighted Sobolev space $H^{m,p}_{\mu_w}$ of arbitrary integer order $m$. The weights in consideration may suffer strong degeneration so that, in…
Weighted First Order Model Counting (WFOMC) is fundamental to probabilistic inference in statistical relational learning models. As WFOMC is known to be intractable in general ($\#$P-complete), logical fragments that admit polynomial time…
This article examines Hilbert spaces constructed from sets whose existence is incompatible with the Countable Axiom of Choice (CC). Our point of view is twofold: (1) We examine what can and cannot be said about Hilbert spaces and operators…
Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the…
We consider BPS-counting functions $\mathcal{Z}_{N,M}$ of $N$ parallel M5-branes probing a transverse $\mathbb{Z}_M$ orbifold geometry. These brane web configurations can be dualised into a class of toric non-compact Calabi-Yau threefolds…