A model of Cummings and Foreman revisited

This paper concerns the model of Cummings and Foreman where from ω   supercompact cardinals they obtain the tree property at each _ℵn${\mathrm{\aleph }}_n$ for 2≤n<ω$2\le n<\omega$. We prove some structural facts about this model. We show that the combinatorics at _ℵω+1${\mathrm{\aleph }}_{\omega +1}$ in this model depend strongly on the properties of _ω1${\omega }_1$ in the ground model. From different ground models for the Cummings–Foreman iteration we can obtain either _ℵω+1∈I[_ℵω+1]${\mathrm{\aleph }}_{\omega +1}\in I[{\mathrm{\aleph }}_{\omega +1}]$ and every stationary subset of _ℵω+1${\mathrm{\aleph }}_{\omega +1}$ reflects or there are a bad scale at _ℵω${\mathrm{\aleph }}_{\omega }$ and a non-reflecting stationary subset of _ℵω+1∩cof(_ω1)${\mathrm{\aleph }}_{\omega +1}\cap \mathrm{cof}({\omega }_1)$. We also prove that regardless of the ground model a strong generalization of the tree property holds at each _ℵn${\mathrm{\aleph }}_n$ for n≥2$n\ge 2$.     

The inverse inertia problem for the complements of partial k-trees

Let F$\mathbb{F}$ be an infinite field with characteristic not equal to two. For a graph G=(V,E)$G=(V,E)$ with V={1,…,n}$V=\{1,\dots ,n\}$, let S(G;F)$S(G;\mathbb{F})$ be the set of all symmetric n×n$n\times n$ matrices A=[_ai,j]$A=[a_{i,j}]$ over F$\mathbb{F}$ with _ai,j≠0$a_{i,j}\ne 0$, i≠j$i\ne j$ if and only if ij∈E$ij\in E$. We show that if G is the complement of a partial k  -tree and m?k+2$m?k+2$, then for all nonsingular symmetric m×m$m\times m$ matrices K   over F$\mathbb{F}$, there exists an m×n$m\times n$ matrix U   such that U^TKU∈S(G;F)$U^{T}KU\in S(G;\mathbb{F})$. As a corollary we obtain that, if k+2?m?n$k+2?m?n$ and G is the complement of a partial k-tree, then for any two nonnegative integers p and q   with p+q=m$p+q=m$, there exists a matrix in S(G;R)$S(G;\mathbb{R})$ with p positive and q negative eigenvalues.     

A sharp upper bound on the signless Laplacian spectral radius of graphs

Let G be a simple connected graph of order n   with degree sequence _d1,_d2,…,_dn$d_1,d_2,\dots ,d_n$ in non-increasing order. The signless Laplacian spectral radius ρ(Q(G))$\rho (Q(G))$ of G   is the largest eigenvalue of its signless Laplacian matrix Q(G)$Q(G)$. In this paper, we give a sharp upper bound on the signless Laplacian spectral radius ρ(Q(G))$\rho (Q(G))$ in terms of _di$d_i$, which improves and generalizes some known results.     

Posets of copies of countable scattered linear orders

We show that the separative quotient of the poset 〈P(L),⊂〉$〈\mathbb{P}(L),\subset 〉$ of isomorphic suborders of a countable scattered linear order L is σ  -closed and atomless. So, under the CH, all these posets are forcing-equivalent (to (P(ω)/Fin)⁺${(P(\omega )/\mathrm{Fin})}^{+}$).     

Maximal chains of isomorphic subgraphs of countable ultrahomogeneous graphs

For a countable ultrahomogeneous graph G=〈G,ρ〉$\mathbb{G}=〈G,\rho 〉$ let P(G)$\mathbb{P}(\mathbb{G})$ denote the collection of sets A⊂G$A\subset G$ such that 〈A,ρ∩[A]²〉≅G$〈A,\rho \cap {[A]}^2〉\cong \mathbb{G}$. The order types of maximal chains in the poset 〈P(G)∪{∅},⊂〉$〈\mathbb{P}(\mathbb{G})\cup \{\varnothing \},\subset 〉$ are characterized as:     

