Related papers: A note on lattice knots
These notes are a self-contained short proof of the stability of persistence diagrams.
The main goal of this contribution is to explain how to use interlacing techniques for LTI controllers implementation and analyze different struc- tures in this environment. These considerations lead to an important com- putation saving in…
This set of notes re-proves known results on weighted automata (over a field, also known as multiplicity automata). The text offers a unified view on theorems and proofs that have appeared in the literature over decades and were written in…
Motivated by link transformations of lattice gauge theory, a method for generating local unitary invariants, especially for a system of qubits, has been pointed out in an earlier work [M. S. Williamson {\it et. al.}, Phys. Rev. A {\bf 83},…
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study of local testing for membership in lattices. Testing…
The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.
In this article we study a small random perturbation of a linear recurrence equation. If all the roots of its corresponding characteristic equation have modulus strictly less than one, the random linear recurrence goes exponentially fast to…
Knots are fascinating topological structures that have been observed in various contexts, ranging from micro-worlds to macro-systems, and are conjectured to play a fundamental role in their respective fields. In order to characterize their…
Any knot diagram can be transformed into the unknot by a series of unknotting operations. This paper introduces the diagonal move, a novel unknotting operation that generalizes and unifies several existing moves. We prove that the diagonal…
We construct a new type of geometric knot theory, plumbers' knots, and solve the problems of distinguishing and enumerating such knots at a fixed level of complexity. (v2) Minor edits, added theorem 3.18. (v3) Substantial revisions,…
The purpose of this short communication is to make some observations on the connections between various existing formulas of counting the number of sublattices of a fixed index in an $n$-dimensional lattice and their connection with the…
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
In \cite{Kim} it is shown that knots in $S_{g} \times S^{1}$ can be presented by virtual diagrams with a decoration, so called, {\em double lines}. In this paper, we study the essential diagram for each knot in $S_{g} \times S^{1}$, which…
These notes aim to provide a pedagogical introduction to Lattice QCD. The topics covered include the scope of LQCD calculations, lattice discretization of gauge and fermion (naive, Wilson, and staggered) actions, doubling problem, improved…
We consider computations of a Turing machine subjected to noise. In every step, the action (the new state and the new content of the observed cell, the direction of the head movement) can differ from that prescribed by the transition…
Motivated by the connection between gauge field topology and the axial anomaly in fermion currents, I use the fourth power of the naive Dirac operator to define a local lattice measure of topological charge. For smooth gauge fields this…
In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…
Suppose that wirelessly communicating sensors are placed in a regular fashion on the points of a lattice. Common communication protocols allow the sensors to broadcast messages at arbitrary times, which can lead to problems should two…