Related papers: Trimming and Building Freezing Sets

In this paper, we consider the iterated trimming complex associated to data yielding a complex of length $3$. We compute an explicit algebra structure in this complex in terms of the algebra structures of the associated input data.…

In architecture, city planning, visual arts, and other design areas, shapes are often made with points, or with structural representations based on point-sets. Shapes made with points can be understood more generally as finite arrangements…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Let $\beta_1,...,\beta_n$ be distinct points in the open unit disc in the complex plane, none of which is the origin, and let $H^1$ be the Hardy space. Define a closed convex set in $\mathbb{C}^{n}$ by $\Lambda = \{…

In this paper, we investigate the existence and uniqueness of fixed points for self-mappings defined on bipolar metric spaces using a new class of contractive conditions, namely polynomial-type contractions. Our main results establish…

We construct model sets arising from cut and project schemes in Euclidean spaces whose associated Delone dynamical systems have positive toplogical entropy. The construction works both with windows that are proper and with windows that have…

We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

Dialectica categories are a very versatile categorical model of linear logic. These have been used to model many seemingly different things (e.g., Petri nets and Lambek's calculus). In this note, we expand our previous work on fuzzy petri…

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

Features such as photon rings, jets, or hot. spots can leave particular topological signatures in a black hole image. As such, topological data analysis can be used to characterize images resulting from high resolution observations…

Topological correctness plays a critical role in many image segmentation tasks, yet most networks are trained using pixel-wise loss functions, such as Dice, neglecting topological accuracy. Existing topology-aware methods often lack robust…

Let $f:M\rightarrow M$ be a biholomorphisms on two--dimensional a complex manifold, and let $X\subseteq M$ be a compact $f$--invariant set such that $f|X$ is asymptotically dissipative and without sinks periodic points. We introduce a…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

We prove a fixed point theorem for closed-graphed, decomposable-valued correspondences whose domain and range is a decomposable set of functions from an atomless measure space to a topological space. One consequence is an improvement of the…

We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…

Unsupervised feature learning often finds low-dimensional embeddings that capture the structure of complex data. For tasks for which prior expert topological knowledge is available, incorporating this into the learned representation may…

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

This paper deals with a new notion called fuzzy $\alpha$-cut and its properties. A notion called localic frame is also introduced. Algebraic structures arising out of the family of fuzzy $\alpha$-cuts have been investigated. It will be seen…