Related papers: A dynamical characterization of C sets
The existence of the {\em typical set} is key for data compression strategies and for the emergence of robust statistical observables in macroscopic physical systems. Standard approaches derive its existence from a restricted set of…
We extend the notion of mex, which is central in combinatorial number theory, to an arbitrary combinatorial structure, and we prove a general theorem to determine the generating function of the objects having fixed mex. We then study this…
We give an overview of recent developments in the theory of dimer models. The viewpoint we take is inspired by mirror symmetry. After an introduction to the combinatorics of dimer models, we will first look at dimers in dynamical systems…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
The notion of $\Delta$-weakly mixing set is introduced, which shares similar properties of weakly mixing sets. It is shown that if a dynamical system has positive topological entropy, then the collection of $\Delta$-weakly mixing sets is…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
For a fixed C*-algebra A, we consider all noncommutative dynamical systems that can be generated by A. More precisely, an A-dynamical system is a triple (i,B,\alpha) where $\alpha$ is a *-endomorphism of a C*-algebra B, and i: A --> B is…
We introduce and develop the notion of *displayed categories*. A displayed category over a category C is equivalent to "a category D and functor F : D --> C", but instead of having a single collection of "objects of D" with a map to the…
The notion of abundance of certain type of configuration in certain large sets was first proved by Furstenberg and Glazner in 1998. After that many author investigate abundance of different types of configurations in different types of…
The center $Z(\mathcal{A})$ of an abelian category $\mathcal{A}$ is the endomorphism ring of the identity functor on that category. A localizing subcategory of a Grothendieck category $\mathcal{C}$ is said to be stable if it is stable under…
The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…
In this note we characterize, within the framework of the theory of finite set, those categories of graphs that are {\em algebraic universal} in the sense that every concrete category embeds in them. The proof of the characterization is…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
The work lays the foundations of the theory of changeable sets. In author opinion, this theory, in the process of it's development and improvement, can become one of the tools of solving the sixth Hilbert problem least for physics of…
We generalize a result of Lindenstrauss on the interplay between measurable and topological dynamics which shows that every separable ergodic measurably distal dynamical system has a minimal distal model. We show that such a model can, in…
The notion of central stability was first formulated for sequences of representations of the symmetric groups by Putman. A categorical reformulation was subsequently given by Church, Ellenberg, Farb, and Nagpal using the notion of…
We consider the functor C that to a unital C*-algebra A assigns the partial order set C(A) of its commutative C*-subalgebras ordered by inclusion. We investigate how some C*-algebraic properties translate under the action of C to…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.