scholarly journals Unitriangular basic sets for blocks of the symmetric and alternating groups of small weights

Author(s):  
Ana Bernal
1981 ◽  
Vol 4 (3) ◽  
pp. 675-760
Author(s):  
Grażyna Mirkowska

The aim of propositional algorithmic logic is to investigate the properties of program connectives. Complete axiomatic systems for deterministic as well as for nondeterministic interpretations of program variables are presented. They constitute basic sets of tools useful in the practice of proving the properties of program schemes. Propositional theories of data structures, e.g. the arithmetic of natural numbers and stacks, are constructed. This shows that in many aspects PAL is close to first-order algorithmic logic. Tautologies of PAL become tautologies of algorithmic logic after replacing program variables by programs and propositional variables by formulas. Another corollary to the completeness theorem asserts that it is possible to eliminate nondeterministic program variables and replace them by schemes with deterministic atoms.


2013 ◽  
Vol 807-809 ◽  
pp. 2366-2370
Author(s):  
Hua Ping Yang ◽  
Ming Li ◽  
Zheng Xin Yan ◽  
Dong Zhi Yan

The coal molecule model and the absorption model of coal and methane were established according to Van der Walls force. The coal molecule model and the absorption model of coal and methane were optimized and obtained absorption energy and equilibrium structure with the DFT method with 6-311G++ basic sets. The effects of coal molecule on the absorption position, absorption energy and absorption distance of CH4 were presented by analyzing the Mulliken atomic charges of coal molecules.


2008 ◽  
Vol 115 (7) ◽  
pp. 1235-1245 ◽  
Author(s):  
Marcel Herzog ◽  
Gil Kaplan ◽  
Arieh Lev

1993 ◽  
Vol 21 (2) ◽  
pp. 583-600 ◽  
Author(s):  
Alexander S. Kleshchev ◽  
Alexander A. Premet

1999 ◽  
Vol 38 (3) ◽  
pp. 159-170 ◽  
Author(s):  
A. V. Zavarnitsin ◽  
V. D. Mazurov

2014 ◽  
Vol 17 (5) ◽  
Author(s):  
John R. Britnell ◽  
Mark Wildon

AbstractIt is known that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general captures more information; using this invariant the result on centralizers is extended to arbitrary fields. The converse is also proved: thus two matrices have conjugate centralizers if and only if they have the same generalized type. The paper ends with the analogous results for symmetric and alternating groups.


Sign in / Sign up

Export Citation Format

Share Document