Related papers: Recurrence solution of monomer-polymer models on t…
We consider tiles (dimers) each of which covers two vertices of a rectangular lattice. There is a normalized translation invariant weighting on the shape of the tiles. We study the pressure, p, or entropy, (one over the volume times the…
The tiling problem has been a famous problem that has appeared in many Mathematics problems. Many of its solutions are rooted in high-level Mathematics. Thus we hope to tackle this problem using more elementary Mathematics concepts. In this…
We apply the computational methodology of phase retrieval to the problem of folding heteropolymers. The ground state fold of the polymer is defined by the intersection of two sets in the configuration space of its constituent monomers: a…
Conformations of a crowded neutral semiflexible polymer under confinement near an attractive wall are studied via coarse-grained simulations. We study the effects of the interplay of the length of the polymer, bending rigidity, and the…
The field theory approach to the statistical mechanics of a system of N polymer rings linked together is generalized to the case of links that have a fixed number $2s$ of maxima and minima. Such kind of links are called plats and appear for…
The problem of enumerating dimers on an M x N net embedded on non-orientable surfaces is considered. We solve both the Moebius strip and Klein bottle problems for all M and N with the aid of imaginary dimer weights. The use of imaginary…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…
The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming…
Ladder polymers, known for their rigid, ladder-like structures, exhibit exceptional thermal stability and mechanical strength, positioning them as candidates for advanced applications. However, accurately determining their structure from…
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
We consider the recently introduced monochromatic reverse top-k queries which ask for, given a new tuple q and a dataset D, all possible top-k queries on D union {q} for which q is in the result. Towards this problem, we focus on designing…
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that these problems are complete for subclasses of the counting…
In [BNRR], it was shown that tiling of general regions with two rectangles is NP-complete, except for a few trivial special cases. In a different direction, R\'emila showed that for simply connected regions by two rectangles, the…
We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…
We give a method to determine an explicit solution to a system of two inhomogeneous linear recursive sequences of higher order. Our approach can be used efficiently in solving certain combinatorial problems. We finish the paper by…
A dimer model is a quiver with faces embedded in a surface. We define and investigate notions of consistency for dimer models on general surfaces with boundary which restrict to well-studied consistency conditions in the disk and torus…
We introduce a new model of random layered media, extending the Matheron-de Marsily model: Here we allow for the flows to change in time. For such layered structures, we solve exactly the equations of motion for single particles, and also…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…