Related papers: On the limits of comparing subset sizes within $\m…
In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of Singularity theory: the Inverse, Implicit and Rank Theorems for Lipschitz mappings, Splitting Lemma and Morse Lemma, the density and…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
We provide some background on the category of classifiable $\mathrm{C}^*$-algebras, whose objects are infinite-dimensional, simple, separable, unital $\mathrm{C}^*$-algebras that have finite nuclear dimension and satisfy the universal…
We define twelve variants of a Reifenberg's affine approximation property, which are known to be connected with the singular sets of minimal surfaces. With this motivation we investigate the regularity of the sets possessing these. We…
Every conditionally convergent series of real numbers has a subseries that diverges. The subseries numbers, previously studied in arXiv:1801.06206 , answer the question how many subsets of the natural numbers are necessary, such that every…
We refer to the classic definition of a singularity in Einstein's general relativity (based on geodesic incompletness) as well as to some other criteria to evaluate the nature of singularities in cosmology. We review what different…
We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…
The infinite random size-biased order with arbitrary positive size parameters is introduced in terms of independent exponential random variables. We collect basic properties and constructions of the order, some of which belong to the…
This paper studies three natural pre-orders of increasing generality on the set of all completely non-unitary partial isometries with equal defect indices. We show that the problem of determining when one partial isometry is less than…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
We explore various limit constructions for C*-algebras, such as composition series and inverse limits, in relation to the notions of real rank, stable rank, and extremal richness. We also consider extensions and pullbacks. We identify some…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
Let G be a group and let k be a cardinal. A subset A of G is called left (right) k-large if there exists a subset F of G such that |F| < { and G = FA (G = AF). We say that A is k-large if A is left and right k-large. It is known that every…
We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…
We show that every definable subset of an uncountably categorical pseudofinite structure has pseudofinite cardinality which is polynomial (over the rationals) in the size of any strongly minimal subset, with the degree of the polynomial…
We find new bounds on the conformal dimension of small cancellation groups. These are used to show that a random few relator group has conformal dimension 2+o(1) asymptotically almost surely (a.a.s.). In fact, if the number of relators…
The relations of almost containedness and orthogonality in the lattice of groups of finitary permutations are studied in the paper. We define six cardinal numbers naturally corresponding to to these relations by the standard scheme of…
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest is the sample complexity: the number of samples required to…
NF set theory using intuitionistic logic is called iNF. We develop the theories of finite sets and their power sets and mappings, finite cardinals and their ordering, cardinal exponentiation, addition, and multiplication. We follow Rosser…
We consider formal maps in any finite dimension $d$ with coefficients in an integral domain $K$ with identity. Those invertible under formal composition form a group $\mathcal{G}$. We consider the centraliser $C_g$ of an element…