Counting modulo finite semigroups
نویسندگان
چکیده
منابع مشابه
Model Counting Modulo Theories
This thesis is concerned with the quantitative assessment of security in software. More specifically, it tackles the problem of efficient computation of channel capacity, the maximum amount of confidential information leaked by software, measured in Shannon entropy or Rényi’s min-entropy. Most approaches to computing channel capacity are either efficient and return only (possibly very loose) up...
متن کاملFinite semigroups as categories, ordered semigroups or compact semigroups
The results presented in this section are a good illustration of the following quotation of Marshall Stone [34]: ’A cardinal principle of modern mathematical research may be stated as a maxim: “One must always topologize” ’. Varieties of finite semigroups are a good example where Stone’s principle was applied successfully. Recall that a variety of semigroups is a class of semigroups closed unde...
متن کاملCounting faces of cubical spheres modulo two
Several recent papers have addressed the problem of characterizing the f -vectors of cubical polytopes. This is largely motivated by the complete characterization of the f -vectors of simplicial polytopes given by Stanley, Billera, and Lee in 1980 [19] [4]. Along these lines Blind and Blind [5] have shown that unlike in the simplicial case, there are parity restrictions on the f -vectors of cub...
متن کاملCounting Homomorphisms to Trees Modulo a Prime
Many important graph theoretic notions can be encoded as counting graph homomorphism problems, such as partition functions in statistical physics, in particular independent sets and colourings. In this article we study the complexity of #pHomsToH, the problem of counting graph homomorphisms from an input graph to a graph H modulo a prime number p. Dyer and Greenhill proved a dichotomy stating t...
متن کاملCounting modulo Quantiiers on Nite Structures
We give a combinatorial method for proving elementary equivalence in rst-order logic FO with counting modulo n quantiiers D n. Inexpressibility results for FO(D n) with built-in linear order are also considered. For instance, the class of linear orders of length divisible by n + 1 cannot be expressed in FO(D n). Using this result we prove that comparing cardinalities or connectivity of ordered ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00112-2