Cascades,order, and ultrafilters

We investigate mutual behavior of cascades, contours of which are contained in a fixed ultrafilter. This allows us to prove (ZFC) that the class of strict _Jωω$J_{{\omega }^{\omega }}$-ultrafilters, introduced by J.E. Baumgartner in [2], is empty. We translate the result to the language of _<∞${<}_{\infty }$-sequences under an ultrafilter, investigated by C. Laflamme in [17], and we show that if there is an arbitrary long finite _<∞${<}_{\infty }$-sequence under u, then u   is at least a strict _Jωω+1$J_{{\omega }^{\omega +1}}$-ultrafilter.     

Sharp upper bounds on the distance spectral radius of a graph

Let M=(_mij)$M=(m_{ij})$ be a nonnegative irreducible n×n$n\times n$ matrix with diagonal entries 0. The largest eigenvalue of M is called the spectral radius of the matrix M  , denoted by ρ(M)$\rho (M)$. In this paper, we give two sharp upper bounds of the spectral radius of matrix M. As corollaries, we give two sharp upper bounds of the distance matrix of a graph.     

Positional graphs and conditional structure of weakly null sequences

We prove that, unless assuming additional set theoretical axioms, there are no reflexive spaces without unconditional sequences of the density continuum. We show that for every integer n$n$ there are normalized weakly-null sequences of length _ωn${\omega }_n$ without unconditional subsequences. This together with a result of Dodos et al. (2011) [7] shows that _ωω${\omega }_{\omega }$ is the minimal cardinal κ$\kappa$ that could possibly have the property that every weakly null κ$\kappa$-sequence has an infinite unconditional basic subsequence. We also prove that for every cardinal number κ$\kappa$ which is smaller than the first ω$\omega$-Erd?s cardinal there is a normalized weakly-null sequence without subsymmetric subsequences. Finally, we prove that mixed Tsirelson spaces of uncountable densities must always contain isomorphic copies of either _c0$c_0$ or _?p${?}_p$, with p≥1$p\ge 1$.     

Subconstituents of orthogonal graphs of odd characteristic – continued

The subconstituents of the orthogonal graph O(2ν+δ,q)$O(2\nu +\delta ,q)$, where ν?2$\nu ?2$ and δ∈{1,2}$\delta \in \{1,2\}$, over a finite field of odd characteristic are shown to be quasi-strongly regular. Furthermore, the first subconstituent is shown to be co-edge regular, and when ν?3$\nu ?3$ its automorphism group is determined. The second subconstituent is shown to be edge regular, and when ν?2$\nu ?2$ its automorphism group is determined. Their parameters and chromatic numbers are also determined.     

Zeros of the Macdonald function of complex order

The z  -zeros of the modified Bessel function of the third kind _Kν(z)$K_{\nu }(z)$, also known as modified Hankel function or Macdonald function, are considered for arbitrary complex values of the order ν$\nu$. Approximate expressions for the zeros, applicable in the cases of very small or very large |ν|$\left|\nu \right|$, are given. The behaviour of the zeros for varying |ν|$\left|\nu \right|$ or argν$\arg \nu$, obtained numerically, is illustrated by means of some graphics.     

On an open problem concerning total domination critical graphs

A graph G   with no isolated vertex is total domination vertex critical if for any vertex v$v$ of G   that is not adjacent to a vertex of degree one, the total domination number of G-v$G-v$ is less than the total domination number of G  . We call these graphs _γt${\gamma }_t$-critical. If such a graph G has total domination number k, we call it k  -_γt${\gamma }_t$-critical. We verify an open problem of k  -_γt${\gamma }_t$-critical graphs and obtain some results on the characterization of total domination critical graphs of order n=Δ(G)(_γt(G)-1)+1$n=\Delta (G)({\gamma }_t(G)-1)+1$.     

Consistency,optimality, and incompleteness

