KAM theory and the 3D Euler equation

We prove that the dynamical system defined by the hydrodynamical Euler equation on any closed Riemannian 3-manifold M   is not mixing in the C^k$C^k$ topology (k>4$k>4$ and non-integer) for any prescribed value of helicity and sufficiently large values of energy. This can be regarded as a 3D version of Nadirashvili's and Shnirelman's theorems showing the existence of wandering solutions for the 2D Euler equation. Moreover, we obtain an obstruction for the mixing under the Euler flow of C^k$C^k$-neighborhoods of divergence-free vectorfields on M  . On the way we construct a family of functionals on the space of divergence-free C¹$C^1$ vectorfields on the manifold, which are integrals of motion of the 3D Euler equation. Given a vectorfield these functionals measure the part of the manifold foliated by ergodic invariant tori of fixed isotopy types. We use the KAM theory to establish some continuity properties of these functionals in the C^k$C^k$-topology. This allows one to get a lower bound for the C^k$C^k$-distance between a divergence-free vectorfield (in particular, a steady solution) and a trajectory of the Euler flow.     

Two-colorings with many monochromatic cliques in both colors

Color the edges of the n-vertex complete graph in red and blue, and suppose that red k-cliques are fewer than blue k-cliques. We show that the number of red k  -cliques is always less than _ckn^k$c_k{n}^k$, where _ck∈(0,1)$c_k\in (0,1)$ is the unique root of the equation z^k=(1−z)^k+kz(1−z)^k−1$z^k={(1-z)}^k+kz{(1-z)}^{k-1}$. On the other hand, we construct a coloring in which there are at least _ckn^k−O(n^k−1)$c_k{n}^k-O(n^{k-1})$ red k-cliques and at least the same number of blue k-cliques.     

Extended rank reduction formulas containing Wedderburn and Abaffy–Broyden–Spedicato rank reducing processes

The Wedderburn rank reduction formula and the Abaffy–Broyden–Spedicato (ABS) algorithms are powerful methods for developing matrix factorizations and many fundamental numerical linear algebra processes such as Gram–Schmidt, conjugate direction and Lanczos methods. We present a rank reduction formula for transforming the rows and columns of A, extending the Wedderburn rank reduction formula and the ABS approach. By repeatedly applying the formula to reduce the rank, an extended rank reducing process is derived. The biconjugation process associated with the Wedderburn rank reduction process and the scaled extended ABS class of algorithms are shown to be in our proposed rank reducing process, while the process is more general to produce several other effective reduction algorithms to compute various structured factorizations. The process provides a general finite iterative approach for constructing factorizations of A   and A^T$A^T$ under a common framework of a general decomposition V^TAP=Ω$V^{T}AP=\Omega$. We also show that the biconjugation process associated with the Wedderburn rank reduction process can be derived from the scaled ABS class of algorithms applied to A   or A^T$A^T$. Finally, we provide a list of some well-known reduction procedures as special cases of our extended rank reducing process. The approach is general enough to produce various structured decompositions as well.     

Block tridiagonal reduction of perturbed normal and rank structured matrices

It is well known that if a matrix A∈C^n×n$A\in {\mathbb{C}}^{n\times n}$ solves the matrix equation f(A,A^H)=0$f(A,A^H)=0$, where f(x,y)$f(x,y)$ is a linear bivariate polynomial, then A is normal; A   and A^H$A^H$ can be simultaneously reduced in a finite number of operations to tridiagonal form by a unitary congruence and, moreover, the spectrum of A is located on a straight line in the complex plane. In this paper we present some generalizations of these properties for almost normal matrices which satisfy certain quadratic matrix equations arising in the study of structured eigenvalue problems for perturbed Hermitian and unitary matrices.     

The Drazin inverse of a singular,unreduced tridiagonal matrix

For a tridiagonal, singular matrix A   we present a method for the computation of the polynomial p(λ)$p(\lambda )$ such that A^D=p(A)$A^D=p(A)$ holds, where A^D$A^D$ is the Drazin inverse of A. The approach is based on the recursion of characteristic polynomials of leading principal submatrices of A.     

The classification of Leonard triples of Racah type

