English
Related papers

Related papers: The Boolean SATisfiability Problem and the orthogo…

200 papers

We give a lower bound to the dimension of a contractible manifold on which a given group can act properly discontinuously. In particular, we show that the $n$-fold product of nonabelian free groups cannot act properly discontinuously on…

Geometric Topology · Mathematics 2007-05-23 Mladen Bestvina , Michael Kapovich , Bruce Kleiner

The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for…

Computational Complexity · Computer Science 2020-10-23 Paweł Idziak , Piotr Kawałek , Jacek Krzaczkowski , Armin Weiß

We establish a lower bound of $2^n$ conditional branches for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a…

Computational Complexity · Computer Science 2014-06-25 Samuel C. Hsieh

We consider the Stochastic Boolean Function Evaluation (SBFE) problem where the task is to efficiently evaluate a known Boolean function $f$ on an unknown bit string $x$ of length $n$. We determine $f(x)$ by sequentially testing the…

Data Structures and Algorithms · Computer Science 2022-08-09 Lisa Hellerstein , Devorah Kletenik , Naifeng Liu , R. Teal Witter

In the Painleve analysis of nonintegrable partial differential equations one obtains differential constraints describing the movable singularity manifold. We show, for a class of n-dimensional wave equations, that these constraints have a…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Norbert Euler , Ove Lindblom

For every $n >0$, we show the existence of a CNF tautology over $O(n^2)$ variables of width $O(\log n)$ such that it has a Polynomial Calculus Resolution refutation over $\{0,1\}$ variables of size $O(n^3polylog(n))$ but any Polynomial…

Computational Complexity · Computer Science 2024-07-02 Sasank Mouli

We discuss issues related to orientifolds and the brane realization for gauge theories with orthogonal and symplectic groups. We specifically discuss the case of theories with (hidden) global SO(2n) symmetry, from three to six dimensions.…

High Energy Physics - Theory · Physics 2009-10-31 Amihay Hanany , Alberto Zaffaroni

Motivated by an eigenvalue-eigenfunction problem posed in IR^n x {\Omega}, where {\Omega} is a probability space, we are concerned in this paper with the Sobolev space on groups. Hence it is established an equivalence between locally…

Analysis of PDEs · Mathematics 2022-06-07 Vernny Ccajma , Wladimir Neves , Jean Silva

In this article, we construct a generating set of rational invariants for the action of the orthogonal group $\text{O}(n)$ on the space $\mathbb{R}[x_1,\dots,x_n]_{2d}$ of real homogeneous polynomials of even degree $2d$. This generalizes a…

Commutative Algebra · Mathematics 2025-03-06 Henri Breloer

The boolean satisfiability (SAT) problem asks whether there exists an assignment of boolean values to the variables of an arbitrary boolean formula making the formula evaluate to True. It is well-known that all NP-problems can be coded as…

Machine Learning · Computer Science 2024-10-22 Christopher R. Serrano , Jonathan Gallagher , Kenji Yamada , Alexei Kopylov , Michael A. Warren

We study two-parameter oscillator variations of the classical theorem on harmonic polynomials, associated with noncanonical oscillator representations of sl(n) and o(n). We find the condition when the homogeneous solution spaces of the…

Representation Theory · Mathematics 2010-12-15 Cuiling Luo , Xiaoping Xu

The Boolean satisfiability problem (SAT) is a well-known example of monotonic reasoning, of intense practical interest due to fast solvers, complemented by rigorous fine-grained complexity results. However, for non-monotonic reasoning,…

Computational Complexity · Computer Science 2025-05-16 Victor Lagerkvist , Mohamed Maizia , Johannes Schmidt

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

Group Theory · Mathematics 2020-03-25 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

The general aim of this paper is to study which are the solvable Lie groups admitting an Einstein left invariant metric. The space N of all nilpotent Lie brackets on R^n parametrizes a set of (n+1)-dimensional rank-one solvmanifolds,…

Differential Geometry · Mathematics 2010-07-23 Jorge Lauret , Cynthia Will

We begin by discussing various ways autoequivalences and stability conditions associated to triangulated categories can interact. Once an appropriate definition of compatibility is formulated, we derive a sufficiency criterion for this…

Algebraic Geometry · Mathematics 2012-07-10 Parker E. Lowrey

We show that the word problem for any 3-manifold group is solvable in time $O(n\log^3 n)$. Our main contribution is the proof that the word problem for admissible graphs of groups, in the sense of Croke and Kleiner, is solvable in $O(n\log…

Group Theory · Mathematics 2026-01-16 Alessandro Sisto , Stefanie Zbinden

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…

Computational Complexity · Computer Science 2018-08-20 Chengling Fang , Jiang Liu

Results are obtained on extending flat vector bundles or equivalently general representations from the fundamental group of S, a connected subsurface of the connected boundary of a compact, connected, oriented 3-dimensional manifold, to the…

Geometric Topology · Mathematics 2014-05-23 Sylvain E. Cappell , Edward Y. Miller

The well known Boole-Shannon expansion of Boolean functions in several variables (with co-efficients in a Boolean algebra $B$) is also known in more general form in terms of expansion in a set $\Phi$ of orthonormal functions. However,…

Computational Complexity · Computer Science 2013-12-06 Virendra Sule

This paper is dedicated to proving the complete integrability of the Benjamin--Ono (BO) equation on the line when restricted to every $N$-soliton manifold, denoted by $\mathcal{U}_N$. We construct generalized action--angle coordinates which…

Analysis of PDEs · Mathematics 2021-04-14 Ruoci Sun