Related papers: Structuring multi-dimensional subshifts
In this short note we confirm the deep structural correspondence between the complexity of a countable scattered chain (= strict linear order) and its big Ramsey combinatorics: we show that a countable scattered chain has finite big Ramsey…
We define combinatorial analogues of stable and unstable minimal surfaces in the setting of weighted pseudomanifolds. We prove that, under mild conditions, such combinatorial minimal surfaces always exist. We use a technique, adapted from…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
Several characterizations of weak cotype 2 and weak Hilbert spaces are given in terms of basis constants and other structural invariants of Banach spaces. For finite-dimensional spaces, characterizations depending on subspaces of fixed…
We study the geometric and topological properties of strange non-chaotic attractors created in non-smooth saddle-node bifurcations of quasiperiodically forced interval maps. By interpreting the attractors as limit objects of the iterates of…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
Based on set theoretic ordering properties, a general formulation for constructing a pair of convertibility monotones, which are generalizations of distillable entanglement and entanglement cost, is presented. The new pair of monotones do…
It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…
The idea that possible configurations of a physical system can be represented as points in a multidimensional configuration space ${\cal C}$ is explored. The notion of spacetime, without ${\cal C}$, does not exist in this theory. Spacetime…
In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…
We give an algebraic characterization of when a $d$-dimensional periodic framework has no non-trivial, symmetry preserving, motion for any choice of periodicity lattice. Our condition is decidable, and we provide a simple algorithm that…
We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems described by $S$-adic structures satisfying natural mild conditions, such as recognizability and primitiveness. Under the additional assumptions…
We investigate generic properties (i.e. properties corresponding to residual sets) in the space of subshifts with the Hausdorff metric. Our results deal with four spaces: the space $\mathbf{S}$ of all subshifts, the space…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and…
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…
Just as links may be algebraically described as certain morphisms in the category of tangles, compact surfaces smoothly embedded in R^4 may be described as certain 2-morphisms in the 2-category of `2-tangles in 4 dimensions'. In this…