Assume that the problem _P0$P_0$ is not solvable in polynomial time. Let T   be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{_ConT}$T\cup \{{\mathit{Con}}_T\}$ as the minimal extension of T   proving for some algorithm that it decides _P0$P_0$ as fast as any algorithm B$\mathbb{B}$ with the property that T   proves that B$\mathbb{B}$ decides _P0$P_0$. Here, _ConT${\mathit{Con}}_T$ claims the consistency of T. As a byproduct, we obtain a version of Gödel?s Second Incompleteness Theorem. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.     

Concentration and multiplicity of solutions for a fourth-order equation with critical nonlinearity

In this paper, we consider the problem (_Pε)$(P_{\epsilon })$ : Δ²u=u^n+4/n-4+εu,u>0${\mathrm{\Delta }}^{2}u=u^{n+4/n-4}+\epsilon u,u>0$ in Ω,u=Δu=0$\Omega ,u=\mathrm{\Delta }u=0$ on ∂Ω$\mathrm{\partial }\Omega$, where Ω$\Omega$ is a bounded and smooth domain in Rⁿ,n>8${\mathbb{R}}^n,n>8$ and ε>0$\epsilon >0$. We analyze the asymptotic behavior of solutions of (_Pε)$(P_{\epsilon })$ which are minimizing for the Sobolev inequality as ε→0$\epsilon \to 0$ and we prove existence of solutions to (_Pε)$(P_{\epsilon })$ which blow up and concentrate around a critical point of the Robin's function. Finally, we show that for ε$\epsilon$ small, (_Pε)$(P_{\epsilon })$ has at least as many solutions as the Ljusternik–Schnirelman category of Ω$\Omega$.     

Inequivalent representations of matroids over prime fields

It is proved that for each prime field GF(p)$\mathit{GF}(p)$, there is an integer _np$n_p$ such that a 4-connected matroid has at most _np$n_p$ inequivalent representations over GF(p)$\mathit{GF}(p)$. We also prove a stronger theorem that obtains the same conclusion for matroids satisfying a connectivity condition, intermediate between 3-connectivity and 4-connectivity that we term “k-coherence”.     

On affine motions and universal rigidity of tensegrity frameworks

Recently, Alfakih and Ye (2013) [4] proved that if an r  -dimensional bar framework (G,p)$(G,p)$ on n?r+2$n?r+2$ nodes in general position in R^r${\mathbb{R}}^r$ admits a positive semidefinite stress matrix with rank n−r−1$n-r-1$, then (G,p)$(G,p)$ is universally rigid. In this paper, we generalize this result in two directions. First, we extend this result to tensegrity frameworks. Second, we replace the general position assumption by the weaker assumption that in configuration p, each point and its neighbors in G   affinely span R^r${\mathbb{R}}^r$.     

On the least distance eigenvalue of a graph

Denote by D(G)=_(di,j)n×n$D(G)={(d_{i,j})}_{n\times n}$ the distance matrix of a connected graph G with n   vertices, where _dij$d_{ij}$ is equal to the distance between vertices _vi$v_i$ and _vj$v_j$ in G  . The least eigenvalue of D(G)$D(G)$ is called the least distance eigenvalue of G  , denoted by _λn${\lambda }_n$. In this paper, we determine all the graphs with _λn∈[−2.383,0]${\lambda }_n\in [-2.383,0]$.     

On oriented graphs whose skew spectral radii do not exceed 2

Let S(G^σ)$S(G^{\sigma })$ be the skew adjacency matrix of the oriented graph G^σ$G^{\sigma }$ of order n   and _λ1,_λ2,…,_λn${\lambda }_1,{\lambda }_2,\dots ,{\lambda }_n$ be all eigenvalues of S(G^σ)$S(G^{\sigma })$. The skew spectral radius _ρs(G^σ)${\rho }_s(G^{\sigma })$ of G^σ$G^{\sigma }$ is defined as max{|_λ1|,|_λ2|,…,|_λn|}$\max \{|{\lambda }_1|,|{\lambda }_2|,\dots ,|{\lambda }_n|\}$. In this paper, we investigate oriented graphs whose skew spectral radii do not exceed 2.