Related papers: Drawing Sound Conclusions from Unsound Premises

Let $\R(\cdot)$ stand for the bounded-error randomized query complexity. We show that for any relation $f \subseteq \{0,1\}^n \times \mathcal{S}$ and partial Boolean function $g \subseteq \{0,1\}^n \times \{0,1\}$, $\R_{1/3}(f \circ g^n) =…

Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…

Let $m\geq 1$ and $a_m$ be integers. Let $\alpha$ be a rational number which is not a negative integer such that $\alpha = \frac{u}{v}$ with $\gcd(u,v) = 1, v>0$. Let $\phi(x)$ belonging to $\Z[x]$ be a monic polynomial which is irreducible…

We define a class of Separation Logic formulae, whose entailment problem: given formulae $\phi, \psi_1, \ldots, \psi_n$, is every model of $\phi$ a model of some $\psi_i$? is 2EXPTIME-complete. The formulae in this class are existentially…

Hitting formulas have been studied in many different contexts at least since [Iwama,89]. A hitting formula is a set of Boolean clauses such that any two of them cannot be simultaneously falsified. [Peitl,Szeider,05] conjectured that hitting…

We study rigidity questions for pairs of Lie algebras $(\mathfrak{g},\mathfrak{n})$ admitting a post-Lie algebra structure. We show that if $\mathfrak{g}$ is semisimple and $\mathfrak{n}$ is arbitrary, then we have rigidity in the sense…

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

Generalizing the notion of automatic complexity of individual strings due to Shallit and Wang, we define the automatic complexity $A(E)$ of an equivalence relation $E$ on a finite set $S$ of strings. We prove that the problem of determining…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

In this paper we study the operator inequality \phi(X)\leq X and the operator equation \phi(X)= X, where \phi is a w^*-continuous positive (resp. completely positive) linear map on B(H). We show that their solutions are in one-to-one…

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

We study Liouville-type theorem for polyharmonic H\'enon-Lane-Emden system $(-\Delta)^mu=|x|^av^p,\; (-\Delta)^mv=|x|^bu^q$ when $m,p,q\geq 1, pq\ne 1$, and $a,b\geq 0$. It is a natural conjecture that the nonexistence of positive solutions…

It is shown that if the sequence $(p_j(x))$ increases uniformly to $p(x)$ in a bounded, smooth domain $\Omega$, then the sequence $(u_i)$ of solutions to the Dirichlet problem for the $p_i(x)$-Laplacian with fixed boundary datum $\varphi$…

In this paper the existence of solutions, $(\lambda,u)$, of the problem $$-\Delta u=\lambda u -a(x)|u|^{p-1}u \quad \hbox{in }\Omega, \qquad u=0 \quad \hbox{on}\;\;\partial\Omega,$$ is explored for $0 < p < 1$. When $p>1$, it is known that…

It is establish regularity results for weak solutions of quasilinear elliptic problems driven by the well known $\Phi$-Laplacian operator given by \begin{equation*} \left\{\ \begin{array}{cl} \displaystyle-\Delta_\Phi u= g(x,u), &…

To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their…

An element $\phi$ of the outer automorphism group $\Out(\f)$ of the rank $n$ free group $F_n$ is {\it polynomially growing} if the word lengths of conjugacy classes in $\f$ grow at most polynomially under iteration by $\phi$. It is {\it…

We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and…

In 1971 Fedi\u{i} proved the remarkable theorem that the linear second order partial differential operator in the plane with coefficients 1 and f^2 is hypoelliptic provided that f is smooth, vanishes at the origin and is positive otherwise.…

Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…