Related papers: Implicit Resolution

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

We improve on Jarn\'{\i}k's inequality between uniform Diophantine exponent $\alpha $ and ordinary Diophantine exponent $\beta$ for a system of $ n\ge 2$ real linear forms in two integer variables. Jarn\'{\i}k (1949, 1954) proved that…

Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

In this addendum to [4], we provide a pair of counterexamples relevant to the theory of implicit operations. More precisely, we exhibit a pp expansion of a variety that fails to be a variety (although it is a quasivariety). Furthermore, we…

We study the irreducibility of 6-dimensional strictly compatible systems of Q with distinct Hodge-Tate weights. We prove that if one of the representations $\rho$ in such a system is irreducible and satisfies a self-dual condition…

Let $\left( \Delta; \Omega , \leq \right)$ be a b-homological system and $\widetilde{\cal F} \left( \Delta \right)$ the category of the extended $\Delta -$filtered modules. Here there is a proof that $\widetilde{\cal F} \left( \Delta…

Right-linear (or left-linear) grammars are a well-known class of context-free grammars computing just the regular languages. They may naturally be written as expressions with (least) fixed points but with products restricted to letters as…

Let $f:[0,+\infty) \to \mathbb{R}$ be a (locally) Lipschitz function and $\Omega \subset \mathbb{R}^2$ a $C^{1,\alpha}$ domain whose boundary is unbounded and connected. If there exists a positive bounded solution to the overdetermined…

Let $\alpha$ be an algebraic number of degree $d\ge 3$ having at most one real conjugate and let $K$ be the algebraic number field ${\mathbf Q}(\alpha)$. For any unit $\epsilon$ of $K$ such that ${\mathbf Q}(\alpha\epsilon)=K$, we consider…

We study the *refuter* problems for proof complexity lower bounds. Suppose $\varphi$ is a hard tautology that does not admit any length-$s$ proof in some proof system $P$. In the corresponding refuter problem, we are given (query access to)…

We study a weakly coupled supercritical elliptic system of the form \begin{equation*} \begin{cases} -\Delta u = |x_2|^\gamma \left(\mu_{1}|u|^{p-2}u+\lambda\alpha |u|^{\alpha-2}|v|^{\beta}u \right) & \text{in }\Omega,\\ -\Delta v =…

A semi-implicit-explicit (semi-IMEX) Runge-Kutta (RK) method is proposed for the numerical integration of ordinary differential equations (ODEs) of the form $\mathbf{u}' = \mathbf{f}(t,\mathbf{u}) + G(t,\mathbf{u}) \mathbf{u}$, where…

We propose a better method to determine the stability region of an L-stable implicit-explicit Runge-Kutta scheme. This method always provides the correct result, while other methods sometimes give wrong result. It is useful in the analysis…

It is well-known (cf. K.-Pudl\'ak 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $\tau_k$ of size…

A prominent challenge for modern language understanding systems is the ability to answer implicit reasoning questions, where the required reasoning steps for answering the question are not mentioned in the text explicitly. In this work, we…

Proofs in propositional logic are typically presented as trees of derived formulas or, alternatively, as directed acyclic graphs of derived formulas. This distinction between tree-like vs. dag-like structure is particularly relevant when…

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

A propositional proof system $P$ has the strong feasible disjunction property iff there is a constant $c \geq 1$ such that whenever $P$ admits a size $s$ proof of $\bigvee_i \alpha_i$ with no two $\alpha_i$ sharing an atom then one of…

Let $\Gamma\subset \overline{\mathbb Q}^{\times}$ be a finitely generated multiplicative group of algebraic numbers. Let $\delta, \beta\in\overline{\mathbb Q}^\times$ be algebraic numbers with $\beta$ irrational. In this paper, we prove…