English
Related papers

Related papers: The Boolean SATisfiability Problem and the orthogo…

200 papers

Analytical solutions of variable coefficient nonlinear Schr\"odinger equations having four-dimensional symmetry groups which are in fact the next closest to the integrable ones occurring only when the Lie symmetry group is five-dimensional…

Exactly Solvable and Integrable Systems · Physics 2015-05-27 C. Özemir , F. Güngör

We define the two-dimensional $O(n)$ conformal field theory as a theory that includes the critical dilute and dense $O(n)$ models as special cases, and depends analytically on the central charge. For generic values of $n\in\mathbb{C}$, we…

High Energy Physics - Theory · Physics 2022-05-11 Linnea Grans-Samuelsson , Rongvoram Nivesvivat , Jesper Lykke Jacobsen , Sylvain Ribault , Hubert Saleur

Several N-body problems in ordinary (3-dimensional) space are introduced which are characterized by Newtonian equations of motion (``acceleration equal force;'' in most cases, the forces are velocity-dependent) and are amenable to exact…

Mathematical Physics · Physics 2015-06-26 Massimo Bruschi , Francesco Calogero

We establish conditions for nonexistence of global solutions for a class of quasilinear parabolic problems with a potential on complete, non-compact Riemannian manifolds, including the Porous Medium Equation and the p-Laplacian with a…

Analysis of PDEs · Mathematics 2025-11-21 Dorothea-Enrica von Criegern , Gabriele Grillo , Dario Monticelli

We study monotonicity testing of Boolean functions over the hypergrid $[n]^d$ and design a non-adaptive tester with $1$-sided error whose query complexity is $\tilde{O}(d^{5/6})\cdot \text{poly}(\log n,1/\epsilon)$. Previous to our work,…

Discrete Mathematics · Computer Science 2017-10-31 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri

Let group generators having finite-dimensional representation be realized as Hermitian linear differential operators without nhomogeneous terms as takes place, for example, for the SO(n) group. Then orresponding group Hamiltonians…

solv-int · Physics 2007-05-23 O. B. Zaslavskii

The poset cover problem seeks a minimum set of partial orders whose linear extensions cover a given set of linear orders. Recognizing its NP-completeness, we devised a non-trivial reduction to the Boolean satisfiability problem using a…

Logic in Computer Science · Computer Science 2025-05-08 Chih-Cheng Rex Yuan , Bow-Yaw Wang

Extending the thoroughly studied theory of group stability, we study Ulam stability type problems for associative and Lie algebras; namely, we investigate obstacles to rank-approximation of almost solutions by exact solutions for systems of…

Rings and Algebras · Mathematics 2025-07-11 Tomer Bauer , Guy Blachar , Be'eri Greenfeld

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

We show that under suitable assumptions, we have a one-to-one correspondence between classical groups and free quantum groups, in the compact orthogonal case. We classify the groups under correspondence, with the result that there are…

Quantum Algebra · Mathematics 2009-08-15 Teodor Banica , Roland Speicher

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

Computational Complexity · Computer Science 2018-01-31 Giacomo Patrizi

This paper addresses the computational problem of deciding invertibility (or one to one-ness) of a Boolean map $F$ in $n$-Boolean variables. This problem is a special case of deciding invertibilty of a map…

Symbolic Computation · Computer Science 2025-09-10 Virendra Sule

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…

We describe embeddings of $n$-dimensional Lorentzian manifolds, including Friedmann-Lema\^itre-Robertson-Walker spaces, in $\mathbb{R}^{n+2}$ such that the metrics of the submanifolds are inherited by a restriction from that of…

Mathematical Physics · Physics 2024-03-19 E. Huguet , J. Queva , J. Renaud

The Boolean Satisfiability Problem is perhaps one of the most well-known problems in theoretical computer science. On the one hand, it is proven to be NP-complete, which means that it is generally considered hard to solve. On the other…

Logic in Computer Science · Computer Science 2026-03-03 Flora Rädiker

This paper develops a construction of families of $ U(1)^{n-2} $-invariant special Lagrangian $ n $-folds in $ \mathbb{C}^{n} $, extending the analytic framework introduced by Joyce ($ n = 3 $) to arbitrary dimension. By reducing the…

Differential Geometry · Mathematics 2026-02-24 Mia S. L. Beard

In this paper, we present a novel algorithm to solve the Boolean Satisfiability (SAT) problem, using noise-based logic (NBL). Contrary to what the name may suggest, NBL is not a random/fuzzy logic system. In fact, it is a completely…

Computational Complexity · Computer Science 2011-10-05 Pey-Chang Kent Lin , Ayan Mandal , Sunil P Khatri

In this paper we apply decomposition to orbifolds with quantum symmetries to resolve anomalies. Briefly, it has been argued by e.g. Wang-Wen-Witten, Tachikawa that an anomalous orbifold can sometimes be resolved by enlarging the orbifold…

High Energy Physics - Theory · Physics 2021-11-30 D. Robbins , E. Sharpe , T. Vandermeulen

It is evident that the positions of 4 bodies in $d>2$ dimensional space can be identified with vertices of a tetrahedron. Square of volume of the tetrahedron, weighted sum of squared areas of four facets and weighted sum of squared edges…

Classical Physics · Physics 2023-03-07 A. M. Escobar-Ruiz , Alexander V Turbiner

Recently it has been proven that simple GP systems can efficiently evolve a conjunction of $n$ variables if they are equipped with the minimal required components. In this paper, we make a considerable step forward by analysing the…

Neural and Evolutionary Computing · Computer Science 2023-10-09 Benjamin Doerr , Andrei Lissovoi , Pietro S. Oliveto