Related papers: Satisfiability degrees for BCK-algebras
In recent years, a large class of nuclear $C^\ast$-algebras have been classified, modulo an assumption on the Universal Coefficient Theorem (UCT). We think this assumption is redundant and propose a strategy for proving it. Indeed,…
Remark.9 in Bose-Dasgupta-Rubin (2002) review states that when a non-negative integer-valued infinitely divisible law has an atom at unity then its support cannot have any gaps. Here one has two questions. (i) Why there are no gaps and (ii)…
There has been a great of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the validity problem for all logics between K, T, and S4 is {\sl…
We study the fluted fragment of first-order logic which is often viewed as a multi-variable non-guarded extension to various systems of description logics lacking role-inverses. In this paper we show that satisfiable fluted sentences (even…
Let $B$ be a Banach algebra. The interest of this article lies in the study of the commutativity of B if certain specific algebraic identities hold over a non-empty open subset of B. The limitations imposed in the hypothesis of our results…
Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…
We introduce the completely positive rank, a notion of covering dimension for nuclear $C^*$-algebras and analyze some of its properties. The completely positive rank behaves nicely with respect to direct sums, quotients, ideals and…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We construct irreducible balanced non-transitive sets of $n$-sided dice for any positive integer $n$, which was raised in \cite[Question 5.2]{SS17}. One main tool of the construction is to study so-called fair sets of dice. Furthermore, we…
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…
The concept of subgroup commutativity degree of a finite group $G$ is arising interest in several areas of group theory in the last years, since it gives a measure of the probability that a randomly picked pair $(H,K)$ of subgroups of $G$…
A well-known theorem of Gustafson states that in a non-Abelian group the degree of satisfiability of $xy=yx$, i.e. the probability that two uniformly randomly chosen group elements $x,y$ obey the equation $xy=yx$, is no larger than…
Let A,B be finite dimensional G-graded algebras over an algebraically closed field K with char(K)=0, where G is an abelian group, and let Id_G(A) be the set of graded identities of A (res. Id_G(B)). We show that if A,B are G-simple then…
The problem of identifying the satisfiability threshold of random $3$-SAT formulas has received a lot of attention during the last decades and has inspired the study of other threshold phenomena in random combinatorial structures. The…
We prove the conjecture of Frenkel, Kac and Wakimoto on the existence of two-sided BGG resolutions of G-integrable admissible representations of affine Kac-Moody algebras at fractional levels. As an application we establish the…
We give simple necessary and sufficient conditions for the inclusion-exclusion identity to hold for an infinite countable number of sets. In terms of a random variable, whose range are nonnegative integers, this condition is equivalent to…
Propositional satisfiability (SAT) is one of the most fundamental problems in computer science. The worst-case hardness of SAT lies at the core of computational complexity theory. The average-case analysis of SAT has triggered the…
We show that nuclear C*-algebras have a refined version of the completely positive approximation property, in which the maps that approximately factorize through finite dimensional algebras are convex combinations of order zero maps. We use…
This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?…
We show that the conditional independence (CI) implication problem with bounded cardinalities, which asks whether a given CI implication holds for all discrete random variables with given cardinalities, is co-NEXPTIME-hard. The problem…