A real matrix $A$ is a G-matrix if $A$ is nonsingular and there exist nonsingular diagonal matrices $D_1$ and $D_2$ such that $A^{-\mathrm{T}}=D_{1}A{D}_2$, where $A^{-\mathrm{T}}$ denotes the transpose of the inverse of $A$. Denote by $J=\mathrm{diag}(\pm 1)$ a diagonal (signature) matrix, each of whose diagonal entries is $+1$ or $-1$. A nonsingular real matrix $Q$ is called $J$-orthogonal if $Q^{\mathrm{T}}JQ=J$. Many connections are established between these matrices. In particular, a matrix $A$ is a G-matrix if and only if $A$ is diagonally (with positive diagonals) equivalent to a column permutation...

A subset of a product of topological spaces is called $n$-thin if every its two distinct points differ in at least $n$ coordinates. We generalize a construction of Gruenhage, Natkaniec, and Piotrowski, and obtain, under CH, a countable $T_3$ space $X$ without isolated points such that $X^n$ contains an $n$-thin dense subset, but $X^{n+1}$ does not contain any $n$-thin dense subset. We also observe that part of the construction can be carried out under MA.

The first author has recently proved that if f: X → Y is a k-dimensional map between compacta and Y is p-dimensional (0 ≤ k, p < ∞), then for each 0 ≤ i ≤ p + k, the set of maps g in the space $C(X,I^{p+2k+1-i})$ such that the diagonal product $f\times g:X\to Y\times I^{p+2k+1-i}$ is an (i+1)-to-1 map is a dense $G_{\delta }$-subset of $C(X,I^{p+2k+1-i})$. In this paper, we prove that if f: X → Y is as above and $D_j$ (j = 1,..., k) are superdendrites, then the set of maps h in $C(X,{\prod }_{j=1}^k{D}_j\times I^{p+1-i})$ such that $f\times h:X\to Y\times \left({\prod }_{j=1}^k{D}_j\times I^{p+1-i}\right)$ is (i+1)-to-1 is a dense $G_{\delta }$-subset of $C(X,{\prod }_{j=1}^k{D}_j\times I^{p+1-i})$ for each 0 ≤ i ≤ p.

Denote by spanf₁,f₂,... the collection of all finite linear combinations of the functions f₁,f₂,... over ℝ. The principal result of the paper is the following. Theorem (Full Clarkson-Erdős-Schwartz Theorem). Suppose ${\left({\lambda }_j\right)}_{j=1}^{\infty }$ is a sequence of distinct positive numbers. Then $span1,x^{\lambda ₁},x^{\lambda ₂},...$ is dense in C[0,1] if and only if ${\sum }_{j=1}^{\infty }\left({\lambda }_j\right)/({\lambda }_j²+1)=\infty$. Moreover, if ${\sum }_{j=1}^{\infty }\left({\lambda }_j\right)/({\lambda }_j²+1)<\infty$, then every function from the C[0,1] closure of $span1,x^{\lambda ₁},x^{\lambda ₂},...$ can be represented as an analytic function on z ∈ ℂ ∖ (-∞, 0]: |z| < 1 restricted to (0,1). This result improves an...

We investigate the problem of counting the real or complex Hadamard matrices which are circulant, by using analytic methods. Our main observation is the fact that for $|q_0|=...=|q_{N-1}|=1$ the quantity $\Phi ={\sum }_{i+k=j+l}\frac{q_i{q}_k}{q_j{q}_l}$ satisfies $\Phi \ge N^2$, with equality if and only if $q=\left(q_i\right)$ is the eigenvalue vector of a rescaled circulant complex Hadamard matrix. This suggests three analytic problems, namely: (1) the brute-force minimization of $\Phi$, (2) the study of the critical points of $\Phi$, and (3) the computation of the moments of $\Phi$. We explore here...

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

We study combinatorial properties of the partial order (Dense(ℚ),⊆). To do that we introduce cardinal invariants ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$ describing properties of Dense(ℚ). These invariants satisfy ${}_{\mathbb{Q}}$ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ$.WecomparethemwiththeiranaloguesinthewellstudiedBooleanalgebra\left(\omega \right)/fin.Weshowthat$ℚ = p$,$ℚ = t$and$ℚ = i$,whereas$ℚ > h$and$ℚ > r$arebothshowntoberelativelyconsistentwithZFC.Wealsoinvestigatecombinatoricsoftheidealnwdofnowheredensesubsetsof,\mathbb{Q}.Inparticular,weshowthat$non(M)=min||: ⊆ Dense(R) ∧ (∀I ∈ nwd(R))(∃D ∈ )(I ∩ D = ∅) and cof(M) = min||: ⊆ Dense(ℚ) ∧ (∀I ∈ nwd)(∃D ∈ )(I ∩ = ∅). We use these facts to show that cof(M) ≤ i, which improves a result of S. Shelah.

