Related papers: Generalized cofactors and decomposition of Boolean…
We build a solvability theory of elliptic boundary-value problems in normed Sobolev spaces of generalized smoothness for any integrability exponent $p>1$. The smoothness is given by a number parameter and a supplementary function parameter…
Partial differential equations are frequently solved using a global basis, such as the Fourier series, due to excellent convergence. However, convergence becomes impaired when discontinuities are present due to the Gibbs phenomenon,…
A boolean formula in a conjuctive normal form is called a (k,s)-formula if every clause contains exactly k variables and every variable occurs in at most s clauses. We prove the existence of a (k, 4 * (2^k/k))-CNF formula which is…
The Bessel-Neumann expansion (of integer order) of a function $g:\mathbb{C}\rightarrow\mathbb{C}$ corresponds to representing $g$ as a linear combination of basis functions $\phi_0,\phi_1,\ldots$, i.e., $g(z)=\sum_{\ell = 0}^\infty w_\ell…
We construct a generalization of the Dolbeault-Grothendieck resolution on a singular complex space. The same construction yields, for each morphism of analytic spaces, a pullback mapping between the respective Dolbeault-Grothendieck…
We generalize many results concerning the tractability of SAT and #SAT on bounded treewidth CNF-formula in the context of Quantified Boolean Formulas (QBF). To this end, we start by studying the notion of width for OBDD and observe that the…
This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…
Bottom-up knowledge compilation is a paradigm for generating representations of functions by iteratively conjoining constraints using a so-called apply function. When the input is not efficiently compilable into a language - generally a…
This paper is devoted to strictly hyperbolic systems and equations with non-smooth coefficients. Below a certain level of smoothness, distributional solutions may fail to exist. We construct generalised solutions in the Colombeau algebra of…
Boolean Satisfiability Problem (SAT) is one of the core problems in computer science. As one of the fundamental NP-complete problems, it can be used - by known reductions - to represent instances of variety of hard decision problems.…
Normalizing flows leverage the Change of Variables Formula (CVF) to define flexible density models. Yet, the requirement of smooth transformations (diffeomorphisms) in the CVF poses a significant challenge in the construction of these…
In this paper we study the problem of computing wavelet coefficients of compactly supported functions from their Fourier samples. For this, we use the recently introduced framework of generalized sampling. Our first result demonstrates that…
Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some application areas such as circuit verification, bounded model…
In the article \The State of SAT", the authors asked whether a procedure dramatically different from DPLL can be found for handling unsatisfiable instances. This study proposes a new linear programming approach to address this issue…
We study the symmetry resolution of the entanglement entropy of an interval in two-dimensional conformal field theories (CFTs), by relating the bipartition to the geometry of an annulus with conformal boundary conditions. In the presence of…
We explore the relations between the Boolean Satisfiability Problem with $n$ Boolean variables and the orthogonal group $\mbox{O}(n)$. We show that all $2^n$ possible solutions induce involutions of $\mathbb{R}^n$ that lie in the compact,…
We analyze a system of linear algebraic equations whose solutions lead to a proof of a generalization of Boole's formula. In particular, our approach provides an elementary and short alternative to Katsuura's proof of this generalization.
We consider the set of partition functions that result from the insertion of twist operators compatible with conformal invariance in a given 2D Conformal Field Theory (CFT). A consistency equation, which gives a classification of twists, is…
Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…
The recently suggested bipartite analysis extends the Kauffman planar decomposition to arbitrary $N$, i.e. extends it from the Jones polynomial to the HOMFLY polynomial. This provides a generic and straightforward non-perturbative calculus…