Related papers: On Haar meager sets

Through the use of examples, we explain one way in which applied topology has evolved since the birth of persistent homology in the early 2000s. The first applications of topology to data emphasized the global shape of a dataset, such as…

We show that every non-Haar-null analytic subset of $\mathbb{Z}^\omega$ contains a non-Haar-null closed subset. Moreover, we also prove that the codes of Haar-null analytic subsets, and, consequently, closed Haar-null sets in the Effros…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

The concept of $H$-sets as introduced by Collatz in 1956 was very useful in univariate Chebyshev approximation by polynomials or Chebyshev spaces. In the multivariate setting, the situation is much worse, because there is no alternation,…

We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…

In this paper we consider the idea of I - convergence of nets of partial function from a metric space (X; d) to a metric space (Y; ?) and derive several basic characterization. This idea extends the concept of convergence of nets of partial…

We describe a mathematical formalism and numerical algorithms for identifying and tracking slowly mixing objects in nonautonomous dynamical systems. In the autonomous setting, such objects are variously known as almost-invariant sets,…

We develop a theory of graph algebras over general fields. This is modeled after the theory developed by Freedman, Lov\'asz and Schrijver in [22] for connection matrices, in the study of graph homomorphism functions over real edge weight…

Heffter arrays were introduced by Archdeacon in 2015 as an interesting link between combinatorial designs and topological graph theory. Since the initial paper on this topic, there has been a good deal of interest in Heffter arrays as well…

We study several notions of null sets on infinite-dimensional Carnot groups. We prove that a set is Aronszajn null if and only if it is null with respect to measures that are convolutions of absolutely continuous (CAC) measures on Carnot…

We introduce and develop the theory of weakly Arf rings, which is a generalization of Arf rings, initially defined by J. Lipman in 1971. We provide characterizations of weakly Arf rings and study the relation between these rings, the Arf…

Chaotic iterations have been introduced on the one hand by Chazan, Mi- ranker [6] and Miellou [10] in a numerical analysis context, and on the other hand by Robert [12] and Pellegrin [11] in the discrete dynamical systems frame- work. In…

Convergence of projection-based methods for nonconvex set feasibility problems has been established for sets with ever weaker regularity assumptions. What has not kept pace with these developments is analogous results for convergence of…

We study the topology of circularly ordered sets. While the algebraic notion is classical, the general topological theory has received comparatively little attention. In this work we provide a self-contained topological exposition and…

Abstract upper densities are monotone and subadditive functions from the power set of positive integers into the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

Acharya introduced the notion of set-valuations of graphs as a set analogue of the number valuations of graphs. Also we have the notion of set-indexers, integer additive set-indexers and k-uniform integer additive set-indexers. In this…

Self-similarity of systems is very popular and intensively developing field during last decades. To this field belong so-called stable distributions and their generalization. In Klebanov and Sl\'amov\'a (2014) there was given an approach to…

Human Activity Recognition (HAR) has been studied for decades, from data collection, learning models, to post-processing and result interpretations. However, the inherent hierarchy in the activities remains relatively under-explored,…

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

Graph Neural Networks (GNNs) have become a topic of intense research recently due to their powerful capability in high-dimensional classification and regression tasks for graph-structured data. However, as GNNs typically define the graph…