Onsager Symmetry Relation

Author(s):  
Hans Knof
2018 ◽  
Vol 106 (03) ◽  
pp. 342-360 ◽  
Author(s):  
G. CHIASELOTTI ◽  
T. GENTILE ◽  
F. INFUSINO

In this paper, we introduce asymmetry geometryfor all those mathematical structures which can be characterized by means of a generalization (which we call pairing) of a finite rectangular table. In more detail, let$\unicode[STIX]{x1D6FA}$be a given set. Apairing$\mathfrak{P}$on$\unicode[STIX]{x1D6FA}$is a triple$\mathfrak{P}:=(U,F,\unicode[STIX]{x1D6EC})$, where$U$and$\unicode[STIX]{x1D6EC}$are nonempty sets and$F:U\times \unicode[STIX]{x1D6FA}\rightarrow \unicode[STIX]{x1D6EC}$is a map having domain$U\times \unicode[STIX]{x1D6FA}$and codomain$\unicode[STIX]{x1D6EC}$. Through this notion, we introduce a local symmetry relation on$U$and a global symmetry relation on the power set${\mathcal{P}}(\unicode[STIX]{x1D6FA})$. Based on these two relations, we establish the basic properties of our symmetry geometry induced by$\mathfrak{P}$. The basic tool of our study is a closure operator$M_{\mathfrak{P}}$, by means of which (in the finite case) we can represent any closure operator. We relate the study of such a closure operator to several types of others set operators and set systems which refine the notion of an abstract simplicial complex.


10.37236/5350 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Maria Monks Gillespie

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t)=\widetilde{H}_{\mu^\ast}(\mathbf{x};t,q)$. We provide a purely combinatorial proof of the relation in the case of Hall-Littlewood polynomials ($q=0$) when $\mu$ is a partition with at most three rows, and for the coefficients of the square-free monomials in $\mathbf{x}$ for all shapes $\mu$. We also provide a proof for the full relation in the case when $\mu$ is a hook shape, and for all shapes at the specialization $t=1$. Our work in the Hall-Littlewood case reveals a new recursive structure for the cocharge statistic on words.


2020 ◽  
Vol 8 ◽  
Author(s):  
Mathias Winkler ◽  
Magnus Aa. Gjennestad ◽  
Dick Bedeaux ◽  
Signe Kjelstrup ◽  
Raffaela Cabriolu ◽  
...  

1979 ◽  
Vol 34 (11) ◽  
pp. 1275-1278 ◽  
Author(s):  
S. Grossmann

A variational principle for linear relaxation phenomena is considered. I t connects relaxation with anti-relaxation. The latter one is governed by the transposed transport matrix and, in addition, by the diffusion matrix, which drops if Onsager-symmetry holds. This generalizes an earlier result by L. Waldmann


2019 ◽  
Vol 85 (2) ◽  
Author(s):  
Thomas Antonsen ◽  
Elizabeth J. Paul ◽  
Matt Landreman

The shape gradient quantifies the change in some figure of merit resulting from differential perturbations to a shape. Shape gradients can be applied to gradient-based optimization, sensitivity analysis and tolerance calculation. An efficient method for computing the shape gradient for toroidal three-dimensional magnetohydrodynamic (MHD) equilibria is presented. The method is based on the self-adjoint property of the equations for driven perturbations of MHD equilibria and is similar to the Onsager symmetry of transport coefficients. Two versions of the shape gradient are considered. One describes the change in a figure of merit due to an arbitrary displacement of the outer flux surface; the other describes the change in the figure of merit due to the displacement of a coil. The method is implemented for several example figures of merit and compared with direct calculation of the shape gradient. In these examples the adjoint method reduces the number of equilibrium computations by factors of$O(N)$, where$N$is the number of parameters used to describe the outer flux surface or coil shapes.


1969 ◽  
Vol 61 (2) ◽  
pp. 320-324
Author(s):  
M. Saleem ◽  
M. Rafique
Keyword(s):  

1972 ◽  
Vol 5 (6) ◽  
pp. 1288-1296 ◽  
Author(s):  
L. C. Biedenharn ◽  
P. J. Brussaard ◽  
C. V. Sheth ◽  
N. V. V. J. Swamy ◽  
J. Cooper

Sign in / Sign up

Export Citation Format

Share Document