Related papers: Calligraphy Concerning Casually Compiled Cardinal …
The radial distribution function is a characteristic geometric quantity of a point set in Euclidean space that reflects itself in the corresponding diffraction spectrum and related objects of physical interest. The underlying combinatorial…
For $\kappa$ regular and uncountable we define variants of the classical cardinal characteristics modulo the non-stationary ideal.
This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…
In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it…
For arbitrary $c_0>0$, if $A$ is a subset of the primes less than $x$ with cardinality $\delta x (\log x)^{-1}$ with $\delta\geq (\log x)^{-c_0}$, then there exists a positive constant $c$ such that the cardinality of $A+A$ is larger than…
All ultrafilters under consideration here are non-principal ultrafilters on the set omega of natural numbers. We are concerned with the possible cofinalities of ultrapowers of omega with respect to such ultrafilters. We show that no…
Assuming the P-ideal dichotomy, we attempt to isolate those cardinal characteristics of the continuum that are correlated with two well-known consequences of the proper forcing axiom. We find a cardinal invariant $\mathfrak{x}$ such that…
We consider the problem of describing the typical (possibly) non-linear code of minimum distance bounded from below over a large alphabet. We concentrate on block codes with the Hamming metric and on subspace codes with the injection…
We prove that on a punctured oriented surface with Euler characteristic chi < 0, the maximal cardinality of a set of essential simple arcs that are pairwise non-homotopic and intersecting at most once is 2|chi|(|chi|+1). This gives a cubic…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
A $c$-crossing-critical graph is one that has crossing number at least $c$ but each of its proper subgraphs has crossing number less than $c$. Recently, a set of explicit construction rules was identified by Bokal, Oporowski, Richter, and…
We survey optimization problems that involve the cardinality of variable vectors in constraints or the objective function. We provide a unified viewpoint on the general problem classes and models, and give concrete examples from diverse…
Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…
Combining ideas from two of our previous papers, we refine Arhangel'skii Theorem by proving a cardinal inequality of which this is a special case: any increasing union of strongly discretely Lindelof spaces with countable free sequences and…
We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \cup B$ equals that of those of $A \cup B$. The…
This is a paper that aims to interpret the cardinality of a set in terms of Baire Category, i.e. how many closed nowhere dense sets can be deleted from a set before the set itself becomes negligible. . To do this natural tree-theoretic…
The computable cross norm (CCN) criterion is a new powerful analytical and computable separability criterion for bipartite quantum states, that is also known to systematically detect bound entanglement. In certain aspects this criterion…
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer…