English
Related papers

Related papers: Generalized cofactors and decomposition of Boolean…

200 papers

The article is devoted to the investigation of smoothness of functions $f(x_1,...,x_m)$ of variables $x_1,...,x_m$ in infinite fields with non-trivial multiplicative ultra-norms, where $m\ge 2$. Theorems about classes of smoothness $C^n$ or…

Classical Analysis and ODEs · Mathematics 2007-05-23 S. V. Ludkovsky

In a recent paper (arXiv:1501.06164) the author has introduced a new theory of generalised solutions which applies to fully nonlinear PDE systems of any order and allows the interpretation of merely measurable maps as solutions. This…

Analysis of PDEs · Mathematics 2015-08-25 Nikos Katzourakis

We study the non-canonical method for solving the Satisfiability problem which given by a formula in the form of the conjunctive normal form. The essence of this method consists in counting the number of tuples of Boolean variables, on…

Data Structures and Algorithms · Computer Science 2016-03-03 Anatoly D. Plotnikov

We show that generalized spherical harmonics are well suited for representing the space and orientation molecular density in the resolution of the molecular density functional theory. We consider the common system made of a rigid solute of…

Chemical Physics · Physics 2017-10-11 Lu Ding , Maximilien Levesque , Daniel Borgis , Luc Belloni

Let $L$ be a second-order elliptic operator with analytic coefficients defined in $B_1\subseteq\mathbb R^n$. We construct explicitly and canonically a fundamental solution for the operator, i.e., a function $u:B_{r_0}\to\mathbb R$ such that…

Analysis of PDEs · Mathematics 2024-05-02 Federico Franceschini , Federico Glaudo

In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra

Generalized equations are problems emerging in contexts of modern variational analysis as an adequate formalism to treat such issues as constraint systems, optimality and equilibrium conditions, variational inequalities, differential…

Optimization and Control · Mathematics 2018-12-06 A Uderzo

Let $ \mathcal{B}:=\{f(z)=\sum_{n=0}^{\infty}a_nz^n\; \mbox{with}\; |f(z)|<1\;\mbox{for all}\; z\in\mathbb{D}\} $. The improved version of the classical Bohr's inequality \cite{Bohr-1914} states that if $ f\in\mathcal{B} $, then the…

Complex Variables · Mathematics 2023-08-28 Molla Basir Ahamed

In this note, we propose an original extended formulation of Euler-Korteweg systems based on a generalization of the quantum Bohm potential identity. This new formulation allows to propose a useful construction of a numerical scheme with…

Numerical Analysis · Mathematics 2015-03-31 Didier Bresch , Frédéric Couderc , Pascal Noble , Jean-Paul Vila

Local superlinear convergence of the semismooth Newton method usually necessitates assumptions on the uniform invertibility of the utilized, generalized Jacobian matrices, such as, e.g., BD- or CD-regularity. For certain composite-type…

Optimization and Control · Mathematics 2025-12-02 Wenqing Ouyang , Andre Milzarek

Recently the author presented a new approach to solving the coefficient problems for various classes of holomorphic functions $f(z) = \sum\limits_0^\infty c_n z^n$, not necessarily univalent. This approach is based on lifting the given…

Complex Variables · Mathematics 2025-04-03 Samuel L. Krushkal

Let $C$ be a compact convex subset of $\mathbb{R}^n$, $f:C\to\mathbb{R}$ be a convex function, and $m\in\{1, 2, ..., \infty\}$. Assume that, along with $f$, we are given a family of polynomials satisfying Whitney's extension condition for…

Classical Analysis and ODEs · Mathematics 2019-03-05 Daniel Azagra , Carlos Mudarra

We aim at providing a foundation of a theory of "good" SAT representations F of boolean functions f. We argue that the hierarchy UC_k of unit-refutation complete clause-sets of level k, introduced by the authors, provides the most basic…

Artificial Intelligence · Computer Science 2013-05-13 Matthew Gwynne , Oliver Kullmann

The aim of this short note is mainly pedagogical. It summarizes some knowledge about Boolean satisfiability (SAT) and the P=NP? problem in an elementary mathematical language. A convenient scheme to visualize and manipulate CNF formulae is…

Computational Complexity · Computer Science 2014-08-15 Bernd R. Schuh

We extend the classical deconvolution framework in Rn to the case with a pseudodifferential-like solution operator with a symbol depending on both the base and cotangent variable. Our framework enables deconvolution with spatially varying…

Spectral Theory · Mathematics 2025-12-30 Mirza Karamehmedović , Pierre Maréchal , Martin Sæbye Carøe , Lara Baalbaki

Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…

Probability · Mathematics 2023-08-09 Christa Cuchiero , Tonio Möllmann , Josef Teichmann

In this paper, we study generalized Schauder theory for the degenerate/singular parabolic equations of the form $$u_t = a^{i'j'}u_{i'j'} + 2 x_n^{\gamma/2} a^{i'n} u_{i'n} + x_n^{\gamma} a^{nn} u_{nn} + b^{i'} u_{i'} + x_n^{\gamma/2} b^n…

Analysis of PDEs · Mathematics 2023-04-19 Takwon Kim , Ki-Ahm Lee , Hyungsung Yun

The CNF formula satisfiability problem (CNF-SAT) has been reduced to many fundamental problems in P to prove tight lower bounds under the Strong Exponential Time Hypothesis (SETH). Recently, the works of Abboud, Hansen, Vassilevska W. and…

Computational Complexity · Computer Science 2020-08-31 Daniel Gibney , Gary Hoppenworth , Sharma V. Thankachan

Boolean functional synthesis is a fundamental problem in computer science with wide-ranging applications and has witnessed a surge of interest resulting in progressively improved techniques over the past decade. Despite intense algorithmic…

Artificial Intelligence · Computer Science 2020-05-15 Priyanka Golia , Subhajit Roy , Kuldeep S. Meel

We study the dynamical behaviors of degenerate stochastic differential equations (SDEs). We select an auxiliary Fisher information functional as the Lyapunov functional. Using generalized Fisher information, we conduct the Lyapunov…

Differential Geometry · Mathematics 2023-05-15 Qi Feng , Wuchen Li