Related papers: An optimal algorithm to generate tilings
MacMahon's classical theorem on the number of boxed plane partitions has been generalized in several directions. One way to generalize the theorem is to view boxed plane partitions as lozenge tilings of a hexagonal region and then…
The Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree orders, and those among the chains that exhibit a simple greedy…
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular algorithms, and a parallel algorithm. We show that these…
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…
We consider a subclass of tilings, the tilings obtained by cut and projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponent \alpha in terms of the ranks of…
We introduce the notion of the second lattice width of a lattice polytope and use this to classify lattice triangles by their width and second width. This is equivalent to classifying lattice triangles contained in a given rectangle (and no…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
We discuss an algorithm for the approximate solution of Schrodinger's equation for lattice gauge theory, using lattice SU(3) as an example. A basis is generated by repeatedly applying an effective Hamiltonian to a ``starting state.'' The…
The possibility of creating different geometries with the help of an extra synthetic dimension in optical lattices is studied. Additional linear potential and Raman assisted tunnelings are used to engineer well controlled tunnelings between…
Folding a sequence $S$ into a multidimensional box is a well-known method which is used as a multidimensional coding technique. The operation of folding is generalized in a way that the sequence $S$ can be folded into various shapes and not…
Lattice reduction is a combinatorial optimization problem aimed at finding the most orthogonal basis in a given lattice. The Lenstra-Lenstra-Lov\'asz (LLL) algorithm is the best algorithm in the literature for solving this problem. In light…
Density based spatial clustering of points in $\mathbb{R}^n$ has a myriad of applications in a variety of industries. We generalise this problem to the density based clustering of lines in high-dimensional spaces, keeping in mind there…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or…
We describe how the usual supercharges of extended supersymmetry may be {\it twisted} to produce a BRST-like supercharge $Q$. The usual supersymmetry algebra is then replaced by a twisted algebra and the action of the twisted theory is…
Lattice-free gradient polyhedra can be used to certify optimality for mixed-integer convex minimization models. We consider how to construct these polyhedra for unconstrained models with two integer variables under the assumption that all…
The current computer architecture has moved towards the multi/many-core structure. However, the algorithms in the current sequential dense numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multi/many-core…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
Several old and recent classes of picture grammars, that variously extend context-free string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such grammars can be unified and extended using a tiling based…
Motivated by lattice mixture identification and grain boundary detection, we present a framework for lattice pattern representation and comparison, and propose an efficient algorithm for lattice separation. We define new scale and shape…