Related papers: A survey on Newhouse thickness, fractal intersecti…
In this work, we aim to advance the development of a fractal theory for sets of integers. The core idea is to utilize the fractal structure of $p$-adic integers, where $p$ is a prime number, and compare this with conventional densities and…
This article introduces innovative classes of open sets in \(\mathbb{R}^{N}\), where \(N=2, 3\), characterized by a geometric property associated with the inward normal. The focus lies on proving compactness results for the Hausdorff…
We introduce a new abstract graph game, Swap Planarity, where the goal is to reach a state without edge intersections and a move consists of swapping the locations of two vertices connected by an edge. We analyze this puzzle game using…
We propose a measure of shape which is appropriate for the study of a complicated geometric structure, defined using the topology of neighborhoods of the structure. One aspect of this measure gives a new notion of fractal dimension. We…
We review the theoretical framework that establishes a crucial bridge between the general Steiner-type formula of Hug, Last, and Weil and the theory of complex (fractal) dimensions of Lapidus et all. Two novel families of geometric…
We propose a notion of depth with respect to a finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$ which we call $\text{dep}_\mathcal{F}$. We begin showing that $\text{dep}_\mathcal{F}$ satisfies some expected properties for a…
We use relative symplectic cohomology to detect heavy sets, with the help of index bounded contact forms. This establishes a relation between two notions SH-heaviness and heaviness, which partly answers a conjecture of…
We study the geometry of dynamically defined Cantor sets in arbitrary dimensions, introducing a criterion for $\mathcal{C}^{1+\alpha}$ stable intersections of such Cantor sets, under a mild bunching condition. This condition is naturally…
We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…
This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…
In this paper, we propose a new model that is capable of recognizing overlapping mentions. We introduce a novel notion of mention separators that can be effectively used to capture how mentions overlap with one another. On top of a novel…
This work developes a quantitative framework for describing the overcompleteness of a large class of frames. A previous paper introduced notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…
Resonance counting is an intuitive and widely used tool in Random Matrix Theory and Anderson Localization. Its undoubted advantage is its simplicity: in principle, it is easily applicable to any random matrix ensemble. On the downside, the…
In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel combinatorial problem formalizing this tradeoff: from a…
In this paper, we introduce the notion of large scale resemblance structure as a new large scale structure by axiomatizing the concept of `being alike in large scale' for a family of subsets of a set. We see that in a particular case, large…
We explore links between the thin concurrent games of Castellan, Clairambault and Winskel, and the weighted relational models of linear logic studied by Laird, Manzonetto, McCusker and Pagani. More precisely, we show that there is an…
In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
In this paper, we present a new metric distance for comparing two large graphs to find similarities and differences between them based on one of the most important graph structural properties, which is Node Adjacency Information, for all…