Extinction profile of the logarithmic diffusion equation

Let ${N \geq 3}$ and u be the solution of u _t = Δ log u in ${\mathbb{R}^N \times (0, T)}$ with initial value u ₀ satisfying ${B_{k_1}(x, 0) \leq u_{0} \leq B_{k_2}(x, 0)}$ for some constants k ₁ > k ₂ > 0 where ${B_k(x, t) = 2(N - 2)(T - t)_{+}^{N/(N - 2)}/(k + (T - t)_{+}^{2/(N - 2)}|x|^{2})}$ is the Barenblatt solution for the equation and ${u_0 - B_{k_0} \in L^{1}(\mathbb{R}^{N})}$ for some constant k ₀ > 0 if ${N \geq 4}$ . We give a new different proof on the uniform convergence and ${L^1(\mathbb{R}^N)}$ convergence of the rescaled function ${\tilde{u}(x, s) = (T - t)^{-N/(N - 2)}u(x/(T - t)^{-1/(N - 2)}, t), s = -{\rm log}(T - t)}$ , on ${\mathbb{R}^N}$ to the rescaled Barenblatt solution ${\tilde{B}_{k_0}(x) = 2(N - 2)/(k_0 + |x|^{2})}$ for some k ₀ > 0 as ${s \rightarrow \infty}$ . When ${N \geq 4, 0 \leq u_0(x) \leq B_{k_0}(x, 0)}$ in ${\mathbb{R}^N}$ , and ${|u_0(x) - B_{k_0}(x, 0)| \leq f \in L^{1}(\mathbb{R}^{N})}$ for some constant k ₀ > 0 and some radially symmetric function f, we also prove uniform convergence and convergence in some weighted L ¹ space in ${\mathbb{R}^N}$ of the rescaled solution ${\tilde{u}(x, s)}$ to ${\tilde{B}_{k_0}(x)}$ as ${s \rightarrow \infty}$ .     

Structural and geometric characteristics of sets of convergence and divergence of multiple Fourier series with J k -lacunary sequence of rectangular partial sums

We study multiple trigonometric Fourier series of functions f in the classes $L_p \left( {\mathbb{T}^N } \right)$ , p > 1, which equal zero on some set $\mathfrak{A}, \mathfrak{A} \subset \mathbb{T}^N , \mu \mathfrak{A} > 0$ (µ is the Lebesgue measure), $\mathbb{T}^N = \left[ { - \pi ,\pi } \right]^N$ , N ≥ 3. We consider the case when rectangular partial sums of the indicated Fourier series S _n (x; f) have index n = (n ₁, ..., n _N ) ∈ ? ^N , in which k (k ≥ 1) components on the places {j ₁, ..., j _k } = J _k ? {1, ..., N} are elements of (single) lacunary sequences (i.e., we consider multiple Fourier series with J _k -lacunary sequence of partial sums). A correlation is found of the number k and location (the “sample” J _k ) of lacunary sequences in the index n with the structural and geometric characteristics of the set $\mathfrak{A}$ , which determines possibility of convergence almost everywhere of the considered series on some subset of positive measure $\mathfrak{A}_1$ of the set $\mathfrak{A}$ .     

The Linear t-Colorings of Sierpiński-Like Graphs

A proper t-coloring of a graph G is a mapping ${\varphi: V(G) \rightarrow [1, t]}$ such that ${\varphi(u) \neq \varphi(v)}$ if u and v are adjacent vertices, where t is a positive integer. The chromatic number of a graph G, denoted by ${\chi(G)}$ , is the minimum number of colors required in any proper coloring of G. A linear t-coloring of a graph is a proper t-coloring such that the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number of a graph G, denoted by ${lc(G)}$ , is the minimum t such that G has a linear t-coloring. In this paper, the linear t-colorings of Sierpiński-like graphs S(n, k), ${S^+(n, k)}$ and ${S^{++}(n, k)}$ are studied. It is obtained that ${lc(S(n, k))= \chi (S(n, k)) = k}$ for any positive integers n and k, ${lc(S^+(n, k)) = \chi(S^+(n, k)) = k}$ and ${lc(S^{++}(n, k)) = \chi(S^{++}(n, k)) = k}$ for any positive integers ${n \geq 2}$ and ${k \geq 3}$ . Furthermore, we have determined the number of paths and the length of each path in the subgraph induced by the union of any two color classes completely.     

