相关论文: Central sets generated by uniformly recurrent word…
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems…
Originating in harmonic analysis, interpolation sets were first studied in dynamics by Glasner and Weiss in the 1980s. A set $S \subset \mathbb{N}$ is an interpolation set for a class of topological dynamical systems $\mathcal{C}$ if any…
Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…
The Theorems of Hindman and van der Waerden belong to the classical theorems of partition Ramsey Theory. The Central Sets Theorem is a strong simultaneous extension of both theorems that applies to general commutative semigroups. We give a…
In the 1970s Deuber introduced the notion of $(m,p,c)$-sets in $\mathbb{N}$ and showed that these sets are partition regular and contain all linear partition regular configurations in $\mathbb{N}$. In this paper we obtain enhancements and…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
We introduce a method for constructing collections of subsets of $\mathbb{R}^{n}$, using an iterated function system, a set $T,$ and a cost function. We refer to these collections as tilings. The special case where $T$ is the central open…
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…
A number $m$ is said to be a $\textit{de Polignac number}$, if infinitely many pairs of consecutive primes exist, such that $m$ can be written as the difference of those consecutive prime numbers. Recently in [ W. D. Banks: Consecutive…
This paper reviews some results regarding symbolic dynamics, correspondence between languages of dynamical systems and combinatorics. Sturmian sequences provide a pattern for investigation of one-dimensional systems, in particular interval…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…
In "IP-sets and polynomial recurrence", Bergelson, Furstenberg, and McCutcheon established the following far reaching extension of Khintchine's recurrence theorem: For any invertible probability preserving system $(X,\mathcal A,\mu,T)$, any…
We introduce the notion of specular sets which are subsets of groups called here specular and which form a natural generalization of free groups. These sets are an abstract generalization of the natural codings of linear involutions. We…
The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological…