Related papers: On Derivatives and Subpattern Orders of Countable …
Shifts of finite type and the notion of shadowing, or pseudo-orbit tracing, are powerful tools in the study of dynamical systems. In this paper we prove that there is a deep and fundamental relationship between these two concepts. Let $X$…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
We investigate the enumerative geometry of point configurations in projective space. We define "projective configuration counts": these enumerate configurations of points in projective space such that certain specified subsets are in fixed…
We study theoretical and computational properties of the pressure function for subshifts of finite type on the integer lattice $\Z^d$, multidimensional SOFT, which are called Potts models in mathematical physics. We show that the pressure…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
We introduce a new family of finite posets which we call 2-chains. These first arose in the study of 0-Hecke algebras, but they admit a variety of different characterisations. We give these characterisations, prove that they are equivalent…
Two and three-point functions of primary fields in four dimensional CFT have a simple space-time dependences factored out from the combinatoric structure which enumerates the fields and gives their couplings. This has led to the formulation…
We discuss some numerical invariants of multidimensional shifts of finite type (SFTs) which are associated with the growth rates of the number of admissible finite configurations. Extending an unpublished example of Tsirelson, we show that…
There are a variety of results in the literature proving forms of computability for topological entropy and pressure on subshifts. In this work, we prove two quite general results, showing that topological pressure is always computable from…
Turning on N=2 supersymmetry-preserving relevant operators in a 4-dimensional N=2 superconformal field theory (SCFT) corresponds to a complex deformation compatible with the rigid special Kahler geometry encoded in the low energy effective…
The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…
We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
A sofic approximation to a countable group is a sequence of partial actions on finite sets that asymptotically approximates the action of the group on itself by left-translations. A group is sofic if it admits a sofic approximation. Sofic…
We introduce a notion of residual derivative for elements of a preordered set, a construction that generalizes both the Frattini subgroup in algebra and the Cantor-Bendixson derivative in T1 topological spaces. For dual algebraic coframes…
We give a non-technical summary of the classification program, very dear to the hearts of both authors, of four dimensional $\mathcal{N}=2$ superconformal field theories (SCFTs) based on the study of their Coulomb branch geometries. We…
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
In this article we prove that multidimensional effective S-adic systems, obtained by applying an effective sequence of substitutions chosen among a finite set of substitutions, are sofic subshifts.
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…