Suppose that $A$ is a real symmetric matrix of order $n$. Denote by $m_A\left(0\right)$ the nullity of $A$. For a nonempty subset $\alpha$ of $\{1,2,...,n\}$, let $A\left(\alpha \right)$ be the principal submatrix of $A$ obtained from $A$ by deleting the rows and columns indexed by $\alpha$. When $m_{A\left(\alpha \right)}\left(0\right)=m_A\left(0\right)+\left|\alpha \right|$, we call $\alpha$ a P-set of $A$. It is known that every P-set of $A$ contains at most $\lfloor n/2\rfloor$ elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As...

We prove that on ${ℝ}^N$, there is no n-supercyclic operator with 1 ≤ n < ⌊(N + 1)/2⌋, i.e. if ${ℝ}^N$ has an n-dimensional subspace whose orbit under $T\in \left({ℝ}^N\right)$ is dense in ${ℝ}^N$, then n is greater than ⌊(N + 1)/2⌋. Moreover, this value is optimal. We then consider the case of strongly n-supercyclic operators. An operator $T\in \left({ℝ}^N\right)$ is strongly n-supercyclic if ${ℝ}^N$ has an n-dimensional subspace whose orbit under T is dense in $\mathbb{P}ₙ\left({ℝ}^N\right)$, the nth Grassmannian. We prove that strong n-supercyclicity does not occur non-trivially...

Consider a $N\times n$ non-centered matrix ${𝛴}_n$ with a separable variance profile: $${𝛴}_n=\frac{D_n^{1/2}{X}_n{\tilde{D}}_n^{1/2}}{\sqrt{n}}+A_n.$$ Matrices $D_n$ and ${\tilde{D}}_n$ are non-negative deterministic diagonal, while matrix $A_n$ is deterministic, and $X_n$ is a random matrix with complex independent and identically distributed random variables, each with mean zero and variance one. Denote by $Q_n\left(z\right)$ the resolvent associated to ${𝛴}_n{𝛴}_n^{*}$, i.e. $$Q_n\left(z\right)={\left({𝛴}_n{𝛴}_n^{*}-z{I}_N\right)}^{-1}.$$ Given two sequences of deterministic vectors $\left(u_n\right)$ and $\left(v_n\right)$ with bounded Euclidean norms, we study the limiting behavior of the random bilinear form:...

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 $𝔠$.

Let $G$ be a simple connected graph with vertex set $V\left(G\right)=\{v_1,v_2,\cdots ,v_n\}$ and edge set $E\left(G\right)$, and let $d_{v_i}$ be the degree of the vertex $v_i$. Let $D\left(G\right)$ be the distance matrix and let $T_r\left(G\right)$ be the diagonal matrix of the vertex transmissions of $G$. The generalized distance matrix of $G$ is defined as $D_{\alpha }\left(G\right)=\alpha T_r\left(G\right)+(1-\alpha )D\left(G\right)$, where $0\le \alpha \le 1$. Let ${\lambda }_1\left(D_{\alpha }\left(G\right)\right)\ge {\lambda }_2\left(D_{\alpha }\left(G\right)\right)\ge ...\ge {\lambda }_n\left(D_{\alpha }\left(G\right)\right)$ be the generalized distance eigenvalues of $G$, and let $k$ be an integer with $1\le k\le n$. We denote by $S_k\left(D_{\alpha }\left(G\right)\right)={\lambda }_1\left(D_{\alpha }\left(G\right)\right)+{\lambda }_2\left(D_{\alpha }\left(G\right)\right)+...+{\lambda }_k\left(D_{\alpha }\left(G\right)\right)$ the sum of the $k$ largest generalized distance eigenvalues. The generalized distance spread of a graph $G$ is defined as $D_{\alpha }S\left(G\right)={\lambda }_1\left(D_{\alpha }\left(G\right)\right)-{\lambda }_n\left(D_{\alpha }\left(G\right)\right)$....

