Search arXivSearch

arXiv · math/0301042

On the symmetry classes of the first covariant derivatives of tensor fields

Abstract

We show that the symmetry classes of torsion-free covariant derivatives $\nabla T$ of r-times covariant tensor fields T can be characterized by Littlewood-Richardson products $σ[1]$ where $σ$ is a representation of the symmetric group $S_r$ which is connected with the symmetry class of T. If $σ= [λ]$ is irreducible then $σ[1]$ has a multiplicity free reduction $[λ][1] = \sum [μ]$ and all primitive idempotents belonging to that sum can be calculated from a generating idempotent e of the symmetry class of T by means of the irreducible characters or of a discrete Fourier transform of $S_{r+1}$. We apply these facts to derivatives $\nabla S$, $\nabla A$ of symmetric or alternating tensor fields. The symmetry classes of the differences $\nabla S - sym(\nabla S)$ and $\nabla A - alt(\nabla A)$ are characterized by Young frames (r, 1) and (2, 1^{r-1}), respectively. However, while the symmetry class of $\nabla A - alt(\nabla A)$ can be generated by Young symmetrizers of (2, 1^{r-1}), no Young symmetrizer of (r, 1) generates the symmetry class of $\nabla S - sym(\nabla S)$. Furthermore we show in the case r = 2 that $\nabla S - sym(\nabla S)$ and $\nabla A - alt(\nabla A)$ can be applied in generator formulas of algebraic covariant derivative curvature tensors. For certain symbolic calculations we used the Mathematica packages Ricci and PERMS.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

B. Fiedler. 2003-01-06. On the symmetry classes of the first covariant derivatives of tensor fields. https://arxiv.org/abs/math/0301042

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO