A decomposition theorem for an analytic function

Let f(z), an analytic function with radius of convergence R (0 < R < ∞) be represented by the gap series ∑_{k = 0}^∞c_kz^λ_k. Set and define the growth constants ?, λ, T, t by

$\text{?}\text{λ}\text{=}\text{lim sup}\text{r→R}\text{inf}\text{{}\text{log}\text{[Rr /(R?r)]}{}^{\mathrm{?1}}\text{log}{}^{\mathrm{+}}\text{log}{}^{\mathrm{+}}\text{M(r)}}$

, and if 0 < ? < ∞,

$\text{T}\text{t}\text{=}\text{lim sup}\text{r→R}\text{inf}\text{{[Rr /(R?r)]}{}^{\mathrm{??}}\text{log}{}^{\mathrm{+}}\text{M(r)}}$

. Then, assuming 0 < t < T < ∞, we obtain a decomposition theorem for f(z).     

Minimally k-connected graphs of low order and maximal size

Let G be a minimally k-connected graph of order n and size e(G).Mader [4] proved that (i) $\text{e(G)?kn?(}\text{k+1}\text{2}\text{)}$; (ii) e(G)?k(n?k) if n?3k?2, and the complete bipartite graph K_k,n?k is the only minimally k-connected graph of order; n and size k(n?k) when k?2 and n?3k?1.The purpose of the present paper is to determine all minimally k-connected graphs of low order and maximal size. For each n such that k+1?n?3k?2 we prove $\text{e(G)??}\text{(n+k)}{}^2\text{8}\text{?}$ and characterize all minimally k-connected graphs of order n and size $\text{?(}\text{(n+k)}{}^2\text{8}\text{?}$.     

The probability that k positive integers are relatively r-prime

If r, k are positive integers, then $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ denotes the number of k-tuples of positive integers (x₁, x₂, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r = 1. An explicit formula for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}$ is derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(n)}\text{n}{}^{\mathrm{k}}\text{=}\text{1}\text{ζ(rk)}$.If S = {p₁, p₂, …, p_a} is a finite set of primes, then 〈S〉 = {p₁^a₁p₂^a₂…p_s^a_s; p_i ∈ S and a_i ≥ 0 for all i} and $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ denotes the number of k-tuples (x₁, x₃, …, x_k) with 1 ≤ x_i ≤ n and (x₁, x₂, …, x_k)_r ∈ 〈S〉. Asymptotic formulas for $\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}$ are derived and it is shown that $\text{lim}{}_{\mathrm{n\to \infty }}\text{T}{}_{\mathrm{k}}{}^{\mathrm{r}}\text{(S, n)}\text{n}{}^{\mathrm{k}}\text{=}\text{(p}{}_1\text{… p}{}_{\mathrm{a}}\text{)}{}^{\mathrm{rk}}\text{ζ(rk)(p}{}_1{}^{\mathrm{rk}}\text{? 1) … (p}{}_{\mathrm{s}}{}^{\mathrm{rk}}\text{? 1)}$.     

On the length of optimal TSP circuits in sets of bounded diameter

