Related papers: Patterns in thick compact sets
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
We show that products of sufficiently thick Cantor sets generate trees in the plane with constant distance between adjacent vertices. Moreover, we prove that the set of choices for this distance has non-empty interior. We allow our trees to…
In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…
Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k length arithmetic progression and such collection is also piecewise syndetic in Z: They used algebraic structure of beta N. The above result…
We consider capacity (fuzzy measure, non-additive probability) on a compactum as a monotone cooperative normed game. We introduce topological analogues of well known class of exact games and show that these classes form subfunctors of the…
We study dynamical properties of the Fibonacci trace map - a polynomial map that is related to numerous problems in geometry, algebra, analysis, mathematical physics, and number theory. Persistent homoclinic tangencies, stochastic sea of…
The paper is devoted to inverse Stackelberg games with many players. We consider both static and differential games. The main assumption of the paper is the compactness of the strategy sets. We obtain the characterization of inverse…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…
We prove that for any pair $(s,t)$ of nonnegative numbers with $s+t=1$, the set of two-dimensional $(s,t)$-badly approximable vectors is winning for Schmidt's game. As a consequence, we give a direct proof of Schmidt's conjecture using his…
By treating combinatorial games as dynamical systems, we are able to address a longstanding open question in combinatorial game theory, namely, how the introduction of a "pass" move into a game affects its behavior. We consider two well…
Using the Gandy -- Harrington topology and other methods of effective descriptive set theory, we prove several theorems on compact and sigma-compact pointsets. In particular we show that any $\Sigma^1_1$ set $A$ of the Baire space $N^N$…
We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…
We shall prove a convergence result relative to sequences of Minkowski symmetrals of general compact sets. In particular, we investigate the case when this process is induced by sequences of subspaces whose elements belong to a finite…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
We construct, in locally compact, second countable, amenable groups, sets with large density that fail to have certain combinatorial properties. For the property of being a shift of a set of measurable recurrence we show that this is…
We study boundedness and compactness of composition operators on weighted Bergman spaces of Dirichlet series. Particularly, we obtain in some specific cases, upper and lower bounds of the essential norm of these operators and a criterion of…
In \cite{SchmidtGames}, W. Schmidt proved that the set of non-normal numbers in base $b$ is a {\it winning set}. We generalize this result by proving that many sets of non-normal numbers with respect to the Cantor series expansion are…
The purpose of this paper is to consider some basic constructions in the category of compact quantum groups --for example de case of extensions, of Drinfeld twists, of matched pairs, of extensions, of linked pairs and of cocycle Singer…
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…