Related papers: On Approximation of $2$D Persistence Modules by In…

Many vision-related tasks benefit from reasoning over multiple modalities to leverage complementary views of data in an attempt to learn robust embedding spaces. Most deep learning-based methods rely on a late fusion technique whereby…

We develop the first algorithms for computing the Skyscraper Invariant [FJNT24]. This is a filtration of the classical rank invariant for multiparameter persistence modules defined by the Harder-Narasimhan filtrations along every central…

We study a scheme M closely related to the set of pairs of n by n-matrices with rank 1 commutator. We show that M is a reduced complete intersection with n+1 irreducible components, which we describe. There is a distinguished Lagrangian…

This is the addendum to the paper "On the Multiplicity Problem and the Isomorphism Problem for the Four Subspace Algebra" Communications in Algebra, 40:6 (2012), 2005-2036 (DOI: 10.1080/00927872.2011.570830). We give here the full proof of…

Let R be a commutative ring with identity and M be an R-module. In this paper, we will introduce the concept of 2-irreducible (resp., strongly 2- irreducible) submodules of M as a generalization of irreducible (resp., strongly irreducible)…

Motivated by the problem of dealing with incomplete or imprecise acquisition of data in computer vision and computer graphics, we extend results concerning the stability of persistent homology with respect to function perturbations to…

This work develops compressive sampling strategies for computing the dynamic mode decomposition (DMD) from heavily subsampled or output-projected data. The resulting DMD eigenvalues are equal to DMD eigenvalues from the full-state data. It…

Let $\mu$ be a probability measure (or corresponding random variable) such that all moments $\mu_n$ exist. Knowledge of the moments is not sufficient to determine infinite divisibility of the measure; we show also that infinitely divisible,…

The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…

Seismic datasets contain valuable information that originate from areas of interest in the subsurface; such seismic reflections are however inevitably contaminated by other events created by waves reverberating in the overburden.…

This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take…

We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposition can simulate with the same time complexity but with a…

Using a result by Chazal, Crawley-Boevey and de Silva concerning radicals of persistence modules, we show that every lower semi-continuous q-tame persistence module can be decomposed as a direct sum of interval modules and that every upper…

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

We adapt the hypercube decompositions introduced by Blundell-Buesing-Davies-Veli\v{c}kovi\'{c}-Williamson to prove the Combinatorial Invariance Conjecture for Kazhdan-Lusztig $R$-polynomials in the case of elementary intervals in $S_n$.…

This paper studies separating invariants: mappings on $D$ dimensional domains which are invariant to an appropriate group action, and which separate orbits. The motivation for this study comes from the usefulness of separating invariants in…

In a recent paper, Dave Benson and Peter Symonds defined a new invariant $\gamma_G(M)$ for a finite dimensional module $M$ of a finite group $G$ which attempts to quantify how close a module is to being projective. In this paper, we…

Arithmetic quotients are quotients of bounded symmetric domains by arithmetic groups, and modular subvarieties of arithmetic quotients are themselves arithmetic quotients of lower dimension which live on arithmetic quotients, by an…

The present lack of a stable method to compare persistent homology groups with torsion is a relevant problem in current research about Persistent Homology and its applications in Pattern Recognition. In this paper we introduce a…

Highly accurate interval forecasting of electricity demand is fundamental to the success of reducing the risk when making power system planning and operational decisions by providing a range rather than point estimation. In this study, a…