Related papers: A Deterministic Dimension Property of Twisted Gopp…
The classical (vertex) metric dimension of a graph G is defined as the cardinality of a smallest set S in V (G) such that any two vertices x and y from G have different distances to least one vertex from S: The k-metric dimension is a…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k edges and testing whether such a graph has a square root…
Multifractal dimensions allow for characterizing the localization properties of states in complex quantum systems. For ergodic states the finite-size versions of fractal dimensions converge to unity in the limit of large system size.…
Even though big mapping class groups are not countably generated, certain big mapping class groups can be generated by a coarsely bounded set and have a well defined quasi-isometry type. We show that the big mapping class group of a stable…
A characterization of the matrix representation of the compressed shift acting on a finite-dimensional model space endowed with the Takenaka-Malmquist-Walsh basis, among all upper triangular matrices, is proved. For a fixed dimension, this…
We present a generalized stochastic Cantor set by means of a simple {\it cut and delete process} and discuss the self-similar properties of the arising geometric structure. To increase the flexibility of the model, two free parameters, $m$…
The Kaprekar transformation is uniquely determined by parameters based on differences between symmetric values in the ordered numeric sequence. The parametric analysis of the iteration of the process requires developing Ki functions that…
We give a fixed-parameter tractable algorithm that, given a parameter $k$ and two graphs $G_1,G_2$, either concludes that one of these graphs has treewidth at least $k$, or determines whether $G_1$ and $G_2$ are isomorphic. The running time…
The quantum geometry arising in Loop Quantum Gravity has been known to semi-classically lead to generalizations of length-geometries. There have been several attempts to interpret these so called twisted geometries and understand their role…
A vertex $w$ in a graph $G$ is said to resolve two vertices $u$ and $v$ if $d(w,u)\neq d(w, v)$. A set $W$ of vertices is a resolving set for $G$ if every pair of distinct vertices is resolved by some vertex in $W$. The metric dimension of…
The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…
Melvin models with irrational twist parameter provide an interesting example of conformal field theories with non-compact target space, and localized states which are arbitrarily close to being delocalized. We study the torus partition sum…
A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a resolving set of Johnson graphs, doubled Odd…
The Exact Regularity Property was introduced recently as a property of homological Pisot substitutions in one dimension. In this paper, we consider exact regularity for arbitrary tiling spaces. Let ${T}$ be a $d$ dimensional repetitive…
We begin this chapter by introducing the simple algebraic structure of cyclic codes over finite fields. This structure undergoes a series of generalizations to present algebraic descriptions of constacyclic, quasi-cyclic (QC), quasi-twisted…
We investigate the stability of the topological phase of the toric code model in the presence of a uniform magnetic field by means of variational and high-order series expansion approaches. We find that when this perturbation is strong…
The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…
We consider the following natural graph cut problem called Critical Node Cut (CNC): Given a graph $G$ on $n$ vertices, and two positive integers $k$ and $x$, determine whether $G$ has a set of $k$ vertices whose removal leaves $G$ with at…
Treewidth is a parameter that measures how tree-like a relational instance is, and whether it can reasonably be decomposed into a tree. Many computation tasks are known to be tractable on databases of small treewidth, but computing the…