Related papers: Approximating the Hard Square Entropy Constant wit…
Given a graph $G=(V,E)$ with $V=\{1,\ldots,n\}$, we place on every vertex a token $T_1,\ldots,T_n$. A swap is an exchange of tokens on adjacent vertices. We consider the algorithmic question of finding a shortest sequence of swaps such that…
We study the phase transition in the holographic entanglement entropy for various confining models. This transition occurs for the entanglement entropy of a strip at a critical value of the strip width. Our main interest is to examine the…
Suppose $P\subseteq \mathbb{N}$ and let $(\Sigma_P,\,\sigma_P)$ be the space of a spacing shift. We show that if entropy $h_{\sigma_P}=0$ then $(\Sigma_P,\,\sigma_P)$ is proximal. Also $h_{\sigma_P}=0$ if and only if $P=\mathbb N\setminus…
In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to…
Let $H$ be a fixed graph. The $H$-Transversal problem, given a graph $G$, asks to remove the smallest number of vertices from $G$ so that $G$ does not contain $H$ as a subgraph. While a simple $|V(H)|$-approximation algorithm exists and is…
We suggest a robust nearest-neighbor approach to classifying high-dimensional data. The method enhances sensitivity by employing a threshold and truncates to a sequence of zeros and ones in order to reduce the deleterious impact of…
The magnetic susceptibility of the two-dimensional repulsive Hubbard model with nearest-neighbor hopping is investigated using the diagram technique developed for the case of strong correlations. In this technique a power series in the…
Let $\mathbb H$ be the finite direct sums of $H^2(\mathbb D)$. In this paper, we give a characterization of the closed subspaces of $\mathbb H$ which are invariant under the shift, thus obtaining a concrete Beurling-type theorem for the…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
We construct rigorously suitable approximate solutions to the Stokes/Cahn-Hilliard system by using the method of matched asymptotics expansions. This is a main step in the proof of convergence given in the first part of this contribution,…
Given an undirected graph $G = (V_G, E_G)$ and a fixed "pattern" graph $H = (V_H, E_H)$ with $k$ vertices, we consider the $H$-Transversal and $H$-Packing problems. The former asks to find the smallest $S \subseteq V_G$ such that the…
Positive topological entropy and distributional chaos are characterized for hereditary shifts. A hereditary shift has positive topological entropy if and only if it is DC2-chaotic (or equivalently, DC3-chaotic) if and only if it is not…
Hom shifts form a class of multidimensional shifts of finite type (SFT) and consist of colorings of the grid Z2 where adjacent colours must be neighbors in a fixed finite undirected simple graph G. This class includes several important…
Any coded subshift X defined by a set C of code words contains a subshift, which we call L, consisting of limits of single code words. We show that when C satisfies a unique decomposition property, the topological entropy h(X) of X is…
In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let $P\subset \mathbbm{R}^N$ be a given set of $M$ points. The techniques developed herein find an $O(n…
Some of the most fundamental and well-studied graph parameters are the Diameter (the largest shortest paths distance) and Radius (the smallest distance for which a "center" node can reach all other nodes). The natural and important…
This article introduces strongly near proximity, which represents a new kind of proximity called \emph{almost proximity}. A main result in this paper is the introduction of a hit-and-miss topology on ${CL}(X)$, the hyperspace of nonempty…
A novel formalism, called H-theory, is applied to the problem of statistical equilibrium of a hierarchical complex system with multiple time and length scales. In this approach, the system is formally treated as being composed of a small…
We investigate the dynamical evolution of entanglement entropy in a holographic superconductor model by quenching the source term of the dual charged scalar operator. By access to the full background geometry, the holographic entanglement…
In this paper we continue the study of renormalized entanglement entropy introduced in [1]. In particular, we investigate its behavior near an IR fixed point using holographic duality. We develop techniques which, for any static holographic…