Related papers: The interpolant existence problem for weak K4 and …
Description logics (DL) are a family of formal languages for representing and reasoning about structured knowledge in terms of concepts and their relationships. A central reasoning problem in DL is concept subsumption. Although this problem…
We prove existence of a bounded weak solution to a degenerate quasilinear subdiffusion problem with bounded measurable coefficients that may explicitly depend on time. The kernel in the involved integro-differential operator w.r.t. time…
In this paper, we study the problem of decomposability of bilinear spaces of dimension four without symmetry, as well as the problem of decomposability of split central simple algebras of degree four with an anti-automorphism. In…
We consider the Dirichlet problem in a wedge for parabolic equation whose coefficients are measurable function of t. We obtain coercive estimates in weighted $L_{p,q}$-spaces. The concept of "critical exponent" introduced in the paper plays…
We study the $T$-periodic solutions of the real Riccati differential equation $x' = x^2 + \gamma(t),$ where $x=x(t)$ and $\gamma$ is a $T$-periodic function. Our goal is to define a real-valued discriminant $\Delta_{\gamma}$ that determines…
We study the computational complexity of model checking and satisfiability problems of polyadic modal logics extended with permutations and Boolean operators on accessibility relations. First, we show that the combined complexity of the…
We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the…
We prove the existence of at least three weak solutions for the fourth-order problem with indefinite weight involving the Leray-Lions operator with nonstandard growth conditions. The proof of our main result uses variational methods and the…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
This article deals with the study of the following Kirchhoff equation with exponential nonlinearity of Choquard type (see $(KC)$ below). We use the variational method in the light of Moser-Trudinger inequality to show the existence of weak…
There are exactly two maximal schematic extensions of the relevant logic R with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known…
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite…
An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the bound is higher. For instance, 3-colorability of graphs with…
We consider the problem of recovering (that is, interpolating) and identity testing of a "hidden" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\in{\mathbb F_q}$ (extension fields access is not permitted). The naive…
We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…
Link/knot invariants are series with integer coefficients, and it is a long-standing problem to get them positive and possessing cohomological interpretation. Constructing positive "superpolynomials" is not straightforward, especially for…
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…
Electrical Impedance Imaging would suffer a serious obstruction if for two different conductivities the potential and current measured at the boundary were the same. The Calder\'on's problem is to decide whether the conductivity is indeed…
Proving for triangulations an extended version of the 4-colour theorem by induction, we manage to exclude the case which led to the failure of Kempe's attempted proof. The new idea is to claim the existence of a "nice" 4-colouring, in which…