The nth power of the volume functional Vnof polytopes P in R^n, according to dimensions of the spaces spanned by any nunit outer normal vectors of P, is decomposed into nhomogeneous polynomials of degree n. A set of new sharp affine isoperimetric inequalities for these volume decomposition functionals in R^3 are established, which essentially characterize the geometric and algebraic structures of polytopes.

This article focuses on the discrete double-curl operator arising in the Maxwell equation that models three dimensional photonic crystals with face centered cubic lattice. The discrete double-curl operator is the degenerate coefficient matrix of the generalized eigenvalue problems (GEVP) due to the Maxwell equation. We derive an eigendecomposition of the degenerate coefficient matrix and explore an explicit form of orthogonal basis for the range and null spaces of this matrix. To solve the GEVP, we apply these theoretical results to project the GEVP to a standard eigenvalue problem (SEVP), which involves only the eigenspace associated with the nonzero eigenvalues of the GEVP and therefore the zero eigenvalues are excluded and will not degrade the computational efficiency. This projected SEVP can be solved efficiently by the inverse Lanczos method. The linear systems within the inverse Lanczos method are well-conditioned and can be solved efficiently by the conjugate gradient method without using a preconditioner. We also demonstrate how two forms of matrix-vector multiplications, which are the most costly part of the inverse Lanczos method, can be computed by fast Fourier transformation due to the eigendecomposition to significantly reduce the computation cost. Integrating all of these findings and techniques, we obtain a fast eigenvalue solver. The solver has been implemented by MATLAB and successfully solves each of a set of $5.184$ million dimension eigenvalue problems within $50$ to $104$ minutes on a workstation with two Intel Quad-C ore Xeon X5687 3.6 GHz CPUs.

Let k be a commutative Noetherian ring and C−− be a locally finite k-linear category equipped with a self-embedding functor of degree 1. We show under a moderate condition that finitely generated torsion representations of C−− are super finitely presented (that is, they have projective resolutions each term of which is finitely generated). In the situation that these self-embedding functors are genetic functors, we give upper bounds for homological degrees of finitely generated torsion modules. These results apply to quite a few categories recently appearing in representation stability theory. In particular, when k is a field of characteristic 0, we obtain another upper bound for homological degrees of finitely generated FI-modules.

No abstract uploaded!

Recovering low-rank structures via eigenvector perturbation analysis is a common problem in statistical machine learning, such as in factor analysis, community detection, ranking, matrix completion, among others. While a large variety of results provide tight bounds on the average errors between empirical and population statistics of eigenvectors, fewer results are tight for entrywise analyses, which are critical for a number of problems such as community detection and ranking.