Let V be a set of n points in R^k. Let d(V) denote the diameter of V, and l(V) denote the length of the shortest circuit which passes through all the points of V. (Such a circuit is an “optimal TSP circuit”.) l^k(n) are the extremal values of l(V) defined by l^k(n)=max{l(V)|V∈V_n^k}, where V_n^k={V|V?R^k,|V|=n, d(V)=1}. A set V∈V_n^k is “longest” if l(V)=l^k(n). In this paper, first some geometrical properties of longest sets in R² are studied which are used to obtain l²(n) for small n′s, and then asymptotic bounds on l^k(n) are derived. Let δ(V) denote the minimal distance between a pair of points in V, and let: δ^k(n)=max{δ(V)|V∈V_n^k}. It is easily observed that $\text{δ}{}^{\mathrm{k}}\text{(n)=O(n}{}^{\mathrm{<mtext>?1</mtext><mtext>k</mtext>}}\text{)}$. Hence, $\text{c}{}_{\mathrm{k}}\text{=}\text{lim sup}{}_{\mathrm{n\to \infty }}\text{δ}{}^{\mathrm{k}}\text{(n)n}{}^{\mathrm{<mtext>1</mtext><mtext>k</mtext>}}$ exists. It is shown that for all $\text{n, c}{}_{\mathrm{k}}\text{n}{}^{\mathrm{<mtext>?1</mtext><mtext>k</mtext>}}\text{≤δ}{}^{\mathrm{k}}\text{(n)}$, and hence, for all $\text{n, l}{}^{\mathrm{k}}\text{(n)≥ c}{}_{\mathrm{k}}\text{n}{}^{\mathrm{<mtext>1?1</mtext><mtext>k</mtext>}}$. For k=2, this implies that $\text{l}{}^2\text{(n)≥(}\text{π}{}^2\text{12}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>4</mtext>}}\text{n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$, which generalizes an observation of Fejes-Toth that $\text{lim}{}_{\mathrm{n\to \infty }}\text{l}{}^2\text{(n)n}{}^{\mathrm{<mtext>?1</mtext><mtext>2</mtext>}}\text{≥(}\text{π}{}^2\text{12}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>4</mtext>}}$. It is also shown that $\text{l}{}^{\mathrm{k}}\text{(n) ≤ [}\text{(3?√3)k}\text{(k?1)}\text{]nδ}{}^{\mathrm{k}}\text{(n) + o(n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{) ≤ [}\text{(3?√3)k}\text{(k?1)}\text{]n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{+ o(n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{)}$. The above upper bound is used to improve related results on longest sets in k-dimensional unit cubes obtained by Few (Mathematika2 (1955), 141–144) for almost all k′s. For k=2, Few's technique is used to show that $\text{l}{}^2\text{(n)≤(}\text{πn}\text{2}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{+ O(1)}$.     

Distance-regular graphs with girth 3 or 4: I

We study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some relationships among the intersection numbers of Γ when Γ contains a cycle {u₁, u₂, u₃, u₄} with ?(u₁, u₃) = ?(u₂, u₄) = 2. These relationships imply the diameter d, valency k, and intersection numbers a₁ and c_d of Γ are related by $\text{d ≤}\text{(k + c}{}_{\mathrm{d}}\text{)}\text{(a}{}_1\text{+ 2)}$. Next, we show subgraphs induced by vertex neighbourhoods in distance-regular graphs where cycles mentioned above do not exist are related to certain strongly regular graphs.     

The expected eigenvalue distribution of a large regular graph

Let K₁, K₂,... be a sequence of regular graphs with degree v?2 such that n(X_i)→∞ and ck(X_i)/n(X_i)→0 as i∞ for each k?3, where n(X_i) is the order of X_i, and c_k(X_i) is the number of k- cycles in X₁. We determine the limiting probability density f(x) for the eigenvalues of X>_i as i→∞. It turns out that

$\text{f(x)=}\text{v}\text{4(v?1)?v}{}^2\text{2π(v}{}^2\text{?x}{}^2\text{)}{}_0$

for ?x??2$\text{v-1}$, otherwise It is further shown that f(x) is the expected eigenvalue distribution for every large randomly chosen labeled regular graph with degree v.     

Factorizing the complete graph into factors with large star number

The graph G has star number n if any n vertices of G belong to a subgraph which is a star. Let f(n, k) be the smallest number m such that the complete graph on m vertices can be factorized into k factors with star number n. In the present paper we prove that $\text{c}{}_1{}^{\mathrm{n}}\text{k ≤ f(n, k) < c}{}_2{}^{\mathrm{n}}\text{k}$.     

Toeplitz matrices commuting with tridiagonal matrices

we prove that if R is a nonscalar Toeplitz matrix R_{i, j}=r_?i?j? which commutes with a tridiagonal matrix with simple spectrum, then

$\text{r}{}_{\mathrm{k}}\text{r}{}_1\text{=}\text{u}{}_{\mathrm{k-1}}\text{r}{}_2\text{r}{}_1\text{cos p}\text{u}{}_{\mathrm{k-1}}\text{(cos p)}$

, k=4, 5,…, with U_k the Chebychev polynomial of the second kind, where p is determined from

$\text{cos p=}\text{1}\text{2}\text{r}{}^2{}_1\text{?r}{}_1\text{r}{}_3\text{r}{}^2{}_2\text{?r}{}_1\text{r}{}_3$

.     

Votes and a half-binomial

In two party elections with popular vote ratio $\text{p}\text{q}\text{,}\text{1}\text{2}\text{≤p=1 ?q}$, a theoretical model suggests replacing the so-called MacMahon cube law approximation $\text{(}\text{p}\text{q}\text{)}{}^3$, for the ratio $\text{P}\text{Q}$ of candidates elected, by the ratio $\text{?}{}_{\mathrm{k}}\text{(p)}\text{?}{}_{\mathrm{k}}\text{(q)}$ of the two half sums in the binomial expansion of (p+q)^2k+1 for some k. This ratio is nearly $\text{(}\text{p}\text{q}\text{)}{}^3$ when k = 6. The success probability $\text{g}{}_{\mathrm{k}}\text{(p)=(}\text{p}{}^{\mathrm{a}}\text{(p}{}^{\mathrm{a}}\text{+q}{}^{\mathrm{a}}\text{)}$ for the power law $\text{(}\text{p}\text{q}\text{)}{}^{\mathrm{a}}\text{?}\text{P}\text{Q}$ is shown to so closely approximate $\text{?}{}_{\mathrm{k}}\text{(p)=Σ}{}_0{}^{\mathrm{k}}\text{(}{}_{\mathrm{r}}{}^{\mathrm{2k+1}}\text{)p}{}^{\mathrm{2k+1?r}}\text{q}{}^{\mathrm{r}}$, if we choose $\text{a = a}{}_{\mathrm{k}}\text{=}\text{(2k+1)!}\text{4}{}^{\mathrm{k}}\text{k!k!}$, that $\text{1≤}\text{?}{}_{\mathrm{k}}\text{(p)}\text{g}{}_{\mathrm{k}}\text{(p)}\text{≤1.01884086}$ for $\text{k≥1}\text{if}\text{1}\text{2}\text{≤p≤1}$. Computationally, we avoid large binomial coefficients in computing $\text{?}{}_{\mathrm{k}}\text{(p)}$ for k>22 by expressing $\text{2?}{}_{\mathrm{k}}\text{(p)?1}$ as the sum $\text{(p?q) Σ}{}_0{}^{\mathrm{k}}\text{(4pq)}{}^{\mathrm{s}}\text{a}{}_{\mathrm{s}}\text{(2s+1)}$, whose terms decrease by the factors $\text{(4pq)(1?}\text{1}\text{2s}\text{)}$. Setting K = 4k+3, we compute a_k for the large k using a continued fraction $\text{πa}{}_{\mathrm{k}}{}^2\text{=}\text{K+1}{}^2\text{(}\text{2K+3}{}^2\text{(}\text{2K+5}{}^2\text{(2K+…)}\text{)}\text{)}$ derived from the ratio of π to the finite Wallis product approximation.     

On the probability that k positive integers are relatively prime II

Given a set S of positive integers let $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t)}$ denote the number of k-tuples 〈m₁, …, m_k〉 for which $\text{m}{}_{\mathrm{i}}\text{∈ S ? [1, t]}$ and (m₁, …, m_k) = 1. Also let $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n)}$ denote the probability that k integers, chosen at random from $\text{S ? [1, n]}$, are relatively prime. It is shown that if P = {p₁, …, p_r} is a finite set of primes and S = {m : (m, p₁ … p_r) = 1}, then $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t) = (td(S))}{}^{\mathrm{k}}\text{Π}{}_{\mathrm{\nu ?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) + O(t}{}^{\mathrm{k?1}}\text{)}$ if k ≥ 3 and $\text{Z}{}_2{}^{\mathrm{S}}\text{(t) = (td(S))}{}^2\text{Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^2\text{) + O(t}\text{log}\text{t)}$ where d(S) denotes the natural density of S. From this result it follows immediately that $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) = (ζ(k))}{}^{\mathrm{?1}}\text{Π}{}_{\mathrm{p\in P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{)}{}^{\mathrm{?1}}$ as n → ∞. This result generalizes an earlier result of the author's where $\text{P = ?}$ and S is then the whole set of positive integers. It is also shown that if S = {p₁^x₁ … p_r^x_r : x_i = 0, 1, 2,…}, then $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → 0}$ as n → ∞.     

Binomial self-inverse sequences and tangent coefficients

This paper treats the class of sequences {a_n} that satisfy the recurrence relation

$\text{a}{}_{\mathrm{2n+1}}\text{=∑}{}_{\mathrm{<mtext>k=0</mtext>}}{}^{\mathrm{<mtext>n</mtext>}}\text{(?1)}{}^{\mathrm{<mtext>k</mtext>}}\text{(}\text{n}\text{k}\text{a}{}_{\mathrm{k}}\text{d}{}^{\mathrm{n?k}}$

between the odd and even terms of {a_n} that involves the coefficients of tan(t), namely

$\text{a}{}_{\mathrm{2n+1}}\text{=∑}{}_{\mathrm{<mtext>k=0</mtext>}}{}^{\mathrm{<mtext>n</mtext>}}\text{(?1)}{}^{\mathrm{<mtext>k</mtext>}}\text{(}\text{2}\text{n}\text{+1}\text{2}\text{k}\text{+1}\text{)}\text{T}{}_{\mathrm{k}}\text{(d/2)}{}^{\mathrm{2k+1}}\text{a}{}_{\mathrm{2n?2k}}$

A combinatorial setting is then provided to elucidate the appearance of the tangent coefficients in this equation.     

Limit distributions for the maxima of stationary Gaussian processes

Let {X_n} be a stationary Gaussian sequence with E{X₀} = 0, {X²₀} = 1 and E{X₀X_n} = rⁿ_n Let c_n = (2ln n)^{$\text{built1}\text{2}$}, b_n = c_n? $\text{1}\text{2}$c^-1_n ln(4π ln n), and set M_n = max_{0 ?k?n}X_k. A classical result for independent normal random variables is that

$\text{P[c}{}_{\mathrm{n}}\text{(M}{}_{\mathrm{n}}\text{?b}{}_{\mathrm{n}}\text{)?x]→exp[-e}{}^{\mathrm{-x}}\text{] as n → ∞ for all x.}$

Berman has shown that (1) applies as well to dependent sequences provided r_nlnn = o(1). Suppose now that {r_n} is a convex correlation sequence satisfying r_n = o(1), (r_nlnn)^-1 is monotone for large n and o(1). Then

$\text{P[r}{}_{\mathrm{n}}{}^{\mathrm{<mtext>-1</mtext><mtext>2</mtext>}}\text{(M}{}_{\mathrm{n}}\text{? (1?r}{}_{\mathrm{n}}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{b}{}_{\mathrm{n}}\text{)?x] → Ф(x)}$

for all x, where Ф is the normal distribution function. While the normal can thus be viewed as a second natural limit distribution for {M_n}, there are others. In particular, the limit distribution is given below when r_n is (sufficiently close to) γ/ln n. We further exhibit a collection of limit distributions which can arise when r_n decays to zero in a nonsmooth manner. Continuous parameter Gaussian processes are also considered. A modified version of (1) has been given by Pickands for some continuous processes which possess sufficient asymptotic independence properties. Under a weaker form of asymptotic independence, we obtain a version of (2).     

Eigenvalue multiplicities of highly symmetric graphs

We find lower bounds on eigenvalue multiplicities for highly symmetric graphs. In particular we prove:Theorem 1. If Γ is distance-regular with valency k and girth g (g?4), and λ (λ≠±?k) is an eigenvalue of Γ, then the multiplicity of λ is at least

$\text{k(k?1)}{}^{\mathrm{<mtext>[</mtext><mtext>g</mtext><mtext>4</mtext><mtext>]?1</mtext>}}$

if g≡0 or 1 (mod 4),

$\text{2(k?1)}{}^{\mathrm{<mtext>[</mtext><mtext>g</mtext><mtext>4</mtext><mtext>]</mtext>}}$

if g≡2 or 3 (mod 4) where [ ] denotes integer part. Theorem 2. If the automorphism group of a regular graph Γ with girth g (g?4) and valency k acts transitively on s-arcs for some s, $\text{1?s?[}\text{1}\text{2}\text{g]}$, then the multiplicity of any eigenvalue λ (λ≠±?k) is at least

$\text{k(k?1)}{}^{\mathrm{<mtext>s</mtext><mtext>2?1</mtext>}}$

if s is even,

$\text{2(k?1)}{}^{\mathrm{<mtext>(</mtext><mtext>s?1)</mtext><mtext>2</mtext>}}$

if s is odd.     

On the absolute continuity of Schrödinger operators with spherically symmetric,long-range potentials,II

Let H = ?Δ + V, where the potential V is spherically symmetric and can be decomposed as a sum of a short-range and a long-range term, V(r) = V_S(r) + V_L. Let λ = lim sup_r→∞V_L(r) < ∞ (we allow λ = ? ∞) and set λ⁺ = max(λ, 0). Assume that for some r₀, V_L(r) ?C^2k(r₀, ∞) and that there exists δ > 0 such that $\text{(}\text{d}\text{dr}\text{)}{}^{\mathrm{j}}\text{V}{}_{\mathrm{<mtext>L</mtext>}}\text{(r) · (λ}{}^{\mathrm{+}}\text{? V}{}_{\mathrm{<mtext>L</mtext>}}\text{(r) + 1)}{}^{\mathrm{?1}}\text{= O(r}{}^{\mathrm{?j\delta }}\text{), j = 1,…, 2k,}\text{as}\text{r → ∞}$. Assume further that $\text{∝}{}_1{}^{\mathrm{\infty }}\text{(}\text{dr}\text{¦ V}{}_{\mathrm{<mtext>L</mtext>}}\text{(r)¦}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{) = ∞}$ and that 2kδ > 1. It is shown that: (a) The restriction of H to C^∞(Rⁿ) is essentially self-adjoint, (b) The essential spectrum of H contains the closure of (λ, ∞). (c) The part of H over (λ, ∞) is absolutely continuous.     

The visually distinct configurations of k sets

Two sets of sets, C₀ and C₁, are said to be visually equivalent if there is a 1-1 mapping m from C₀ onto C₁ such that for every S, T?C₀, S ∩ T=0 if and only if m(S)∩ m(T)=0 and S?T if and only if m(S)?m(T). We find estimates for V(k), the number of equivalence classes of this relation on sets of k sets, for finite and infinite k. Our main results are that for finite k, $\text{1}\text{2}\text{k}{}^2\text{-k log k <log V (k)<ak}{}^2\text{+βk+log k}$, where α and β are approximately 0.7255 and 2.5323 respectively, and there is a set N of cardinality $\text{1}\text{2}\text{(k}{}^2\text{+k)}$ such that there are V(k) visually distinct sets of k subsets of N.     

A completeness theorem for a nonlinear multiparameter eigenvalue problem

In this paper we study the linked nonlinear multiparameter system

$\text{y}{}_{\mathrm{r}}{}^{\mathrm{n}}\text{(X}{}_{\mathrm{r}}\text{) + M}{}_{\mathrm{r}}\text{Y}{}_{\mathrm{r}}\text{+}\text{∑}\text{s=1}\text{k}\text{λ}{}_{\mathrm{s}}\text{(a}{}_{\mathrm{rs}}\text{(X}{}_{\mathrm{r}}\text{) + P}{}_{\mathrm{rs}}\text{) Y}{}_{\mathrm{r}}\text{(X}{}_{\mathrm{r}}\text{) = 0, r = l,…, k}$

, where x_r? [a_r, b_r], y_r is subject to Sturm-Liouville boundary conditions, and the continuous functions a_rs satisfy ¦ $\text{A ¦ (x) =}\text{det}\text{a}{}_{\mathrm{rs}}\text{(x}{}_{\mathrm{r}}\text{) > 0}$. Conditions on the polynomial operators M_r, P_rs are produced which guarantee a sequence of eigenfunctions for this problem yⁿ(x) = Π_r=1^ky_rⁿ(x_r), n ? 1, which form a basis in $\text{L}{}^2\text{([a, b], ¦ A ¦)}$. Here [a, b] = [a₁, b₁ × … × [a_k, b_k].     

On r-potent linear mappings

Let L(E) be the set of all linear mappings of a vector space E. Let Z₊ be the set of all positive integers. A nonzero element ? in L(E) is called an r-potent if $\text{?}{}^{\mathrm{r}}\text{=?}\text{and}\text{?}{}^{\mathrm{i}}\text{≠?}\text{for}\text{1<i<r (i,r∈Z}{}_{\mathrm{+}}\text{)}$. We prove that $\text{S(E)= {?∈L(E): ?}\text{is singular}\text{}}$ is a semigroup generated by the set of all r-potents in S(E), where r is a fixed positive integer with 2?r?n=dim(E).     

The covering problem for the fields Q(−1)12 and Q(−3)12

Let k be a positive square free integer, $\text{N(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ the ring of algebraic integers in $\text{Q(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ and S the unit sphere in C_n, complex n-space. If A₁,…, A_n are n linearly independent points of C_n then L = {u₁Au + … + u_nA_n} with $\text{u}{}_{\mathrm{r}}\text{∈ N(?k)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is called a k-lattice. The determinant of L is denoted by d(L). If L is a covering lattice for S, then $\text{θ(S, L) =}\text{V(S)}\text{d(L)}$ is the covering density. L is called locally (absolutely) extreme if θ(S, L) is a local (absolute) minimum. In this paper we determine unique classes of extreme lattices for k = 1 and k = 3.     

Powers of matrices and idempotency

In this paper, we establish the following results: Let A be a square matrix of rank r. Then (a) $\text{(A+A}{}^1\text{)}\text{2}$ is idempotent of rank r, and tr_rA (defined as the sum of the principal minors of order r in A) is one iff A is Hermitian idempotent. (b) A^s=A^t for some positive integers s≠t, and trA=rankA iff A is idempotent. (c) $\text{A(A1A)}{}^{\mathrm{s}}\text{= A(AA}{}^1\text{)}{}^{\mathrm{t}}$ for some integers s≠t iff $\text{AA}{}^1\text{=A}{}^1\text{A}$ is idempotent, while $\text{A(A}{}^1\text{A)}{}^{\mathrm{s}}\text{= A(AA}{}^1\text{)}{}^{\mathrm{s}}$ for some integers s≠0 iff $\text{AA}{}^1\text{=A}{}^1\text{A}$. (d) $\text{A(A}{}^1\text{A)}{}^{\mathrm{s}}\text{=A}{}^1\text{(AA}{}^1\text{)}{}^{\mathrm{t}}$ for some integers s≠t and rankA=trA iff A is Hermitian idempotent, while $\text{A(A}{}^1\text{A)}{}^{\mathrm{s}}\text{= A}{}^1\text{(AA}{}^1\text{)}{}^{\mathrm{s}}$ for some integer s iff A is Hermitian. Here $\text{A}{}^1$ indicates the conjugate transpose of A, and P^-α is defined iff (P⁺)^α=(P^α)⁺ for all positive integers α and P⁺ is the Moore-Penrose inverse of P.