Search arXiv⌕ Search

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

Domination in Johnson graphs J(n, 3) for odd n

In 2025 Cornet, Dravec, and Torres determined the domination number $γ(J(n,3))$ of the Johnson graph for every even $n \ge 6$, expressing it as a closed form $ϕ_n$ in terms of Fort-Hedlund covering numbers, and conjectured the same value for odd $n$. We prove this conjecture: $γ(J(n,3)) = ϕ_n$ for every odd $n \ge 7$. A dominating set of $J(n,3)$ is the same as a lotto design $\mathrm{LD}(n,3,3,2)$, and the lotto numbers $L(n,3,3,2)$, and hence $γ(J(n,3))$, were already determined for every $n$ by Bate (1978) and by Brouwer (1981); a short degree argument of Füredi, Székely, and Zubor (1996) gives the same lower bound for all $n \not\equiv 9, 10 \pmod{12}$. The contribution of this paper is therefore a new proof of the odd case, carried out within the bijective framework of Cornet, Dravec, and Torres.

math.CO↗

HJ numbers revisited

Hales-Jewett theorem is well known. We prove a primitive recursive bound, in fact an $\clE^5$ one, for the density version. In preparation we deal with what was the main induction step in the old proof of Hales-Jewett as a result in its own right with better bounds. Also in improving our bounds.

math.CO↗

Adjacency-degree algebras and spectral determination of graphs

Let $G$ be a graph with adjacency matrix $A$ and degree matrix $D$. Applying $A$ and $D$ repeatedly to the all-ones vector produces a space $M_G$ of functions on the vertices, and these functions are constant on the orbits of the automorphism group. We call $G$ AD-observable if $M_G$ contains the indicator vector of every orbit, and AD-separable if the functions in $M_G$ separate the orbits. Forests are AD-observable, by McKay's leaf-pruning argument. Our main result is that for every cograph, $M_G$ is spanned by the indicator vectors of the cells of the stable partition of color refinement. Hence a cograph is AD-observable, or equivalently AD-separable, exactly when color refinement finds its orbits, and we describe these cographs by their cotrees. We also show that two cographs with the same number of vertices and the same homomorphism counts from all caterpillars have the same counts from all trees. The main result does not extend to distance-hereditary graphs: we give two such graphs on nine vertices that are AD-separable but not AD-observable.

math.CO↗