We introduce a new method which combines Prikry forcing with an iteration between the Prikry points. Using our method we prove from large cardinals that it is consistent that the tree property holds at ℵₙ for n ≥ 2, ${\aleph }_{\omega }$ is strong limit and $2^{{\aleph }_{\omega }}={\aleph }_{\omega +2}$.

One way to generalize complete Erdős space ${}_c$ is to consider uncountable products of zero-dimensional $G_{\delta }$-subsets of the real line, intersected with an appropriate Banach space. The resulting (nonseparable) complete Erdős spaces can be fully classified by only two cardinal invariants, as done in an earlier paper of the authors together with J. van Mill. As we think this is the correct way to generalize the concept of complete Erdős space to a nonseparable setting, natural questions arise...

A graph $G$ is a $k$-tree if either $G$ is the complete graph on $k+1$ vertices, or $G$ has a vertex $v$ whose neighborhood is a clique of order $k$ and the graph obtained by removing $v$ from $G$ is also a $k$-tree. Clearly, a $k$-tree has at least $k+1$ vertices, and $G$ is a 1-tree (usual tree) if and only if it is a $1$-connected graph and has no $K_3$-minor. In this paper, motivated by some properties of 2-trees, we obtain a characterization of $k$-trees as follows: if $G$ is a graph with at least $k+1$ vertices, then $G$ is...

The topology and combinatorial structure of the Mandelbrot set ${ℳ}^d$ (of degree d ≥ 2) can be studied using symbolic dynamics. Each parameter is mapped to a kneading sequence, or equivalently, an internal address; but not every such sequence is realized by a parameter in ${ℳ}^d$. Thus the abstract Mandelbrot set is a subspace of a larger, partially ordered symbol space, ${\Lambda }^d$. In this paper we find an algorithm to construct “visible trees” from symbolic sequences which works whether or not the sequence...

Let λ be an infinite cardinal number. The ordinal number δ(λ) is the least ordinal γ such that if ϕ is any sentence of $L_{\lambda ⁺\omega }$, with a unary predicate D and a binary predicate ≺, and ϕ has a model ℳ with $⟨D^{ℳ},{\prec }^{ℳ}⟩$ a well-ordering of type ≥ γ, then ϕ has a model ℳ ’ where $⟨D^{{ℳ}^{\text{'}}},{\prec }^{{ℳ}^{\text{'}}}⟩$ is non-well-ordered. One of the interesting properties of this number is that the Hanf number of $L_{\lambda ⁺\omega }$ is exactly ${\beth }_{\delta \left(\lambda \right)}$. It was proved in [BK71] that if ℵ₀ < λ < κ$areregularcardinalnumbers,thenthereisaforcingextension,preservingcofinalities,suchthatintheextension$2λ = κ$and\delta \left(\lambda \right)<\lambda ⁺⁺.Weimprovethisresultbyprovingthefollowing:Suppose\aleph ₀<\lambda <\theta \le \kappa arecardinalnumberssuchthat$∙ ${\lambda }^{<\lambda }=\lambda$; ∙ cf(θ) ≥ λ⁺ and ${\mu }^{\lambda }<\theta$ whenever μ < θ; ∙ ${\kappa }^{\lambda }=\kappa$. Then there...

A proper coloring $c:V\left(G\right)\to \{1,2,...,k\}$, $k\ge 2$ of a graph $G$ is called a graceful $k$-coloring if the induced edge coloring $c^{\text{'}}:E\left(G\right)\to \{1,2,...,k-1\}$ defined by $c^{\text{'}}\left(uv\right)=|c\left(u\right)-c\left(v\right)|$ for each edge $uv$ of $G$ is also proper. The minimum integer $k$ for which $G$ has a graceful $k$-coloring is the graceful chromatic number ${\chi }_g\left(G\right)$. It is known that if $T$ is a tree with maximum degree $\Delta$, then ${\chi }_g\left(T\right)\le \lceil \frac{5}{3}\Delta \rceil$ and this bound is best possible. It is shown for each integer $\Delta \ge 2$ that there is an infinite class of trees $T$ with maximum degree $\Delta$ such that ${\chi }_g\left(T\right)=\lceil \frac{5}{3}\Delta \rceil$. In particular, we investigate for each...

