Related papers: Central Open Sets Tilings
Unsupervised representation learning methods are widely used for gaining insight into high-dimensional, unstructured, or structured data. In some cases, users may have prior topological knowledge about the data, such as a known cluster…
The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given…
The main goal of this paper is to investigate relations between topologies obtained by: $\theta$-open sets, $\omega$-open sets, $\theta_\omega$-open sets, local function, and local closure function with ideal of the countable sets. As the…
Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…
Covering and elimination inequalities are central to combinatorial optimization, yet their role has largely been studied in problem-specific settings or via no-good cuts. This paper introduces a unified perspective that treats these…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
The paper concerns a new method to obtain a direct proof of the openness at linear rate/metric regularity of composite set-valued maps on metric spaces by the unification and refinement of several methods developed somehow separately in…
Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper,…
Using the combinatorial properties of subsets of integers, a classification of metric dynamical systems was given in [V. Bergelson and T. Downarowicz, Large sets of integers and hierarchy of mixing properties of measure-preserving systems,…
An approach to clustering is presented that adapts the basic top-down induction of decision trees method towards clustering. To this aim, it employs the principles of instance based learning. The resulting methodology is implemented in the…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
The aim of this paper is to present a construction of $t$-divisible designs for $t>3$, because such divisible designs seem to be missing in the literature. To this end, tools such as finite projective spaces and their algebraic varieties…
In this paper, we study two kinds of combinatorial objects, generalized integer partitions and tilings of two dimensional zonotopes, using dynamical systems and order theory. We show that the sets of partitions ordered with a simple…
The classification of textual data often yields important information. Most classifiers work in a closed world setting where the classifier is trained on a known corpus, and then it is tested on unseen examples that belong to one of the…
Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…
A general construction principle of inflation rules for decagonal quasiperiodic tilings is proposed. The prototiles are confined to be polygons with unit edges. An inflation rule for a tiling is the combination of an expansion and a…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
The concept of comprehensive triangular decomposition (CTD) was first introduced by Chen et al. in their CASC'2007 paper and could be viewed as an analogue of comprehensive Grobner systems for parametric polynomial systems. The first…
The cluster-tilted algebras have been introduced by Buan, Marsh and Reiten, they are the endomorphism rings of cluster-tilting objects $T$ in cluster categories; we call such an algebra cluster-concealed in case $T$ is obtained from a…
We introduce the notion of noncompact (partial) silting and (partial) tilting sets and objects in any triangulated category D with arbitrary (set-indexed) coproducts. We show that equivalence classes of partial silting sets are in bijection…