Related papers: Universal Computation with Arbitrary Polyomino Til…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at…
Strand displacement and tile assembly systems are designed to follow prescribed kinetic rules (i.e., exhibit a specific time-evolution). However, the expected behavior in the limit of infinite time--known as thermodynamic equilibrium--is…
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree exhibited a self-assembly that tiles the first quadrant of the…
Additive Manufacturing (AM) is a manufacturing paradigm that builds three-dimensional objects from a computer-aided design model by successively adding material layer by layer. AM has become very popular in the past decade due to its…
While transformer models have been highly successful, they are computationally inefficient. We observe that for each layer, the full width of the layer may be needed only for a small subset of tokens inside a batch and that the "effective"…
An enumerative invariant theory in Algebraic Geometry, Differential Geometry, or Representation Theory, is the study of invariants which 'count' $\tau$-(semi)stable objects $E$ with fixed topological invariants $[E]=\alpha$ in some…
We study the structure of the digit sets ${\mathcal D}$ for the integral self-similar tiles $T(b,{\mathcal{D}})$ (we call such ${\mathcal D}$ a {\it tile digit set} with respect to $b$). So far the only available classes of such tile digit…
Let $ \CO $ be the ring of integers of a non-Archimedean local field and $ \pi $ a fixed uniformizer of $ \CO $. We establish three main results. The first one states that the exterior powers of a $ \pi $-divisible $ \CO $-module scheme of…
This paper is about conceptual modeling of aggregates in software engineering. An aggregate is a cluster of domain objects that can be treated as a single unit. In UML, an aggregation is a type of association in which objects are configured…
In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…
Certain physical systems that one might consider for fault-tolerant quantum computing where qubits do not readily interact, for instance photons, are better suited for measurement-based quantum-computational protocols. Here we propose a…
We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time). We discover that all these claims…
In this paper we construct nonlinear partial differential equations in more than 3 independent variables, possessing a manifold of analytic solutions with high, but not full, dimensionality. For this reason we call them ``partially…
We investigate the computational power of particle methods, a well-established class of algorit hms with applications in scientific computing and computer simulation. The computational power of a compute model determines the class of…
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…
Attempts to understand zero temperature phase transitions have forced physicists to consider a regime where the standard paradigms of condensed matter physics break down [1-4]. These quantum critical systems lack a simple description in…
Tutte's celebrated barycentric embedding theorem describes a natural way to build straight-line embeddings (crossing-free drawings) of a (3-connected) planar graph: map the vertices of the outer face to the vertices of a convex polygon, and…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
In topology, a torus remains invariant under certain non-trivial transformations known as modular transformations. In the context of topologically ordered quantum states of matter, these transformations encode the braiding statistics and…