Let T¹ₙ = (V,E₁) and T²ₙ = (V,E₂) be the trees on n vertices with $V=v₀,v₁,...,v_{n-1}$, $E₁=v₀v₁,...,v₀v_{n-3},v_{n-4}{v}_{n-2},v_{n-3}{v}_{n-1}$ and $E₂=v₀v₁,...,v₀v_{n-3},v_{n-3}{v}_{n-2},v_{n-3}{v}_{n-1}$. For p ≥ n ≥ 5 we obtain explicit formulas for ex(p;T¹ₙ) and ex(p;T²ₙ), where ex(p;L) denotes the maximal number of edges in a graph of order p not containing L as a subgraph. Let r(G₁,G₂) be the Ramsey number of the two graphs G₁ and G₂. We also obtain some explicit formulas for $r(Tₘ,T{ₙ}^i)$, where i ∈ 1,2 and Tₘ is a tree on m vertices with Δ(Tₘ) ≤ m - 3.

Let (α) denote the class of all cardinal sequences of length α associated with compact scattered spaces (or equivalently, superatomic Boolean algebras). Also put ${}_{\lambda }\left(\alpha \right)=s\in \left(\alpha \right):s\left(0\right)=\lambda =min\left[s\right(\beta ):\beta <\alpha ]$. We show that f ∈ (α) iff for some natural number n there are infinite cardinals $\lambda ₀i>\lambda ₁>...>{\lambda }_{n-1}$ and ordinals $\alpha ₀,...,{\alpha }_{n-1}$ such that $\alpha =\alpha ₀+\cdots +{\alpha }_{n-1}$ and $f=f₀⏜f₁⏜...⏜f_{n-1}$ where each $f_i{\in }_{{\lambda }_i}\left({\alpha }_i\right)$. Under GCH we prove that if α < ω₂ then (i) ${}_{\omega }\left(\alpha \right)=s{\in }^{\alpha }\omega ,\omega ₁:s\left(0\right)=\omega$; (ii) if λ > cf(λ) = ω, ${}_{\lambda }\left(\alpha \right)=s{\in }^{\alpha }\lambda ,\lambda ⁺:s\left(0\right)=\lambda ,s^{-1}\lambda is\omega ₁-closedin\alpha$; (iii) if cf(λ) = ω₁, ${}_{\lambda }\left(\alpha \right)=s{\in }^{\alpha }\lambda ,\lambda ⁺:s\left(0\right)=\lambda ,s^{-1}\lambda is\omega -closedandsuccessor-closedin\alpha$; (iv) if cf(λ) > ω₁, ${}_{\lambda }\left(\alpha \right){=}^{\alpha }\lambda$. This yields a complete characterization of the classes (α) for all...

We prove that ${♦}^{*}$ implies there is a zero-dimensional Hausdorff Lindelöf space of cardinality $2^{{\aleph }_1}$ which has points $G_{\delta }$. In addition, this space has the property that it need not be Lindelöf after countably closed forcing.

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing previous work of the author. A cardinal κ is characterized by a Scott sentence ${\varphi }_{ℳ}$ if ${\varphi }_{ℳ}$ has a model of size κ, but no model of size κ⁺. The main question in this paper is the following: Are the characterizable cardinals closed under the powerset operation? We prove that if ${\aleph }_{\beta }$ is characterized by a Scott sentence, then $2^{{\aleph }_{\beta +\beta ₁}}$ is (homogeneously) characterized by a Scott sentence, for all 0 <...

We lower substantially the strength of the assumptions needed for the validity of certain results in category theory and homotopy theory which were known to follow from Vopěnka’s principle. We prove that the necessary large-cardinal hypotheses depend on the complexity of the formulas defining the given classes, in the sense of the Lévy hierarchy. For example, the statement that, for a class $𝒮$ of morphisms in a locally presentable category $𝒞$ of structures, the orthogonal class of objects...

We prove that if $X$ is a first countable space with property $\left(DC\left({\omega }_1\right)\right)$ and with a $G_{\delta }$-diagonal then the cardinality of $X$ is at most $𝔠$. We also show that if $X$ is a first countable, DCCC, normal space then the extent of $X$ is at most $𝔠$.

For any two positive integers $n$ and $k\ge 2$, let $G(n,k)$ be a digraph whose set of vertices is $\{0,1,...,n-1\}$ and such that there is a directed edge from a vertex $a$ to a vertex $b$ if $a^k\equiv b(modn)$. Let $n={\prod }_{i=1}^r{p}_i^{e_i}$ be the prime factorization of $n$. Let $P$ be the set of all primes dividing $n$ and let $P_1,P_2\subseteq P$ be such that $P_1\cup P_2=P$ and $P_1\cap P_2=\varnothing$. A fundamental constituent of $G(n,k)$, denoted by $G_{P_2}^{*}(n,k)$, is a subdigraph of $G(n,k)$ induced on the set of vertices which are multiples of ${\prod }_{p_i\in P_2}{p}_i$ and are relatively prime to all primes $q\in P_1$. L. Somer and M. Křížek proved that the trees attached...