Let $X$ be a zero-dimensional space and $C_c\left(X\right)$ be the set of all continuous real valued functions on $X$ with countable image. In this article we denote by $C_c^K\left(X\right)$ (resp., $C_c^{\psi }\left(X\right))$ the set of all functions in $C_c\left(X\right)$ with compact (resp., pseudocompact) support. First, we observe that $C_c^K\left(X\right)=O_c^{{\beta }_{0}X\setminus X}$ (resp., $C_c^{\psi }\left(X\right)=M_c^{{\beta }_{0}X\setminus {\upsilon }_{0}X}$), where ${\beta }_{0}X$ is the Banaschewski compactification of $X$ and ${\upsilon }_{0}X$ is the $\mathbb{N}$-compactification of $X$. This implies that for an $\mathbb{N}$-compact space $X$, the intersection of all free maximal ideals in $C_c\left(X\right)$ is equal to $C_c^K\left(X\right)$, i.e., $M_c^{{\beta }_{0}X\setminus X}=C_c^K\left(X\right)$. By applying...

A symmetric positive semi-definite matrix $A$ is called completely positive if there exists a matrix $B$ with nonnegative entries such that $A=B{B}^{\top }$. If $B$ is such a matrix with a minimal number $p$ of columns, then $p$ is called the cp-rank of $A$. In this paper we develop a finite and exact algorithm to factorize any matrix $A$ of cp-rank $3$. Failure of this algorithm implies that $A$ does not have cp-rank $3$. Our motivation stems from the question if there exist three nonnegative polynomials of degree at...

Let $\left\{X_{ij}\right\}$, $i,j=\cdots$, be a double array of independent and identically distributed (i.i.d.) real random variables with $E{X}_{11}=\mu$, $E|X_{11}{-\mu |}^2=1$ and $E|X_{11}{|}^{4}lt;\infty$. Consider sample covariance matrices (with/without empirical centering) $𝒮=\frac{1}{n}{\sum }_{j=1}^n({𝐬}_j-\overline{𝐬}){({𝐬}_j-\overline{𝐬})}^T$ and $𝐒=\frac{1}{n}{\sum }_{j=1}^n{𝐬}_j{𝐬}_j^T$, where $\overline{𝐬}=\frac{1}{n}{\sum }_{j=1}^n{𝐬}_j$ and ${𝐬}_j={𝐓}_n^{1/2}{(X_{1j},...,X_{pj})}^T$ with ${\left({𝐓}_n^{1/2}\right)}^2={𝐓}_n$, non-random symmetric non-negative definite matrix. It is proved that central limit theorems of eigenvalue statistics of $𝒮$ and $𝐒$ are different as $n\to \infty$ with $p/n$ approaching a positive constant. Moreover, it is also proved that such a different behavior is not observed in the...

For a sequence x ∈ ℓ₁∖c₀₀, one can consider the set E(x) of all subsums of the series ${\sum }_{n=1}^{\infty }x\left(n\right)$. Guthrie and Nymann proved that E(x) is one of the following types of sets: () a finite union of closed intervals; () homeomorphic to the Cantor set; homeomorphic to the set T of subsums of ${\sum }_{n=1}^{\infty }b\left(n\right)$ where b(2n-1) = 3/4ⁿ and b(2n) = 2/4ⁿ. Denote by ℐ, and the sets of all sequences x ∈ ℓ₁∖c₀₀ such that E(x) has the property (ℐ), () and ( ), respectively. We show that ℐ and are strongly -algebrable and is -lineable....

Given any compact manifold $M$, we construct a non-empty open subset $𝒪$ of the space ${\mathrm{Diff}}^1\left(M\right)$ of $C^1$-diffeomorphisms and a dense subset $𝒟\subset 𝒪$ such that the centralizer of every diffeomorphism in $𝒟$ is uncountable, hence non-trivial.

Consider the $n\times n$ matrix with $(i,j)$’th entry $gcd(i,j)$. Its largest eigenvalue ${\lambda }_n$ and sum of entries $s_n$ satisfy ${\lambda }_n>s_n/n$. Because $s_n$ cannot be expressed algebraically as a function of $n$, we underestimate it in several ways. In examples, we compare the bounds so obtained with one another and with a bound from S. Hong, R. Loewy (2004). We also conjecture that ${\lambda }_n>6{\pi }^{-2}nlogn$ for all $n$. If $n$ is large enough, this follows from F. Balatoni (1969).