Related papers: Scott's problem for proper Scott sets
We say that a group is anti-solvable if all of its composition factors are non-abelian. We consider a particular family of anti-solvable finite groups containing the simple alternating groups for $n\neq 6$ and all 26 sporadic simple groups.…
In this paper, we investigate the relationship between the Tukey order and PCF theory, as applied to sets of regular cardinals. We show that it is consistent that for all sets $A$ of regular cardinals that the Tukey spectrum of $A$, denoted…
In this paper, we present an algorithm which computes a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in two variables, based on (Barkatou, 1997). A first step was set in…
Schaefer's dichotomy theorem [Schaefer, STOC'78] states that a boolean constraint satisfaction problem (CSP) is polynomial-time solvable if one of six given conditions holds for every type of constraint allowed in its instances. Otherwise,…
We investigate the connection between bijective, not necessarily finite, set-theoretic solutions of the pentagon equation and Hopf algebras. Firstly, we prove that finite solutions correspond to Hopf algebras with the positive basis…
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently.…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known, require efficient solution…
A homomorphic public key crypto-scheme based on the Boolean Satisfiability Problem is proposed. The public key is a SAT formula satisfied by the private key. Probabilistic encryption generates functions implied to be false by the public key…
We study a generalization of the Set Cover problem called the \emph{Partial Set Cover} in the context of geometric set systems. The input to this problem is a set system $(X, \mathcal{S})$, where $X$ is a set of elements and $\mathcal{S}$…
Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…
We study deformation quantizations of the structure sheaf O_X of a smooth algebraic variety X in characteristic 0. Our main result is that when X is D-affine, any formal Poisson structure on X determines a deformation quantization of O_X…
This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…
Earlier we introduced the notion of a stable set of points (SSP). We proved that a CNF formula is unsatisfiable iff there is a set of points (i.e. complete assignments) that is stable with respect to this formula. Experiments showed that…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, $\E$, such that the question of membership in this orbit is $\Sigma^1_1$-complete. This result and proof have a number of nice corollaries: the…
Static verification techniques leverage Boolean formula satisfiability solvers such as SAT and SMT solvers that operate on conjunctive normal form and first order logic formulae, respectively, to validate programs. They force bounds on…
For the fractional order systems \[D^\alpha x(t)=f(x),\quad 0<\alpha\leq 1,\] one can have a critical value of $\alpha$ viz $\alpha_*$ such that the system is stable for $0<\alpha<\alpha_*$ and unstable for $\alpha_*<\alpha\leq 1$. In…
We obtain a necessary and sufficient condition for an algebraic set in a group to have a fully characteristic radical. As a result, we see that if the radical of a system of equation $S$ over a group $G$ is fully characteristic, then there…
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side, especially that of Conflict-Driven Clause Learning (CDCL) and Local Search SAT…