We generalize the notion of a fat subset of a regular cardinal κ to a fat subset of $P_{\kappa }\left(X\right)$, where κ ⊆ X. Suppose μ < κ, ${\mu }^{<\mu }=\mu$, and κ is supercompact. Then there is a generic extension in which κ = μ⁺⁺, and for all regular λ ≥ μ⁺⁺, there are stationarily many N in ${\left[H\left(\lambda \right)\right]}^{\mu ⁺}$ which are internally club but not internally approachable.

Let a space $X$ be Tychonoff product ${\prod }_{\alpha <\tau }{X}_{\alpha }$ of $\tau$-many Tychonoff nonsingle point spaces $X_{\alpha }$. Let Suslin number of $X$ be strictly less than the cofinality of $\tau$. Then we show that every point of remainder is a non-normality point of its Čech–Stone compactification $\beta X$. In particular, this is true if $X$ is either $R^{\tau }$ or ${\omega }^{\tau }$ and a cardinal $\tau$ is infinite and not countably cofinal.

Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f:V(G) → 0,1,2,...,m that induces a labeling f’: E(G) → 1,2,...,m of the edges of G defined by f’(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a γ-labeling f is $val\left(f\right)={\Sigma }_{e\in E\left(G\right)}{f}^{\text{'}}K\left(e\right)$. The maximum value of a γ-labeling of G is defined as $va{l}_{max}\left(G\right)=maxval\left(f\right):fisa\gamma -labelingofG$; while the minimum value of a γ-labeling of G is $va{l}_{min}\left(G\right)=minval\left(f\right):fisa\gamma -labelingofG$; The values $va{l}_{max}\left(S_{p,q}\right)$ and $va{l}_{min}\left(S_{p,q}\right)$ are determined for double stars $S_{p,q}$. We present characterizations of connected graphs G of order n for which...

We show that every operator from ${\ell }_s$ to ${\ell }_p\otimes ̂{\ell }_q$ is compact when 1 ≤ p,q < s and that every operator from ${\ell }_s$ to ${\ell }_p\widehat{\otimes ̂}{\ell }_q$ is compact when 1/p + 1/q > 1 + 1/s.

We investigate the question whether a system ${\left(E_i\right)}_{i\in I}$ of homogeneous linear equations over $\mathbb{Z}$ is non-trivially solvable in $\mathbb{Z}$ provided that each subsystem ${\left(E_j\right)}_{j\in J}$ with $\left|J\right|\le c$ is non-trivially solvable in $\mathbb{Z}$ where $c$ is a fixed cardinal number such that $c<\left|I\right|$. Among other results, we establish the following. (a) The answer is ‘No’ in the finite case (i.e., $I$ being finite). (b) The answer is ‘No’ in the denumerable case (i.e., $\left|I\right|={\aleph }_0$ and $c$ a natural number). (c) The answer in case that $I$ is uncountable and $c\le {\aleph }_0$ is ‘No...

The cardinal invariants $𝔥,𝔟,𝔰$ of $𝒫\left(\omega \right)$ are known to satisfy that ${\omega }_1\le 𝔥\le min\{𝔟,𝔰\}$. We prove that all inequalities can be strict. We also introduce a new upper bound for $𝔥$ and show that it can be less than $𝔰$. The key method is to utilize finite support matrix iterations of ccc posets following paper Ultrafilters with small generating sets by A. Blass and S. Shelah (1989).

Let $T_1,\cdots ,T_d$ be homogeneous trees with degrees $q_1+1,\cdots ,q_d+1\ge 3$, respectively. For each tree, let $𝔥:T_j\to \mathbb{Z}$ be the Busemann function with respect to a fixed boundary point (end). Its level sets are the horocycles. The horocyclic product of $T_1,\cdots ,T_d$ is the graph $\mathrm{𝖣𝖫}(q_1,\cdots ,q_d)$ consisting of all $d$-tuples $x_1\cdots x_d\in T_1\times \cdots \times T_d$ with $𝔥\left(x_1\right)+\cdots +𝔥\left(x_d\right)=0$, equipped with a natural neighbourhood relation. In the present paper, we explore the geometric, algebraic, analytic and probabilistic properties of these graphs and their isometry groups. If $d=2$ and $q_1=q_2=q$ then we obtain a Cayley graph...