Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

In Noether's original presentation of her celebrated theorem of 1918, allowances were made for the dependence of the coefficient functions of the differential operator which generated the infinitesimal transformation of the Action Integral upon the derivatives of the dependent variable(s), the so-called generalized, or dynamical, symmetries. A similar allowance is to be found in the variables of the boundary function, often termed a gauge function by those who have not read the original paper. This generality was lost after texts such as those of Courant and Hilbert or Lovelock and Rund confined attention to only point transformations. In recent decades, this diminution of the power of Noether's Theorem has been partly countered, in particular, in the review of Sarlet and Cantrijn. In this Special Issue, we emphasize the generality of Noether's Theorem in its original form and explore the applicability of even more general coefficient functions by allowing for nonlocal terms. We also look at the application of these more general symmetries to problems in which parameters or parametric functions have a more general dependence upon the independent variables.

Symmetry.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group.

Symmetry (Mathematics)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This reprint is dedicated to Professor Delfim F. M. Torres for his 50th birthday. Professor Delfim F. M. Torres is a recognized researcher, particularly in the calculus of variations, optimal control, and mathematical biology. In this reprint, several studies in his research fields are presented.

Symmetry (Physics)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Symmetry. --- Aesthetics --- Proportion

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Geometry, Analytic --- Symmetry