Set-coloring of Edges and Multigraph Ramsey Numbers

Edge-colorings of multigraphs are studied where a generalization of Ramsey numbers is given. Let ${M_n^{(r)}}$ be the multigraph of order n, in which there are r edges between any two different vertices. Suppose q ₁, q ₂, . . . , q _k and r are positive integers, and q _i ≥ 2(1 ≤ i ≤ k), k > r. Let the multigraph Ramsey number ${f^{(r)} (q_1 ,q_2 , \ldots ,q_k )}$ be the minimum positive integer n such that in any k-edge coloring of ${M_n^{(r)}}$ (every edge is colored with one among k given colors, and edges between the same pair of vertices are colored with different colors), there must be ${i \in \{1,2,\ldots,k\}}$ such that ${M_n^{(r)}}$ has such a complete subgraph of order q _i , of which all the edges are in color i. By Ramsey’s theorem it is easy to show ${f^{(r)} (q_1 ,q_2 , \ldots ,q_k )}$ exists for given q ₁ ,q ₂, . . . , q _k and r. Lower and upper bounds for some multigraph Ramsey numbers are given.     

Limiting Behavior of High Order Correlations for Simple Random Sampling

For ${N = 1, 2,\ldots,}$ let S _N be a simple random sample of size n = n _N from a population A _N of size N, where ${0 \leq n \leq N}$ . Then with f _N =  n/N, the sampling fraction, and 1 _A the inclusion indicator that ${A \in S_N}$ , for any ${H \subset A_N}$ of size ${k \geq 0}$ , the high order correlations $${\rm Corr}(k) = E \big(\mathop{\Pi}\limits_{A \in H} ({\bf 1}_A - f_N )\big)$$ depend only on k, and if the sampling fraction ${f_N \rightarrow f}$ as ${N \rightarrow \infty}$ , then $$N^{k/2}{\rm Corr}(k) \rightarrow [f (f - 1)]^{k/2}EZ^{k}, k \,{\rm even}$$ and $$N^{(k+1)/2}{\rm Corr}(k) \rightarrow [f (f - 1)]^{(k-1)/2}(2f - 1)\frac{1}{3}(k - 1)EZ^{k+1}, k \,{\rm odd}$$ where Z is a standard normal random variable. This proves a conjecture given in [2].     

Nash equilibria on topological semilattices

A function ${u : X \to \mathbb{R}}$ defined on a partially ordered set is quasi-Leontief if, for all ${x \in X}$ , the upper level set ${\{x\prime \in X : u(x\prime) \geq u(x)\}}$ has a smallest element; such an element is an efficient point of u. An abstract game ${u_{i} : \prod^{n}_{j=1} X_j \to \mathbb{R}, i \in \{1, \ldots , n\}}$ , is a quasi-Leontief game if, for all i and all ${(x_{j})_{j \neq i} \in \prod_{j \neq i} X_{j}, u_{i}((x_{j})_{j \neq i};-) : X_{i} \to \mathbb{R}}$ is quasi-Leontief; a Nash equilibrium x* of an abstract game ${u_{i} :\prod^{n}_{j=1} X_{j} \to \mathbb{R}}$ is efficient if, for all ${i, x^{*}_{i}}$ is an efficient point of the partial function ${u_{i}((x^{*}_{j})_{j \neq i};-) : X_{i} \to \mathbb{R}}$ . We establish the existence of efficient Nash equilibria when the strategy spaces X _i are topological semilattices which are Peano continua and Lawson semilattices.     

A decomposition of the universal embedding space for the near polygon {{\mathbb H}_n}

