Related papers: Detecting Isohedral Polyforms with a SAT Solver
We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…
Surfaces in i-Al68Pd23Mn9 as observed with STM and LEED experiments show atomic terraces in a Fibonacci spacing. We analyze them in a bulk tiling model due to Elser which incorporates many experimental data. The model has dodecahedral…
In this note a prediction of an algebraic mirror construction is checked for elliptic curves of Brieskorn-Pham type via number theoretic methods. It is shown that the modular forms associated to the Hasse-Weil L-series of mirror pairs of…
In this paper we study the existence of solutions to an isotropic differential inclusion.
The $\texttt{IntegerHull}$ function is part of Maple's $\texttt{PolyhedralSets}$ library, which calculates the integer hull of a given polyhedral set. This algorithm works by translating the supporting hyperplanes of the facets of the input…
The perfectly matched layer (PML) formulation is a prominent way of handling radiation problems in unbounded domain and has gained interest due to its simple implementation in finite element codes. However, its simplicity can be advanced…
We analyze the resolvent and define the scattering matrix for asymptotically hyperbolic manifolds with metrics which have a polyhomogeneous expansion near the boundary, and also prove that there is always an essential singularity of the…
We use composition of binary quadratic forms to systematically create pairs of Seifert surfaces that are non-isotopic in the four-ball. Our main topological result employs Gauss composition to classify the pairs of binary quadratic forms…
In two series of papers we construct quasi regular polyhedra and their duals which are similar to the Catalan solids. The group elements as well as the vertices of the polyhedra are represented in terms of quaternions. In the present paper…
In this paper, we consider $C^1$ cubic Powell-Sabin splines for the numerical solution of boundary value problems on planar and spatial surface domains. We first review the construction and basic properties of polynomial and rational $C^1$…
Equivalence between algebraic equations of motion may be detected by using a $p$-adic method, methods using factorization and linear algebra, or by systematic computer search of suitable Tschirnhausen transformations. Here, we show standard…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
Quadratic Poisson brackets on a vector space equipped with a bilinear multiplication are studied. A notion of a bracket compatible with the multiplication is introduced and an effective criterion of such compatibility is given. Among…
We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…
The scattering of scalar waves by a set of scatterers is considered. It is proven that the scattered field can be represented as an integral supported by any smooth surface enclosing the scatterers. This is a generalization of the series…
An infinite class of nonuniform antiplane shear fields is considered for a linear elastic isotropic space and (non-intersecting) isotoxal star-shaped polygonal voids and rigid inclusions perturbing these fields are solved. Through the use…
A tiling of a topological disc by topological discs is called monohedral if all tiles are congruent. Maltby (J. Combin. Theory Ser. A 66: 40-52, 1994) characterized the monohedral tilings of a square by three topological discs. Kurusa,…
We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…
In computational complexity theory, a decision problem is NP-complete when it is both in NP and NP-hard. Although a solution to a NP-complete can be verified quickly, there is no known algorithm to solve it in polynomial time. There exists…
In this article we discuss pointwise spectral rigidity results for several billiard systems (e.g., Birkhoff billiards, symplectic billiards and $4$-th billiards), showing that a single value of Mather's $\beta$-function can determine…