Related papers: Algorithmic complexity and soficness of shifts in …
Steepness is a geometric property which, together with complex-analyticity, is needed in order to insure stability of a near-integrable hamiltonian system over exponentially long times. Following a strategy developed by Nekhoro-shev, we…
We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its…
Algorithmic statistics has two different (and almost orthogonal) motivations. From the philosophical point of view, it tries to formalize how the statistics works and why some statistical models are better than others. After this notion of…
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
In this paper, we study arbitrary infinite binary information systems each of which consists of an infinite set called universe and an infinite set of two-valued functions (attributes) defined on the universe. We consider the notion of a…
Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a…
This paper is a continuation of our 2005 paper on complex topology and its implication on invertibility (or non-invertibility). In this paper, we will try to classify the complexity of inversion into 3 different classes. We will use…
We study the classical and parameterized complexity of computing the positive non-clashing teaching dimension of a set of concepts, that is, the smallest number of examples per concept required to successfully teach an intelligent learner…
The information in an individual finite object (like a binary string) is commonly measured by its Kolmogorov complexity. One can divide that information into two parts: the information accounting for the useful regularity present in the…
A Hamiltonian with two degrees of freedom is said to be superintegrable if it admits three functionally independent integrals of the motion. This property has been extensively studied in the case of two-dimensional spaces of constant…
The Medvedev degree of a subshift is a dynamical invariant of computable origin that can be used to compare the complexity of subshifts that contain only uncomputable configurations. We develop theory to describe how these degrees can be…
This paper investigates a recently introduced notion of strong variational sufficiency in optimization problems whose importance has been highly recognized in optimization theory, numerical methods, and applications. We address a general…
We study the computational complexity of identifying dense substructures, namely $r/2$-shallow topological minors and $r$-subdivisions. Of particular interest is the case when $r=1$, when these substructures correspond to very localized…
Constrained second-order convex optimization algorithms are the method of choice when a high accuracy solution to a problem is needed, due to their local quadratic convergence. These algorithms require the solution of a constrained…
Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…
The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…
Using a deterministic version of the self-similar (or hierarchical, or fixed-point ) method for constructing 2-dimensional subshifts of finite type (SFTs), we construct aperiodic 2D SFTs with a unique direction of non-expansiveness and…
We present a discussion about the local isometric rigidity problem in codimension 2 with a concrete example. We show the necessity of extending the notions of genuine and honest rigidity in order to have the transitivity property. In order…
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of…