Related papers: Complexity and speed of semi-algebraic multi-persi…

This article grew out of the theoretical part of my Master's thesis at the Faculty of Mathematics and Information Science at Ruprecht-Karls-Universit\"at Heidelberg under the supervision of PD Dr. Andreas Ott. Following the work of G.…

In this paper, we define the homological Morse numbers of a filtered cell complex in terms of relative homology of nested filtration pieces, and derive inequalities relating these numbers to the Betti tables of the multi-parameter…

For a field $\mathbb{F}$, let $R(n, m)$ be the ring of invariant polynomials for the action of $\mathrm{SL}(n, \mathbb{F}) \times \mathrm{SL}(n, \mathbb{F})$ on tuples of matrices -- $(A, C)\in\mathrm{SL}(n, \mathbb{F}) \times…

We develop the notion of a "filtered cospan" as an algebraic object that stands in the same relation to interlevel persistence modules as filtered chain complexes stand with respect to sublevel persistence modules. This relation is…

This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable…

We define an algorithm that parses multidimensional arrays sequentially into mainly unrepeated but nested multidimensional sub-arrays of increasing size, and show that the resulting sub-block pointer encoder compresses almost every…

We describe a method for fast approximation of sparse coding. The input space is subdivided by a binary decision tree, and we simultaneously learn a dictionary and assignment of allowed dictionary elements for each leaf of the tree. We…

We introduce a new formulation for the finite element immersed boundary method which makes use of a distributed Lagrange multiplier. We prove that a full discretization of our model, based on a semi-implicit time advancing scheme, is…

Let $G$ be a compact Lie group. We introduce a semiclassical framework, called Borel-Weil calculus, to investigate $G$-equivariant (pseudo)differential operators acting on $G$-principal bundles over closed manifolds. In this calculus, the…

We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…

In this paper, we study the supports of measures in multiplicative free semigroups on the positive real line and on the unit circle. We provide formulas for the density of the absolutely continuous parts of measures in these semigroups. The…

The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…

In this article, we introduce the concept of the boundary complexity and prove that for a 2-multiplicative integer system (2-MIS) $X^{p}_{\Omega}$ on $\mathbb{N}$ (or $X^{\bf p}_{\Omega}$ on $\mathbb{N}^d,d\geq 2$), every point in…

Semilinear stochastic partial differential equations on bounded domains $\mathscr{D}$ are considered. The semilinear term may have arbitrary polynomial growth as long as it is continuous and monotone except perhaps near the origin. Typical…

Given a polynomial function $f \colon \mathbb{R}^n \rightarrow \mathbb{R}$ and a unbounded basic closed semi-algebraic set $S \subset \mathbb{R}^n,$ in this paper we show that the conditions listed below are characterized exactly in terms…

Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial…

We study the expressivity and computational aspects of first-order logic and its extensions in the semiring semantics developed by Gr\"adel and Tannen. We characterize the complexity of model checking and data complexity of first-order…

Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…

We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…