Related papers: Scott's problem for proper Scott sets
Let $A$ be an integral domain with quotient field $K$ of characteristic $0$ that is finitely generated as a $\mathbb{Z}$-algebra. Denote by $D(F)$ the discriminant of a polynomial $F\in A[X]$. Further, given a finite etale algebra $\Omega$,…
The goal of this paper is to show there is a single orbit of the c.e. sets with inclusion, $\mathcal{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:…
Let $G$ be a matroid on ground set \A. The Orlik-Solomon algebra $A(G)$ is the quotient of the exterior algebra \E on \A by the ideal \I generated by circuit boundaries. The quadratic closure $\bar{A}(G)$ of $A(G)$ is the quotient of \E by…
We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler. Through the analysis of the SAT problem using the elements,…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
We study a finite dimensional quadratic graded algebra R defined from a finite ranked poset. This algebra has been central to the study of the splitting algebra of the poset, A, as introduced by Gelfand, Retakh, Serconek and Wilson . The…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for…
We intend to create new concepts aimed at finding necessary and sufficient conditions for Boolean satisfiability so that these conditions can be verified in polynomial time. Based on these conditions it will be possible to create an…
Let $f:X\to U$ be a projective morphism of normal varieties and $(X,\Delta)$ a dlt pair. We prove that if there is an open set $U^0\subset U$, such that $(X,\Delta)\times_U U^0$ has a good minimal model over $U^0$ and the images of all the…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
With the long-term goal of proving local structure theorems of algebraic stacks in positive characteristic near points with reductive (but possibly non-linearly reductive) stabilizer, we conjecture that quotient stacks of the form…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be fully abstract, i.e. a…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
In this paper we present an arbitrary-order fully discrete Stokes complex on general polyhedral meshes. We enriche the fully discrete de Rham complex with the addition of a full gradient operator defined on vector fields and fitting into…