Related papers: Reductions Between Cardinal Characteristics of the…
The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…
Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
The Euler characteristic of a finite category is defined and shown to be compatible with Euler characteristics of other types of object, including orbifolds. A formula for the cardinality of the colimit of a diagram of sets is proved,…
We study multidimensional diagrams in independent amalgamation in the framework of abstract elementary classes (AECs). We use them to prove the eventual categoricity conjecture for AECs, assuming a large cardinal axiom. More precisely, we…
Estimating the cardinality of the output of a query is a fundamental problem in database query processing. In this article, we overview a recently published contribution that casts the cardinality estimation problem as linear optimization…
For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…
C-cross topologies are introduced. Modifcations of the Kuratowski-Ulam Theorem are considered. Cardinal invariants add, cof, cov and non with respect to meager or nowhere dense subsets are compared. Remarks on invariants cof(nwdY) are…
Based on the well-known cardinal characteristics $\mathfrak{s}$, $\mathfrak{r}$ and $\mathfrak{i}$, we introduce nine related cardinal characteristics by using the notion of asymptotic density to characterise different intersection…
The Erd\H{o}s--Gallai criteria for recognizing degree sequences of simple graphs involve a system of inequalities. Given a fixed degree sequence, we consider the list of differences of the two sides of these inequalities. These differences…
There is an optimal way to increase certain cardinal invariants of the continuum.
We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent
We prove a Galois-type correspondence between compositions of purely inseparable field extensions (including infinite ones) and subalgebras of differential operators. This correspondence can be utilized to establish a connection between…
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…
We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
Lower semi-continuity (\texttt{LSC}) is a critical assumption in many foundational optimisation theory results; however, in many cases, \texttt{LSC} is stronger than necessary. This has led to the introduction of numerous weaker continuity…
We prove that the Generalized Continuum Hypothesis holds above a supercompact cardinal assuming the Ultrapower Axiom, an abstract comparison principle motivated by inner model theory at the level of supercompact cardinals.
Using GCH, we force the following: There are continuum many simple cardinal characteristics with pairwise different values.
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This conjecture have been proved for several…