Related papers: Partial decidability protocol for the Wang tiling …
We show how the problem of estimating conditional Kendall's tau can be rewritten as a classification task. Conditional Kendall's tau is a conditional dependence parameter that is a characteristic of a given pair of random variables. The…
We present a new algorithm, Fractional Decomposition Tree (FDT) for finding a feasible solution for an integer program (IP) where all variables are binary. FDT runs in polynomial time and is guaranteed to find a feasible integer solution…
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to…
The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…
We consider a two-dimensional lattice model of equilibrium statistical mechanics, using nearest neighbor interactions based on the matching conditions for an aperiodic set of 16 Wang tiles. This model has uncountably many ground state…
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of opportunity. Rather than finding a decision tree minimizing…
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches enabled near-linear scaling in the condition…
Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…
The problem of a massive elastic string depinning from a linear defect under the action of a small driving force is considered. To exponential accuracy the decay rate is calculated with the help of the instanton method; then, fluctuations…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
This paper presents a canonical duality approach for solving a general topology optimization problem of nonlinear elastic structures. By using finite element method, this most challenging problem can be formulated as a mixed integer…
We propose a nonperturbative approach to nonabelian two-form gauge theory. We formulate the theory on a lattice in terms of plaquette as fundamental dynamical variable, and assign U(N) Chan-Paton colors at each boundary link. We show that,…
Three-dimensional icosahedral random tilings are studied in the semi-entropic model. We introduce a global energy measure defined by the variance of the quasilattice points in orthogonal space. The specific heat shows a pronounced Schottky…
We explain the relation between certain random tiling models and interacting particle systems belonging to the anisotropic KPZ (Kardar-Parisi-Zhang) universality class in 2+1-dimensions. The link between these two \emph{a priori} disjoint…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…
Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into an underlying hardware or logical fabric. An essential step is embedding problem-specific information into the quantum logical fabric. We present…
The periodic tiling conjecture (PTC) asserts, for a finitely generated Abelian group $G$ and a finite subset $F$ of $G$, that if there is a set $A$ that solves the tiling equation $\mathbb{1}_F * \mathbb{1}_A = 1$, there is also a periodic…
When a system deviates from equilibrium, it is possible to manipulate and control it to drive it towards equilibrium within a finite time $t_f$, even reducing its natural relaxation time scale $\tau_{relax}$. Although numerous theoretical…
We formulate and prove a variational principle (in the sense of thermodynamics) for random domino tilings, or equivalently for the dimer model on a square grid. This principle states that a typical tiling of an arbitrary finite region can…