Related papers: Scott's problem for proper Scott sets
In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\Phi$), where $\Phi$ is a given set of quantifier-free…
Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…
Let $p$ be a prime number, $G$ a finite group, $P$ a $p$-subgroup of $G$ and $k$ an algebraically closed field of characteristic $p$. We study the relationship between the category $\Ff_P(G)$ and the behavior of $p$-permutation $kG$-modules…
Design optimization and uncertainty quantification, among other applications of industrial interest, require fast or multiple queries of some parametric model. The Proper Generalized Decomposition (PGD) provides a separable solution, a…
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…
We prove that every ordinal $\alpha<\omega_2$ is the order type of a certain system of uniform Borel sets in the sense of a well-ordering relation defined by Petr Novikov. This result gives a positive answer to a problem posed by Nicolas…
In this paper, we introduce the notion of $\mathcal{M}$-convergence and $\mathcal{MN}$-convergence structures in posets, which, in some sense, generalise the well-known Scott-convergence and order-convergence structures. As results, we give…
The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…
We present several equivalent conditions of the continuity of the supremum function from the square of the Scott space of $C(X)$ to itself under mild assumptions, where $C(X)$ denotes the lattice of closed subsets of a $\mathbf{T_0}$…
This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra $B_{0}=\{0,1\}$ and find all satisfying assignments. The algorithm is based…
We consider the thesis that an arithmetical relation, which holds for any, given, assignment of natural numbers to its free variables, is Turing-decidable if, and only if, it is the standard representation of a PA-provable formula. We show…
This paper is concerned with the stabilization problem of singular fractional order systems with order $\alpha\in(0,2)$. In addition to the sufficient and necessary condition for observer based control, a sufficient and necessary condition…
A finite poset (partially ordered set) $P$ with ${\hat 0}$ is called of distributive type if every interval $[{\hat 0}, a]$, $a \in P$, of $P$ is a distributive lattice. From a viewpoint of ASL's (algebras with straightening laws), the…
Let $\mathcal{X}$ be a tame proper Deligne-Mumford stack of the form $[M/G]$ where $M$ is a scheme and $G$ is an algebraic group. We prove that the stack $\mathcal{K}_{g,n}(\mathcal{X},d)$ of twisted stable maps is a quotient stack and can…
We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over s-AFAs have linear complexity, which is in…
There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…
A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…
We construct a probabilistic finite automaton (PFA) with 7 states and an input alphabet of 5 symbols for which the PFA Emptiness Problem is undecidable. The only input for the decision problem is the starting distribution. For the proof, we…
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…
We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…