Related papers: Constructions with Countable Subshifts of Finite T…
We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…
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…
We introduce and study additive posets. We show that the top homology group (with coefficients in Z/2Z) of a finite dimensional CW-complex carries a structure of an additive poset invariant under subdivisions. Applications to CW-complexes…
In this talk the class of multi-fields reductions of the KP and super-KP hierarchies (leading to non-purely differential Lax operators) is revisited from the point of view of coset construction. This means in particular that all the…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
The characterization of the finite minimal automorphic posets of width three is still an open problem. Niederle has shown that this task can be reduced to the characterization of the nice sections of width three having a non-trivial tower…
Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrated on certain classes of countably infinite structures, that are…
In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…
In this article, we analyse the structure of finite dimensional subspaces of the set of points of strong subdifferentiability in a dual space. In a dual $L_1(\mu)$ space, such a subspace is in the discrete part of the Yoshida-Hewitt type…
Let $G$ be a residually finite group and let $A$ be a finite set. We prove that if $X \subset A^G$ is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in $X$. The…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…
In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order…
We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theorem on Fermat numbers.
For countably infinite IFSs on $\mathbb R^2$ consisting of affine contractions with diagonal linear parts, we give conditions under which the affinity dimension is an upper bound for the Hausdorff dimension and a lower bound for the lower…
In this paper we show that an instance of dividing in pseudofinite structures can be witnessed by a drop of the pseudofinite dimension. As an application of this result we give new proofs of known results for asymptotic classes of finite…
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…
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…
For any infinite subset $X$ of the rationals and a subset $F \subseteq X$ which has no isolated points in $X$ we construct a function $f: X \to X$ such that $f(f(x))=x$ for each $x\in X$ and $F $ is the set of discontinuity points of $f$.