Let ${{\mathbb H}_n, n \geq 1}$ , be the near 2n-gon defined on the 1-factors of the complete graph on 2n?+?2 vertices, and let e denote the absolutely universal embedding of ${{\mathbb H}_n}$ into PG(W), where W is a ${\frac{1}{n+2} \left(\begin{array}{c}2n+2 \\ n+1\end{array}\right)}$ -dimensional vector space over the field ${{\mathbb F}_2}$ with two elements. For every point z of ${{\mathbb H}_n}$ and every ${i \in {\mathbb N}}$ , let Δ _i (z) denote the set of points of ${{\mathbb H}_n}$ at distance i from z. We show that for every pair {x, y} of mutually opposite points of ${{\mathbb H}_n, W}$ can be written as a direct sum ${W_0 \oplus W_1 \oplus \cdots \oplus W_n}$ such that the following four properties hold for every ${i \in \{0,\ldots,n \}}$ : (1) ${\langle e(\Delta_i(x) \cap \Delta_{n-i}(y)) \rangle = {\rm PG}(W_i)}$ ; (2) ${\left\langle e \left( \bigcup_{j \leq i} \Delta_j(x) \right) \right\rangle = {\rm PG}(W_0 \oplus W_1 \oplus \cdots \oplus W_i)}$ ; (3) ${\left\langle e \left( \bigcup_{j \leq i} \Delta_j(y) \right) \right\rangle = {\rm PG}(W_{n-i}\oplus W_{n-i+1} \oplus \cdots \oplus W_n)}$ ; (4) ${\dim(W_i) = |\Delta_i(x) \cap \Delta_{n-i}(y)| = \left(\begin{array}{c}n \\ i\end{array}\right)^2 - \left(\begin{array}{c}n \\ i-1\end{array}\right) \cdot \left(\begin{array}{c}n \\ i+1\end{array}\right)}$ .     

Generalized higher order spt-functions

We give a new generalization of the spt-function of G.E. Andrews, namely $\operatorname {Spt}_{j}(n)$ , and give its combinatorial interpretation in terms of successive lower-Durfee squares. We then generalize the higher order spt-function $\operatorname {spt}_{k}(n)$ , due to F.G. Garvan, to ${}_{j\!}\operatorname {spt}_{k}(n)$ , thus providing a two-fold generalization of $\operatorname {spt}(n)$ , and give its combinatorial interpretation. Lastly, we show how the positivity of _j spt _k (n) can be used to generalize Garvan’s inequality between rank and crank moments to the moments of j-rank and (j+1)-rank.     

The formal translation equation for iteration groups of type II

We investigate the translation equation $$F(s+t, x) = F(s, F(t, x)),\quad \quad s,t\in{\mathbb{C}},\qquad\qquad\qquad\qquad({\rm T})$$ in ${\mathbb{C}\left[\kern-0.15em\left[{x}\right]\kern-0.15em\right]}$ , the ring of formal power series over ${\mathbb{C}}$ . Here we restrict ourselves to iteration groups of type II, i.e. to solutions of (T) of the form ${F(s, x) \equiv x + c_k(s)x^k {\rm mod} x^{k + 1}}$ , where k ≥ 2 and c _k ≠ 0 is necessarily an additive function. It is easy to prove that the coefficient functions c _n (s) of $$F(s, x) = x + \sum_{n \ge q k}c_n(s)x^n$$ are polynomials in c _k (s). It is possible to replace this additive function c _k by an indeterminate. In this way we obtain a formal version of the translation equation in the ring ${(\mathbb{C}[y])\left[\kern-0.15em\left[{x}\right]\kern-0.15em\right]}$ . We solve this equation in a completely algebraic way, by deriving formal differential equations or an Aczél–Jabotinsky type equation. This way it is possible to get the structure of the coefficients in great detail which are now polynomials. We prove the universal character (depending on certain parameters, the coefficients of the infinitesimal generator H of an iteration group of type II) of these polynomials. Rewriting the solutions G(y, x) of the formal translation equation in the form ${\sum_{n\geq 0}\phi_n(x)y^n}$ as elements of ${(\mathbb{C}\left[\kern-0.15em\left[{x}\right]\kern-0.15em\right])\left[\kern-0.15em\left[{y}\right]\kern-0.15em\right]}$ , we obtain explicit formulas for ${\phi_n}$ in terms of the derivatives H ^(j)(x) of the generator ${H}$ and also a representation of ${G(y, x)}$ as a Lie–Gröbner series. Eventually, we deduce the canonical form (with respect to conjugation) of the infinitesimal generator ${H}$ as x ^k + hx ^2k-1 and find expansions of the solutions ${G(y, x) = \sum_{r\geq 0} G_r(y, x)h^r}$ of the above mentioned differential equations in powers of the parameter h.     

