Testing satisfiability of CNF formulas by computing a stable set of points

2004 ◽  
Vol 43 (1-4) ◽  
pp. 65-89 ◽  
Author(s):  
Eugene Goldberg
2009 ◽  
Vol 2009 ◽  
pp. 1-18 ◽  
Author(s):  
K. Subramani

This paper is concerned with the computational complexities of three types of queries, namely, satisfiability, equivalence, and hull inclusion. The first two queries are analyzed over the domain of CNF formulas, while hull inclusion queries are analyzed over continuous and discrete sets defined by rational polyhedra. Although CNF formulas can be represented by polyhedra over discrete sets, we analyze them separately on account of their distinct structure. In particular, we consider the NAESAT and XSAT versions of satisfiability over HornCNF, 2CNF, and Horn⊕2CNF formulas. These restricted families find applications in a number of practical domains. From the hull inclusion perspective, we are primarily concerned with the question of checking whether two succinct descriptions of a set of points are equivalent. In particular, we analyze the complexities of integer hull inclusion over 2SAT and Horn polyhedra. Hull inclusion problems are important from the perspective of deriving minimal descriptions of point sets. One of the surprising consequences of our work is the stark difference in complexities between equivalence problems in the clausal and polyhedral domains for the same polyhedral structure.


Author(s):  
Richard Mcintosh ◽  
David Mastronarde ◽  
Kent McDonald ◽  
Rubai Ding

Microtubules (MTs) are cytoplasmic polymers whose dynamics have an influence on cell shape and motility. MTs influence cell behavior both through their growth and disassembly and through the binding of enzymes to their surfaces. In either case, the positions of the MTs change over time as cells grow and develop. We are working on methods to determine where MTs are at different times during either the cell cycle or a morphogenetic event, using thin and thick sections for electron microscopy and computer graphics to model MT distributions.One approach is to track MTs through serial thin sections cut transverse to the MT axis. This work uses a video camera to digitize electron micrographs of cross sections through a MT system and create image files in computer memory. These are aligned and corrected for relative distortions by using the positions of 8 - 10 MTs on adjacent sections to define a general linear transformation that will align and warp adjacent images to an optimum fit. Two hundred MT images are then used to calculate an “average MT”, and this is cross-correlated with each micrograph in the serial set to locate points likely to correspond to MT centers. This set of points is refined through a discriminate analysis that explores each cross correlogram in the neighborhood of every point with a high correlation score.


Author(s):  
Yuzhu Wang ◽  
Akihiro Tanaka ◽  
Akiko Yoshise

AbstractWe develop techniques to construct a series of sparse polyhedral approximations of the semidefinite cone. Motivated by the semidefinite (SD) bases proposed by Tanaka and Yoshise (Ann Oper Res 265:155–182, 2018), we propose a simple expansion of SD bases so as to keep the sparsity of the matrices composing it. We prove that the polyhedral approximation using our expanded SD bases contains the set of all diagonally dominant matrices and is contained in the set of all scaled diagonally dominant matrices. We also prove that the set of all scaled diagonally dominant matrices can be expressed using an infinite number of expanded SD bases. We use our approximations as the initial approximation in cutting plane methods for solving a semidefinite relaxation of the maximum stable set problem. It is found that the proposed methods with expanded SD bases are significantly more efficient than methods using other existing approximations or solving semidefinite relaxation problems directly.


1945 ◽  
Vol 35 ◽  
pp. 10-13 ◽  
Author(s):  
W. L. Edge

The pencil of quartic curveswhere x, y, z are homogeneous coordinates in a plane, was encountered by Ciani [Palermo Rendiconli, Vol. 13, 1899] in his search for plane quartic curves that were invariant under harmonic inversions. If x, y, z undergo any permutation the ternary quartic form on the left of (1) is not altered; nor is it altered if any, or all, of x, y, z be multiplied by −1. There thus arises an octahedral group G of ternary collineations for which every curve of the pencil is invariant.Since (1) may also be writtenthe four linesare, as Ciani pointed out, bitangents, at their intersections with the conic C whose equation is x2 + y2 + z2 = 0, to every quartic of the pencil. The 16 base points of the pencil are thus all accounted for—they consist of these eight contacts counted twice—and this set of points must of course be invariant under G. Indeed the 4! collineations of G are precisely those which give rise to the different permutations of the four lines (2), a collineation in a plane being determined when any four non-concurrent lines and the four lines which are to correspond to them are given. The quadrilateral formed by the lines (2) will be called q.


2020 ◽  
pp. 1-26
Author(s):  
SNIR BEN OVADIA

Abstract The papers [O. M. Sarig. Symbolic dynamics for surface diffeomorphisms with positive entropy. J. Amer. Math. Soc.26(2) (2013), 341–426] and [S. Ben Ovadia. Symbolic dynamics for non-uniformly hyperbolic diffeomorphisms of compact smooth manifolds. J. Mod. Dyn.13 (2018), 43–113] constructed symbolic dynamics for the restriction of $C^r$ diffeomorphisms to a set $M'$ with full measure for all sufficiently hyperbolic ergodic invariant probability measures, but the set $M'$ was not identified there. We improve the construction in a way that enables $M'$ to be identified explicitly. One application is the coding of infinite conservative measures on the homoclinic classes of Rodriguez-Hertz et al. [Uniqueness of SRB measures for transitive diffeomorphisms on surfaces. Comm. Math. Phys.306(1) (2011), 35–49].


Sign in / Sign up

Export Citation Format

Share Document