相关论文: On Level persistence (Relevant level persistence n…
The purpose of these notes is to further complete our understanding of the stable concentration phenomenon, by obtaining the finite range behavior of $P(F-E[F]\geq x)$, with $F=f(X)$ where $f$ is a Lipschitz function and $X$ is a stable…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.
We introduce Reeb complexes in order to capture how generators of homology flow along sections of a real valued continuous function. This intuition suggests a close relation of Reeb complexes to established methods in topological data…
We introduce a new feature map for barcodes that arise in persistent homology computation. The main idea is to first realize each barcode as a path in a convenient vector space, and to then compute its path signature which takes values in…
The persistence diagram of Cohen-Steiner, Edelsbrunner, and Harer was recently generalized by Patel to the case of constructible persistence modules with values in a symmetric monoidal category with images. Patel also introduced a distance…
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…
The lens depth of a point has been recently extended to general metric spaces, which is not the case for most depths. It is defined as the probability of being included in the intersection of two random balls centred at two random points X…
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
This paper presents a new decoding for polynomial residue codes, called the minimum degree-weighted distance decoding. The newly proposed decoding is based on the degree-weighted distance and different from the traditional minimum Hamming…
The extended persistence diagram is an invariant of piecewise linear functions, which is known to be stable under perturbations of functions with respect to the bottleneck distance as introduced by Cohen-Steiner, Edelsbrunner, and Harer. We…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
This note quantifies, via a sharp inequality, an interplay between (a) the characteristic rank of a vector bundle over a topological space X, (b) the Z/2Z-Betti numbers of X, and (c) sums of the numbers of certain partitions of integers. In…
The lower transcendence degree, introduced by J. J Zhang, is an important non-commutative invariant in ring theory and non-commutative geometry strongly connected to the classical Gelfand-Kirillov transcendence degree. For LD-stable…
This paper provides a framework in which multilevel Monte Carlo and continuous level Monte Carlo can be compared. In continuous level Monte Carlo the level of refinement is determined by an exponentially distributed random variable, which…
In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as…
In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…
We investigate the relations between algebraic structures, spectral invariants, and persistence modules, in the context of monotone Lagrangian Floer homology with Hamiltonian term. Firstly, we use the newly introduced method of filtered…
In this paper, we see several basic properties of graded linear series. We firstly see that, if a graded linear series contains an ample series, then so are the pullbacks of the system under birational morphisms. Using this proposition, we…
In this note, we study the long time behavior of Lotka-Volterra systems whose coefficients vary randomly. Bena{\"i}m and Lobry (2015) recently established that randomly switching between two environments that are both favorable to the same…