A Note on Drazin Invertibility for Upper Triangular Block Operators

A bounded linear operator A acting on a Banach space X is said to be an upper triangular block operators of order n, and we write ${A \in \mathcal{UT}_{n}(X)}$ , if there exists a decomposition of ${X = X_{1} \oplus . . . \oplus X_{n}}$ and an n × n matrix operator ${(A_{i,j})_{\rm 1 \leq i, j \leq n}}$ such that ${A = (A_{i, j})_{1 \leq i, j \leq n}, A_{i, j} = 0}$ for i > j. In this note we characterize a large set of entries A _{i, j} with j > i such that ${\sigma_{\rm D} (A) = {\bigcup\limits_{i = 1}^{n}} \sigma_{\rm D} (A_{i, i})}$ ; where σ_D(.) is the Drazin spectrum. Some applications concerning the Fredholm theory and meromorphic operators are given.     

Collapsible Graphs and Hamiltonicity of Line Graphs

Thomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai (Combinatorics and Graph Theory, vol 95, World Scientific, Singapore, pp 53–69; Conjecture 8.6 of 1995) conjectured that every 3-edge connected and essentially 6-edge connected graph is collapsible. Denote D ₃(G) the set of vertices of degree 3 of graph G. For ${e = uv \in E(G)}$ , define d(e) = d(u) + d(v) ? 2 the edge degree of e, and ${\xi(G) = \min\{d(e) : e \in E(G)\}}$ . Denote by λ ^m (G) the m-restricted edge-connectivity of G. In this paper, we prove that a 3-edge-connected graph with ${\xi(G)\geq7}$ , and ${\lambda^3(G)\geq7}$ is collapsible; a 3-edge-connected simple graph with ${\xi(G)\geq7}$ , and ${\lambda^3(G)\geq6}$ is collapsible; a 3-edge-connected graph with ${\xi(G)\geq6}$ , ${\lambda^2(G)\geq4}$ , and ${\lambda^3(G)\geq6}$ with at most 24 vertices of degree 3 is collapsible; a 3-edge-connected simple graph with ${\xi(G)\geq6}$ , and ${\lambda^3(G)\geq5}$ with at most 24 vertices of degree 3 is collapsible; a 3-edge-connected graph with ${\xi(G)\geq5}$ , and ${\lambda^2(G)\geq4}$ with at most 9 vertices of degree 3 is collapsible. As a corollary, we show that a 4-connected line graph L(G) with minimum degree at least 5 and ${|D_3(G)|\leq9}$ is Hamiltonian.     

The Maximal Variation of Martingales of Probabilities and Repeated Games with Incomplete Information

The variation of a martingale $p_{0}^{k}=p_{0},\ldots,p_{k}$ of probabilities on a finite (or countable) set X is denoted $V(p_{0}^{k})$ and defined by $$ V\bigl(p_0^k\bigr)=E\Biggl(\sum_{t=1}^k\|p_t-p_{t-1}\|_1\Biggr). $$ It is shown that $V(p_{0}^{k})\leq\sqrt{2kH(p_{0})}$ , where H(p) is the entropy function H(p)=?∑ _x p(x)logp(x), and log stands for the natural logarithm. Therefore, if d is the number of elements of X, then $V(p_{0}^{k})\leq\sqrt{2k\log d}$ . It is shown that the order of magnitude of the bound $\sqrt{2k\log d}$ is tight for d≤2 ^k : there is C>0 such that for all k and d≤2 ^k , there is a martingale $p_{0}^{k}=p_{0},\ldots,p_{k}$ of probabilities on a set X with d elements, and with variation $V(p_{0}^{k})\geq C\sqrt{2k\log d}$ . An application of the first result to game theory is that the difference between v _k and lim _j v _j , where v _k is the value of the k-stage repeated game with incomplete information on one side with d states, is bounded by $\|G\|\sqrt{2k^{-1}\log d}$ (where ∥G∥ is the maximal absolute value of a stage payoff). Furthermore, it is shown that the order of magnitude of this game theory bound is tight.     