Let K$\mathbb{K}$ denote an algebraically closed field of characteristic zero. Let V   denote a vector space over K$\mathbb{K}$ with finite positive dimension. By a Leonard triple on V we mean an ordered triple of linear transformations A  , A^?$A^{?}$, A^ε$A^{\epsilon }$ in End(V)$\mathrm{End}(V)$ such that for each B∈{A,A^?,A^ε}$B\in \{A,A^{?},A^{\epsilon }\}$ there exists a basis for V with respect to which the matrix representing B   is diagonal and the matrices representing the other two linear transformations are irreducible tridiagonal. In this paper we define a family of Leonard triples said to have Racah type and classify them up to isomorphism. Moreover, we show that each of them satisfies the _Z3${\mathbb{Z}}_3$-symmetric Askey–Wilson relations. As an application, we construct all Leonard triples that have Racah type from the universal enveloping algebra U(_sl2)$U({\mathit{sl}}_2)$.     

Hochschild cohomology of triangular string algebras and its ring structure

We compute the Hochschild cohomology groups HH^?(A)${\mathrm{HH}}^{?}(A)$ in case A is a triangular string algebra, and show that its ring structure is trivial.     

The adjoint representation inside the exterior algebra of a simple Lie algebra

For a simple complex Lie algebra g$\mathfrak{g}$ we study the space of invariants A=(?g^?⊗g^?)^g$A={(?{\mathfrak{g}}^{?}\otimes {\mathfrak{g}}^{?})}^{\mathfrak{g}}$, which describes the isotypic component of type g$\mathfrak{g}$ in ?g^?$?{\mathfrak{g}}^{?}$, as a module over the algebra of invariants (?g^?)^g${(?{\mathfrak{g}}^{?})}^{\mathfrak{g}}$. As main result we prove that A   is a free module, of rank twice the rank of g$\mathfrak{g}$, over the exterior algebra generated by all primitive invariants in (?g^?)^g${(?{\mathfrak{g}}^{?})}^{\mathfrak{g}}$, with the exception of the one of highest degree.     

Circulant partial Hadamard matrices

A question arising in stream cypher cryptanalysis is reframed and generalized in the setting of Hadamard matrices as follows: For given n, what is the maximum value of k   for which there exists a k×n$k\times n$(±1)$(\pm 1)$-matrix A   such that AA^T=n_Ik$A{A}^{\mathsf{T}}=n{I}_k$, with each row after the first obtained by a cyclic shift of its predecessor by one position? For obvious reasons we call such matrices circulant partial Hadamard matrices. Further, what is the maximum value of k subject to the condition that the row sums are equal to r?     

SOME PROPERTIES OF COMMUTING AND ANTI-COMMUTING m-INVOLUTIONS

We define an m-involution to be a matrix K ∈ Cn×n for which Km =I.In this article,we investigate the class Sm (A) of m-involutions that commute with a diagonalizable matrix A ∈ Cn×n.A number of basic p...     

On zeros of solutions of higher order homogeneous linear differential equations

In this article, we investigate the exponent of convergence of zeros of solutions for some higher-order homogeneous linear differential equation, and prove that if A_k−1 is the dominant coefficient, then every transcendental solution f(z) of equation

f(k)+A_k-1 f(k-1)+?+A₀ f=0$f^{(k)}+A_{k-1}\hspace{0.17em}{f}^{(k-1)}+?+A_0\hspace{0.17em}f=0$

satisfies λ(f) = ∞, where λ(f) denotes the exponent of convergence of zeros of the meromorphic function f(z).     

Müntz-type theorems on the half-line with weights

We consider the linear span S   of the functions t^_ak$t^{a_k}$ (with some _ak>0$a_k>0$) in weighted L²$L^2$ spaces, with rather general weights. We give one necessary and one sufficient condition for S to be dense. Some comparisons are also made between the new results and those that can be deduced from older ones in the literature.     

The complexity of tropical matrix factorization

The tropical arithmetic operations on R are defined by a⊕b=min{a,b}$a\oplus b=\min \{a,b\}$ and a⊗b=a+b$a\otimes b=a+b$. Let A be a tropical matrix and k   a positive integer, the problem of Tropical Matrix Factorization (TMF) asks whether there exist tropical matrices B∈R^m×k$B\in {\mathbf{R}}^{m\times k}$ and C∈R^k×n$C\in {\mathbf{R}}^{k\times n}$ satisfying B⊗C=A$B\otimes C=A$. We show that the TMF problem is NP-hard for every k≥7$k\ge 7$ fixed in advance, thus resolving a problem proposed by Barvinok in 1993.