Results 241 to 250 of about 396,223 (265)
Some of the next articles are maybe not open access.
Econometrica, 1976
Recent papers by Houthakker [3 and 4], Samuelson [8 and 9], Sir John Hicks [2], and others deal with the question of the existence of a nontrivial preference ordering which exhibits the same mathematical properties in terms of both the direct and indirect utility functions.
openaire +2 more sources
Recent papers by Houthakker [3 and 4], Samuelson [8 and 9], Sir John Hicks [2], and others deal with the question of the existence of a nontrivial preference ordering which exhibits the same mathematical properties in terms of both the direct and indirect utility functions.
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 1994
Summary: The authors present a construction of binary self-dual codes from Eulerian graphs and establish that the code will be indecomposable if and only if the vertices of degree 2 are not a cutset of the graph. The construction is used to establish that every finite group is isomorphic to the automorphism group of some self-dual code.
Babai, L., Oral, H., Phelps, K. T.
openaire +1 more source
Summary: The authors present a construction of binary self-dual codes from Eulerian graphs and establish that the code will be indecomposable if and only if the vertices of degree 2 are not a cutset of the graph. The construction is used to establish that every finite group is isomorphic to the automorphism group of some self-dual code.
Babai, L., Oral, H., Phelps, K. T.
openaire +1 more source
Algebra Universalis, 2002
Given a finitely based self-dual variety of lattices, there is the question whether it is definable by a single self-dual lattice identity. The authors use several methods producing a single identity which is equivalent to a finite set of given identities.
Kelly, David, Padmanabhan, R.
openaire +1 more source
Given a finitely based self-dual variety of lattices, there is the question whether it is definable by a single self-dual lattice identity. The authors use several methods producing a single identity which is equivalent to a finite set of given identities.
Kelly, David, Padmanabhan, R.
openaire +1 more source
Irredundant self-dual bases for self-dual lattice varieties
algebra universalis, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kelly, David, Padmanabhan, R.
openaire +2 more sources
Self-Dual Codes and Self-Dual Designs
1990We construct self-orthogonal binary codes from projective 2 - (v, k, λ) designs with a polarity, k odd, and λ even. We give arithmetic conditions on the parameters of the design to obtain self-dual or doubly even self-dual codes. Non existence results in the latter case are obtained from rationality conditions of certain strongly regular graphs.
openaire +1 more source