Mixed Invariant Subspaces over the Bidisk

It is known that the structure of invariant subspaces I of the Hardy space H ² over the bidisk is extremely complicated. One reason is that it is difficult to describe infinite dimensional wandering spaces ${I\ominus zI}$ completely. In this paper, we study the structure of nontrivial closed subspaces N of H ² with ${T_zN\subset N}$ and ${T^*_wN\subset N}$ , which are called mixed invariant subspaces under T _z and ${T^*_w}$ . We know that the dimension of ${N\ominus zN}$ ranges from 1 to ??. If ${T^*_w(N\ominus zN)\subset N\ominus zN}$ , we may describe N completely. If ${T^*_w(N\ominus zN)\not\subset N\ominus zN}$ , it seems difficult to describe N generally. So we study N under the condition ${dim\,(N\ominus zN)=1}$ . Write ${M=H^2\ominus N}$ . We describe ${M\ominus wM}$ precisely. We give a characterization of N for which there is a nonzero function ${\varphi}$ in ${M\ominus wM}$ satisfying ${z^k\varphi\in M\ominus wM}$ for every k ?? 0. We also see that the space ${M\ominus wM}$ has a deep connection with the de Branges?CRovnyak spaces studied by Sarason.     

A remark on Nesterenko’s theorem for Ramanujan functions

We study the algebraic independence of values of the Ramanujan q-series $A_{2j+1}(q)=\sum_{n=1}^{\infty}n^{2j+1}q^{2n}/(1-q^{2n})$ or S _2j+1(q) (j≥0). It is proved that, for any distinct positive integers i, j satisfying $(i,j)\not=(1,3)$ and for any $q\in \overline{ \mathbb{Q}}$ with 0<|q|<1, the numbers A ₁(q), A _2i+1(q), A _2j+1(q) are algebraically independent over $\overline{ \mathbb{Q}}$ . Furthermore, the q-series A _2i+1(q) and A _2j+1(q) are algebraically dependent over $\overline{ \mathbb{Q}}(q)$ if and only if (i,j)=(1,3).     

A Congruence Connecting Latin Rectangles and Partial Orthomorphisms

A partial orthomorphism of ${\mathbb{Z}_{n}}$ is an injective map ${\sigma : S \rightarrow \mathbb{Z}_{n}}$ such that ${S \subseteq \mathbb{Z}_{n}}$ and ??(i)?Ci ? ??(j)? j (mod n) for distinct ${i, j \in S}$ . We say ?? has deficit d if ${|S| = n - d}$ . Let ??(n, d) be the number of partial orthomorphisms of ${\mathbb{Z}_{n}}$ of deficit d. Let ??(n, d) be the number of partial orthomorphisms ?? of ${\mathbb{Z}_n}$ of deficit d such that ??(i) ? {0, i} for all ${i \in S}$ . Then ??(n, d) =???(n, d)n ²/d ² when ${1\,\leqslant\,d < n}$ . Let R _{k, n} be the number of reduced k ×?n Latin rectangles. We show that $$R_{k, n} \equiv \chi (p, n - p)\frac{(n - p)!(n - p - 1)!^{2}}{(n - k)!}R_{k-p,\,n-p}\,\,\,\,(\rm {mod}\,p)$$ when p is a prime and ${n\,\geqslant\,k\,\geqslant\,p + 1}$ . In particular, this enables us to calculate some previously unknown congruences for R _{n, n} . We also develop techniques for computing ??(n, d) exactly. We show that for each a there exists??? _a such that, on each congruence class modulo??? _a , ??(n, n-a) is determined by a polynomial of degree 2a in n. We give these polynomials for ${1\,\leqslant\,a\,\leqslant 6}$ , and find an asymptotic formula for ??(n, n-a) as n ?? ??, for arbitrary fixed a.     

Functional equations for vector products and quaternions

