We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce structural properties of Bayesian networks, which is important within causal inference.
We use the exterior product of double forms to free from coordinates celebrated classical results of linear algebra about matrices and bilinear forms namely Cayley-Hamilton theorem, Laplace expansion of the determinant, Newton identities and Jacobi’s formula for the determinant. This coordinate free formalism is then used to easily generalize the previous results to higher multilinear forms namely to double forms. In particular, we show that the Cayley-Hamilton theorem once applied to the second...
Let We call a complex number “semigroup free“ if the semigroup generated by and is free and “free” if the group generated by and is free. First families of semigroup free ’s were described by J. L. Brenner, A. Charnow (1978). In this paper we enlarge the set of known semigroup free ’s. To do it, we use a new version of “Ping-Pong Lemma” for semigroups embeddable in groups. At the end we present most of the known results related to semigroup free and free numbers in a common picture....
For every positive definite quadratic form in variables the reciprocal of the square root of the discriminant is equal to the arithmetic mean of the values assumed by the form on the sphere centered at and with radius raised to the ()-th. power. Various consequences are deduced from this, in particular a simplification of some calculations from which one obtains the possibility of solving linear systems using spherical means rather than determinants.
When a system of one-sided max-plus linear equations is inconsistent, the approximate solutions within an admissible error bound may be desired instead, particularly with some sparsity property. It is demonstrated in this paper that obtaining the sparsest approximate solution within a given error bound may be transformed in polynomial time into the set covering problem, which is known to be NP-hard. Besides, the problem of obtaining the sparsest approximate solution within a given error bound...