Related papers: Detecting Isohedral Polyforms with a SAT Solver
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
The Taylor-Socolar tilings are regular hexagonal tilings of the plane but are distinguished in being comprised of hexagons of two colors in an aperiodic way. We place the Taylor-Socolar tilings into an algebraic setting which allows one to…
There is a well-known problem about isospectrality of Riemannian manifolds: whether isospectral manifolds are isometric. In this work we give an answer to this problem for 3-dimensional compact flat manifolds.
This paper studies the problem of testing whether a system of linear equality and inequality constraints admits a solution when the coefficients of that system may have to be estimated. We show that a wide range of inferential questions in…
Since the thesis of K. Reinhardt in 1918, it is well known that there are exactly three types of convex hexagons that can tile the plane. However, the proof of the fact is far from being complete. We prove this fact, under an assumption…
We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…
In this paper, we classify solvable Lie algebras of dimensions $\leq 8$ endowed with a nondegenerate invariant symmetric bilinear form over an algebraically closed field. This classification (up to isometrically isomorphisms) is mainly…
We propose a calculus of string diagrams to reason about satisfiability of Boolean formulas, and prove it to be sound and complete. We then showcase our calculus in a few case studies. First, we consider SAT-solving. Second, we consider…
The knowledge of the isotropic correlation function of a plane figure is useful to determine the correlation function of the cylinders having the plane figure as right-section and a given height as well as to analyze the out of plane…
All solutions SAT (AllSAT for short) is a variant of propositional satisfiability problem. Despite its significance, AllSAT has been relatively unexplored compared to other variants. We thus survey and discuss major techniques of AllSAT…
This work explores the potential of spatial model checking of polyhedral models on a number of selected examples. In computer graphics polyhedral models can be found in the form of triangular surface meshes of tetrahedral volume meshes…
In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT solving algorithm is considered. Based on the well-known…
We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…
In this paper, we give a proof that it is undecidable whether a set of five polyominoes can tile the plane by translation. The proof involves a new method of labeling the edges of polyominoes, making it possible to assign whether two edges…
This paper announces the discovery of an isoperimetric inequality for the area of plane regions defined by binary forms. This result has been applied subsequently in the enumeration of solutions to the Thue inequality and, given its…
Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline…
We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…
For any positive integer $r$, we construct a smooth complex projective rational surface which has at least $r$ real forms not isomorphic over $\mathbb{R}$.
With ab initio codes that employ three-dimensional periodic boundary conditions, the slab-and-vacuum model has proven invaluable for the derivation of energetic, atomistic, and electronic properties of materials. Within this approach, polar…
This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…