In this paper we prove some new results concerning multi-dimensional Hardy type integral inequalities and also some corresponding limit Pólya–Knopp type inequalities.

A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and hybrid solvers. Besides practical applications, the problem of counting propositional models is of key relevancy in computational complexity. In recent years a number of algorithms have been proposed for propositional ...

We do computational studies concerning the enumeration of isolated cliques in graphs. Isolation, as recently introduced, measures the degree of connectedness of the cliques to the rest of the graph. Isolation helps both in getting faster algorithms than for the enumeration of maximal general cliques and in filtering out cliques with special semantics. We compare three isolation concepts and the...

Definition 2.2 (Enumeration Order Reducibility on Listings and sets) 1. For listings , : we say is “Enumeration order reducible” to and write , if and only if, , ( . 2. For r.e. sets , , we say is “Enumeration order reducible” to and write , if and only if, for any listing of there exist some computable function (from the listings of to the listings of ) such that . 3. For two listings , (r.e. ...

We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent to enumeration of certain vector subspaces in finite fields. In particular, we present enumeration results for quasi-cyclic subcodes of the si...