In our paper we find all functions ${f : \mathbb {R} \times \mathbb {R}^{3} \rightarrow \mathbb {H}}$ and ${g : \mathbb {R}^{3} \rightarrow \mathbb {H}}$ satisfying ${f (r, {\bf v}) f (s, {\bf w}) = -\langle{\bf v},{\bf w}\rangle + f (rs, s{\bf v} + r{\bf w} + {\bf v} \times {\bf w})}$ ${(r, s \in \mathbb {R}, {\bf v},{\bf w} \in \mathbb {R}^{3})}$ , and ${g({\bf v})g({\bf w}) = -\langle{\bf v}, {\bf w}\rangle + g({\bf v} \times {\bf w})}$ $({{\bf v},{\bf w} \in \mathbb {R}^{3}})$ . These functional equations were motivated by the well-known identities for vector products and quaternions, which can be obtained from the solutions f (r, (v ₁, v ₂, v ₃)) = r + v ₁ i + v ₂ j + v ₃ k and g((v ₁ ,v ₂, v ₃)) = v ₁ i + v ₂ j + v ₃ k.     

Cops and Robber Game with a Fast Robber on Expander Graphs and Random Graphs

We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e., can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let ${c_{\infty}(G)}$ denote the number of cops needed to capture the robber in a graph G in this variant. We characterize graphs G with c _??(G) =? 1, and give an ${O( \mid V(G)\mid^2)}$ algorithm for their detection. We prove a lower bound for c _?? of expander graphs, and use it to prove three things. The first is that if ${np \geq 4.2 {\rm log}n}$ then the random graph ${G= \mathcal{G}(n, p)}$ asymptotically almost surely has ${\eta_{1}/p \leq \eta_{2}{\rm log}(np)/p}$ , for suitable positive constants ${\eta_{1}}$ and ${\eta_{2}}$ . The second is that a fixed-degree random regular graph G with n vertices asymptotically almost surely has ${c_{\infty}(G) = \Theta(n)}$ . The third is that if G is a Cartesian product of m paths, then ${n/4km^2 \leq c_{\infty}(G) \leq n/k}$ , where ${n = \mid V(G)\mid}$ and k is the number of vertices of the longest path.     

Connectivity of Strong Products of Graphs

The strong product ${G\boxtimes H}$ of graphs G = (V ₁, E ₁) and H = (V ₂, E ₂) is the graph with vertex set ${V(G \boxtimes H)=V_1\times V_2}$ , where two distinct vertices ${(x_1, x_2), (y_1, y_2)\in V_1\times V_2}$ are adjacent in ${G\boxtimes H}$ if and only if x _i  = y _i or ${x_i y_i\in E_i}$ for i = 1, 2. We introduce so called I-sets and L-sets in the strong product ${G\boxtimes H}$ and prove that every minimum separating set in ${G\boxtimes H}$ is either an I-set or an L-set in ${G\boxtimes H}$ . Some bounds and exact results for connectivity of strong products follow from this characterization. The result is then generalized to an arbitrary number of factors in the strong product.     

Antibasis theorems for {\Pi^0_1} classes and the jump hierarchy

We prove two antibasis theorems for ${\Pi^0_1}$ classes. The first is a jump inversion theorem for ${\Pi^0_1}$ classes with respect to the global structure of the Turing degrees. For any ${P\subseteq 2^\omega}$ , define S(P), the degree spectrum of P, to be the set of all Turing degrees a such that there exists ${A \in P}$ of degree a. For any degree ${{\bf a \geq 0'}}$ , let ${\textrm{Jump}^{-1}({\bf a) = \{b : b' = a \}}}$ . We prove that, for any ${{\bf a \geq 0'}}$ and any ${\Pi^0_1}$ class P, if ${\textrm{Jump}^{-1} ({\bf a}) \subseteq S(P)}$ then P contains a member of every degree. For any degree ${{\bf a \geq 0'}}$ such that a is recursively enumerable (r.e.) in 0', let ${Jump_{\bf \leq 0'} ^{-1}({\bf a)=\{b : b \leq 0' \textrm{and} b' = a \}}}$ . The second theorem concerns the degrees below 0'. We prove that for any ${{\bf a\geq 0'}}$ which is recursively enumerable in 0' and any ${\Pi^0_1}$ class P, if ${\textrm{Jump}_{\bf \leq 0'} ^{-1}({\bf a)} \subseteq S(P)}$ then P contains a member of every degree.