Reiner and Webb (preprint, 2002) compute the Sn-module structure for the complex of injective words. This paper refines their formula by providing a Hodge type decomposition. Along the way, this paper proves that the simplicial boundary map interacts in a nice fashion with the Eulerian idempotents. The Laplacian acting on the top chain group in the complex of injective words is also shown to eq...

We prove explicit $$L^p$$ bounds for second order Riesz transforms of the sub-Laplacian and Laplacian in Lie groups $${\mathbb {H}}$$ , $$\mathbb {SU}(2)$$ $$\widetilde{\mathbb {SL}}(2)$$ . Our proof makes use martingale transform techniques specific commutation properties between complex gradient those groups.

for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...

Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.

In this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The coefficients of these polynomials can be used as graph features which can be encoded in a vectorial manner. We extend this representation to graphs in which there are una...

In this paper we consider optimal estimators for speech enhancement in the Discrete Fourier Transform (DFT) domain. We derive an analytical solution for estimating complex DFT coefficients in the MMSE sense when the clean speech DFT coefficients are Laplacian distributed and the DFT coefficients of the noise are Gaussian or Laplacian distributed. We show that these estimators have a number of i...

The uniform recursive tree (URT) is one of the most important models and has been successfully applied to many fields. Here we study exactly the topological characteristics and spectral properties of the Laplacian matrix of a deterministic uniform recursive tree, which is a deterministic version of URT. Firstly, from the perspective of complex networks, we determine the main structural characte...