Related papers: All about unambiguous polynomial closure
In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…
We study the umbral "classical" orthogonal polynomials with respect to a generalized derivative operator $\cal D$ which acts on monomials as ${\cal D} x^n = \mu_n x^{n-1}$ with some coefficients $\mu_n$. Let $P_n(x)$ be a set of orthogonal…
We prove a new universal identity for umbral operators. This motivates the definition of a subclass satisfying a simplified identity, which we fully characterize. The results are illustrated with common examples of the theory of umbral…
We prove that unital graph C*-algebras often admit a convenient decomposition into amalgamated free products. We use this to give a complete characterization of when a unital graph C*-algebra is residually finite-dimensional and when it is…
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…
We characterize matrix polynomials $P,Q$ such that the inequality $$ \left\Vert Q(D)u\right\Vert _{L^{2}}\leq C\left\Vert P(D)u\right\Vert _{L^{2}}\quad\text{for all }u\in C_c^\infty(\Omega), $$ holds on bounded open sets $\Omega$. We also…
We introduced previously the generalized characteristic polynomial defined by $P_C(\lambda)={\rm det}\,C(\lambda),$ where $C(\lambda)=C+{\rm diag}\big(\lambda_1,\dots,\lambda_n\big)$ for $C\in {\rm Mat}(n,\mathbb C)$ and…
An {\omega}-language is a set of infinite words over a finite alphabet X. We consider the class of recursive {\omega}-languages, i.e. the class of {\omega}-languages accepted by Turing machines with a B\"uchi acceptance condition, which is…
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…
We describe a congruence property of solvable polynomials over Q, based on the irreducibility of cyclotomic polynomials over number fields that meet certain conditions.
Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered. A term $t$ using the bi-Kleene operations $0,1, +, \cdot\, ,^*, \parallel,…
Recently, using machinery's from Ergodic theory, Z. Lian, and R. Xiao proved if $P$ is any polynomial with no constant term, then for every finite coloring of $\mathbb{N}$, there exists two infinite subsets $B,C$ of $\mathbb{N}$ such that…
We prove some unconditional cases of the Existential Closedness problem for the modular $j$-function. For this, we show that for any finitely generated field we can find a "convenient" set of generators. This is done by showing that in any…
The class $\mathcal{UP}$ of `ultimate polynomial time' problems over $\mathbb C$ is introduced; it contains the class $\mathcal P$ of polynomial time problems over $\mathbb C$. The $\tau$-Conjecture for polynomials implies that…
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential…
We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…
We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…
We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
We continue our study of open and closed languages. We investigate how the properties of being open and closed are preserved under concatenation. We investigate analogues, in formal languages, of the separation axioms in topological spaces;…