Related papers: Splitting number
Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…
We investigate the provability of classical combinatorial theorems in ZF. Using combinatorial arguments, we establish the following results for each infinite cardinal ${\kappa}\in On$, (1) ${\kappa}^+\to ({\kappa},{\omega}+1)$, (2) any…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.
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 study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contributes to the spectacular properties of the homomorphism…
We show that in any infinitely distributive inverse semigroup the existing binary meets distribute over all the joins that exist.
We study the exponentially small splitting of separatrices in an analytic one-parameter family of area-preserving maps that generically unfolds a 1:3 resonance. Near the resonance the normal form theory predicts existence of a small…
We prove a strong dichotomy result for countably-infinite oriented graphs; that is, we prove that for all countably-infinite oriented graphs $G$, either (i) there is a countably-infinite tournament $K$ such that $G\not\subseteq K$, or (ii)…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…
In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…
In this paper, we shall prove, for any $m\geq 1$, the existence of an uncountable subset of $U$-numbers of type $\leq m$ (which we called the set of {\it $m$-ultra numbers}) for which there exists uncountably many transcendental analytic…
Although Zermelo-Fraenkel set theory (ZFC) is generally accepted as the appropriate foundation for modern mathematics, proof theorists have known for decades that virtually all mainstream mathematics can actually be formalized in much…
We study the structure of the codifferent and of additively indecomposable integers in families of totally real cubic fields. We prove that for cubic orders in these fields, the minimal trace of indecomposable integers multiplied by totally…
Let f_t , where t is close to zero, be an analytic family of plane-to-plane mappings. There are presented effective methods of computing the number of cusps of f_t emanating from the origin and having positive/negative cusp degree.
A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof…