It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from a finite group and n of its subgroups [1]. However, if one restricts attention to abelian groups then not all entropy vectors can be obtained. This is an explanation for the fact shown by Dougherty et al [2] that lin...

The authors have been investigating metrics of extremely low frequency magnetic field exposure under different circumstances. In this paper, we describe the properties of magnetic fields in homes, in the vicinity of powerlines, on trains and from a library security system. We conclude that there are key differences between each of these fields. This suggests that there may be a characterizable ...

Research in discourse processing has identi ed two representational requirements for discourse planning systems. First, discourse plans must adequately represent the intentional structure of the utterances they produce in order to enable a computational discourse agent to respond e ectively to communicative failures [15]. Second, discourse plans must represent the informational structure of utt...

A proof system is called doubly-efficient if the prescribed prover strategy can be implemented in polynomial-time and the verifier’s strategy can be implemented in almost-linear-time. We present direct constructions of doubly-efficient interactive proof systems for problems in P that are believed to have relatively high complexity. Specifically, such constructions are presented for t-CLIQUE and...

Let $L = U_3(9)$ be the simple projective unitary group in dimension 3 over a field  with 92 elements. In this article, we classify groups with the same order and degree pattern as an almost simple group related to $L$. Since $Aut(L)equiv Z_4$ hence almost simple groups related to $L$ are $L$, $L : 2$ or $L : 4$. In fact, we prove that $L$, $L : 2$ and $L : 4$ are OD-characterizable.

One of the important problems in group theory is characterization of a group by a given property, that is, to prove there exist only one group with a given property. Let  be a finite group. We denote by  the largest order of elements of . In this paper, we prove that some Suzuki groups are characterizable by order and the largest order of elements. In fact, we prove that if  is a group with  an...

A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characterizability implies a definability property of the class of partial orders in monadic second-order logic. Based on a non-definability result for a class of partial orders, an exampl...

Motivated by aspects of reasoning in theories of physics, Robin Giles defined a characterization of infinite valued Lukasiewicz logic in terms of a game that combines Lorenzen-style dialogue rules for logical connectives with a scheme for betting on results of dispersive experiments for evaluating atomic propositions. We analyze this game and provide conditions on payoff functions that allow us...