In this paper, we develop the mathematical framework for filtering problems arising from biophysical applications where data is collected from confocal laser scanning microscopy recordings of the space-time evolution of intracellular wave dynamics of biophysical quantities. In these applications, signals are described by stochastic partial differential equations (SPDEs) and observations can be modelled as functionals of marked point processes whose intensities depend on the underlying signal. We derive both the unnormalized and normalized filtering equations for these systems, demonstrate the asymptotic consistency and approximations of finite dimensional observation schemes respectively partial observations. Our theoretical results are validated through extensive simulations using synthetic and real data. These findings contribute to a deeper understanding of filtering with point process observations and provide a robust framework for future research in this area.

We use new homotopy-theoretic tools to prove the existence of smooth $U(1)$- and $Sp(1)$-actions on infinite families of exotic spheres. Such families of spheres are propagated by the complex and quaternionic analogues of the Mahowald invariant (also known as the root invariant). In particular, we prove that the complex (respectively, quaternionic) Mahowald invariant takes an element of the $k$-th stable stem $π_k^s$ represented by a homotopy sphere $Σ^k$ to an element of a higher stable stem $π_{k+\ell}^s$ represented by another homotopy sphere $Σ^{k+\ell}$ equipped with a smooth $U(1)$- (respectively, $Sp(1)$-) action with fixed points the original homotopy sphere $Σ^k\subset Σ^{k+\ell}$.

We prove Demailly's Conjecture concerning the lower bound for the Waldschmidt constant in terms of the initial degree of the second symbolic powers for any set of generic points or very general points in $\mathbb{P}^N$. We also discuss the Harbourne-Huneke Containment and the aforementioned Demailly's Conjecture for general points and show the results for sufficiently many general points and general points in projective spaces with low dimensions.

This text is a survey on symmetric matrices. It serves as a script for a module to be taught at university.

We prove that the minimal size $M(π_n)$ of a maximal matching in the permutahedron $π_n$ is asymptotically $n!/3$. On the one hand, we obtain a lower bound $M(π_n) \ge n! (n-1) / (3n-2)$ by considering $4$-cycles in the permutahedron. On the other hand, we obtain an asymptotical upper bound $M(π_n) \le n!(1/3+o(1))$ by multiple applications of Hall's theorem (similar to the approach of Forcade (1973) for the hypercube) and an exact upper bound $M(π_n) \le n!/3$ by an explicit construction. We also derive bounds on minimum maximal matchings in products of permutahedra.

The main result of the paper is a description of conormal Lie algebras of Feigin-Odesskii Poisson structures. In order to obtain it we introduce a new variant of a definition of a Feigin-Odesskii Poisson structure: we define it using a differential on the second page of a certain spectral sequence. In the general case this spectral sequence computes morphisms and higher Ext's between filtered objects in an abelian category. Moreover, we use our definition to give another proof of the description of symplectic leaves of Feigin-Odesskii Poisson structures.

We discuss how to understand the asymptotic resurgence number of a pair of graded families of ideals from combinatorial data of their associated convex bodies. When the families consist of monomial ideals, the convex bodies being considered are the Newton-Okounkov bodies of the families. When ideals in the second family are classical invariant ideals, for instance, determinantal ideals or ideals of Pfaffians, these convex bodies are constructed from the associated Rees packages.

We establish the optimal ergodic convergence rate for the classical projected subgradient method with a time-varying step-size. This convergence rate remains the same even if we slightly increase the weight of the most recent points, thereby relaxing the ergodic sense.

We extend the stable motivic homotopy category of Voevodsky to the class of scalloped algebraic stacks, and show that it admits the formalism of Grothendieck's six operations. Objects in this category represent generalized cohomology theories for stacks like algebraic K-theory, as well as new examples like genuine motivic cohomology and algebraic cobordism. These cohomology theories admit Gysin maps and satisfy homotopy invariance, localization, and Mayer-Vietoris. For example, we deduce that homotopy K-theory satisfies cdh descent on scalloped stacks. We also prove a fixed point localization formula for torus actions. Finally, the construction is contrasted with a "lisse-extended" stable motivic homotopy category, defined for arbitrary stacks: we show for example that lisse-extended motivic cohomology of quotient stacks is computed by the equivariant higher Chow groups of Edidin-Graham, and we also get a good new theory of Borel-equivariant algebraic cobordism. Moreover, the lisse-extended motivic homotopy type is shown to recover all previous constructions of motives of stacks.

We introduce a notion of Milnor square of stable $\infty$-categories and prove a criterion under which algebraic K-theory sends such a square to a cartesian square of spectra. We apply this to prove Milnor excision and proper excision theorems in the K-theory of algebraic stacks with affine diagonal and nice stabilizers. This yields a generalization of Weibel's conjecture on the vanishing of negative K-groups for this class of stacks.

We completely determine the asymptotic depth, equivalently, the asymptotic projective dimension of a chain of edge ideals that is invariant under the action of the monoid Inc of increasing functions on the positive integers. Our results and their proofs also reveal surprising combinatorial and topological properties of corresponding graphs and their independence complexes. In particular, we are able to determine the asymptotic behavior of all reduced homology groups of these independence complexes.

We analyze smooth nonlinear mappings for Hilbert and Banach spaces that carry small balls to convex sets, provided that the radius of the balls is small enough. Being focused on the study of new and mild sufficient conditions for a nonlinear mapping of Hilbert and Banach spaces to be locally convex, we address a suitably reformulated local convexity problem analyzed within the Leray-Schauder homotopy method approach for Hilbert spaces, and within the Lipscitz smoothness condition both for Hilbert and Banach spaces. Some of the results presented in the work prove to be interesting and novel even for finite-dimensional problems. Open problems related to the local convexity property for nonlinear mapping of Banach spaces are also formulated.

McDuff and Segal proved that unordered configuration spaces of open manifolds satisfy homological stability: there is a stabilization map $σ: C_n(M)\to C_{n+1}(M)$ which is an isomorphism on $H_d(-;\mathbb{Z})$ for $n\gg d$. For a finite group $G$ and an open $G$-manifold $M$, under some hypotheses we define a family of equivariant stabilization maps $σ_{G/H}:C_n(M)\to C_{n+|G/H|}(M)$ for $H\leq G$. In general, these do not induce stability for Bredon homology, the equivariant analogue of singular homology. Instead, we show that each $σ_{G/H}$ induces isomorphisms on the ordinary homology of the fixed points of $C_n(M)$, and if the group is Dedekind (e.g. abelian), we obtain the following Bredon homological stability statement: $H^G_d(\bigsqcup_{n\geq 0}C_n(M))$ is finitely generated over $\mathbb{Z}[σ_{G/H} : H\leq G]$. This reduces to the classical statement when $G=e$.

We define the resurgence and asymptotic resurgence numbers associated to a pair of graded families of ideals in a Noetherian ring. These notions generalize the well-studied resurgence and asymptotic resurgence of an ideal in a polynomial ring. We examine when these invariant are finite and rational. We investigate situations where these invariant can be computed via Rees valuations or realized as actual limits of well-defined sequences. We study how the asymptotic resurgence changes when a family is replaced by its integral closure. Many examples are given to illustrate that whether or not known properties of resurgence and asymptotic resurgence of an ideal would extend to that of a pair of graded families of ideals generally depends on the Noetherian property and finite generation of the Rees algebras of these families.

Given a torus action on a compact space X, a fundamental result of Borel and Atiyah-Segal asserts that the equivariant cohomology of X is concentrated in the fixed locus X^T, up to inverting enough Chern classes. We prove an analogue for algebraic varieties over an arbitrary field. In fact, we deduce this from a categorification at the level of equivariant derived categories and even equivariant stable motivic homotopy categories, which also gives concentration at the level of Voevodsky motives and for homotopy K-theory.

In this paper, we prove a Heintze-Karcher type inequality for capillary hypersurfaces supported on various hypersurfaces in the hyperbolic space. The equality case only occurs on capillary totally umbilical hypersurfaces. Then we apply this result to prove the Alexandrov type theorem for embedded capillary hypersurfaces in the hyperbolic space. In addition, we prove some other rigidity results for capillary hypersurfaces supported on totally geodesic plane in $\mathbb B^{n+1}_+$.

The Schur index of a $4$ dimensional $\mathcal{N}=2$ superconformal field theory counts (with sign) bosonic and fermionic states that preserve $4$ supercharges. We consider the Schur indices of $4$d $\mathcal{N}=4$ super Yang-Mills and $\mathcal{N}=2$ circular quiver gauge theories with gauge groups $U(N)$ or $SU(N)$. We calculate the exponentially dominant part of their asymptotic expansions as the index parameter $q$ approaches any root of unity. We find that some of the indices exhibit ``small" ($\mathcal{O}(N^0)$ as $N \rightarrow \infty$) exponential growth, which is much smaller than an $\mathcal{O}(N^2)$ exponential growth of states that is indicative of a black hole. This implies that the indices do not capture a growth of states that would correspond to a supersymmetric black hole that preserves 4 supercharges in the holographic dual AdS theory. Interestingly, the exponentially dominant part in the Schur asymptotics we consider, depends on the parity of the rank $N$.

Let $\mathcal{I} = \{I_k\}_{k \in \mathbb{N}}$ be a graded family of monomial ideal. We use the Newton-Okounkov body of $\mathcal{I}$ to: (a) give a characterization for the Noetherian property of the Rees algebra of the family; and (b) present a combinatorial interpretation for the analytic spread of the family. We also apply these results to investigate the generation type and the Veronese degree of the symbolic Rees algebra of a monomial ideal.

This article presents a fast direct solver, termed Algebraic Inverse Fast Multipole Method (from now on abbreviated as AIFMM), for linear systems arising out of $N$-body problems. AIFMM relies on the following three main ideas: (i) Certain sub-blocks in the matrix corresponding to $N$-body problems can be efficiently represented as low-rank matrices; (ii) The low-rank sub-blocks in the above matrix are leveraged to construct an extended sparse linear system; (iii) While solving the extended sparse linear system, certain fill-ins that arise in the elimination phase are represented as low-rank matrices and are "redirected" though other variables maintaining zero fill-in sparsity. The main highlights of this article are the following: (i) Our method is completely algebraic (as opposed to the existing Inverse Fast Multipole Method~\cite{ arXiv:1407.1572,doi:10.1137/15M1034477,TAKAHASHI2017406}, from now on abbreviated as IFMM). We rely on our new Nested Cross Approximation~\cite{arXiv:2203.14832} (from now on abbreviated as NNCA) to represent the matrix arising out of $N$-body problems. (ii) A significant contribution is that the algorithm presented in this article is more efficient than the existing IFMMs. In the existing IFMMs, the fill-ins are compressed and redirected as and when they are created. Whereas in this article, we update the fill-ins first without affecting the computational complexity. We then compress and redirect them only once. (iii) Another noteworthy contribution of this article is that we provide a comparison of AIFMM with Hierarchical Off-Diagonal Low-Rank (from now on abbreviated as HODLR) based fast direct solver and NNCA powered GMRES based fast iterative solver. (iv) Additionally, AIFMM is also demonstrated as a preconditioner.

The starting point of this paper is a duality for sequences of natural numbers which, under mild hypotheses, interchanges subadditive and superadditive sequences and inverts their asymptotic growth constants. We are motivated to explore this sequence duality since it arises naturally in at least two important algebraic-geometric contexts. The first context is Macaulay-Matlis duality, where the sequence of initial degrees of the family of symbolic powers of a radical ideal is dual to the sequence of Castelnuovo-Mumford regularity values of a quotient by ideals generated by powers of linear forms. This philosophy is drawn from an influential paper of Emsalem and Iarrobino. We generalize this duality to differentially closed graded filtrations of ideals. In a different direction, we establish a duality between the sequence of Castelnuovo-Mumford regularity values of the symbolic powers of certain ideals and a geometrically inspired sequence we term the jet separation sequence. We show that this duality underpins the reciprocity between two important geometric invariants: the multipoint Seshadri constant and the asymptotic regularity of a set of points in projective space.

Merge trees are a type of graph-based topological summary that tracks the evolution of connected components in the sublevel sets of scalar functions. They enjoy widespread applications in data analysis and scientific visualization. In this paper, we consider the problem of comparing two merge trees via the notion of interleaving distance in the metric space setting. We investigate various theoretical properties of such a metric. In particular, we show that the interleaving distance is intrinsic on the space of labeled merge trees and provide an algorithm to construct metric 1-centers for collections of labeled merge trees. We further prove that the intrinsic property of the interleaving distance also holds for the space of unlabeled merge trees. Our results are a first step toward performing statistics on graph-based topological summaries.

We study the probabilistic convergence between the mapper graph and the Reeb graph of a topological space $\mathbb{X}$ equipped with a continuous function $f: \mathbb{X} \rightarrow \mathbb{R}$. We first give a categorification of the mapper graph and the Reeb graph by interpreting them in terms of cosheaves and stratified covers of the real line $\mathbb{R}$. We then introduce a variant of the classic mapper graph of Singh et al.~(2007), referred to as the enhanced mapper graph, and demonstrate that such a construction approximates the Reeb graph of $(\mathbb{X}, f)$ when it is applied to points randomly sampled from a probability density function concentrated on $(\mathbb{X}, f)$. Our techniques are based on the interleaving distance of constructible cosheaves and topological estimation via kernel density estimates. Following Munch and Wang (2018), we first show that the mapper graph of $(\mathbb{X}, f)$, a constructible $\mathbb{R}$-space (with a fixed open cover), approximates the Reeb graph of the same space. We then construct an isomorphism between the mapper of $(\mathbb{X},f)$ to the mapper of a super-level set of a probability density function concentrated on $(\mathbb{X}, f)$. Finally, building on the approach of Bobrowski et al.~(2017), we show that, with high probability, we can recover the mapper of the super-level set given a sufficiently large sample. Our work is the first to consider the mapper construction using the theory of cosheaves in a probabilistic setting. It is part of an ongoing effort to combine sheaf theory, probability, and statistics, to support topological data analysis with random data.

Elementary fuzzy Cellular Automata (CA) are known as continuous counterpart of elementary CA, which are 2-state CA, via the polynomial representation of local rules. In this paper, we first develop a new fuzzification methodology for $q$-state CA. It is based on the vector representation of $q$-state CA, that is, the $q$-states are assigned to the standard basis vectors of the $q$-dimensional real space and the local rule can be expressed by a tuple of $q$ polynomials. Then, the $q$-state vector-valued fuzzy CA are defined by expanding the set of the states to the convex hull of the standard basis vectors in the $q$-dimensional real space. The vector representation of states enables us to enumerate the number-conserving rules of 3-state vector-valued fuzzy CA in a systematic way.

There are many metrics available to compare phylogenetic trees since this is a fundamental task in computational biology. In this paper, we focus on one such metric, the $\ell^\infty$-cophenetic metric introduced by Cardona et al. This metric works by representing a phylogenetic tree with $n$ labeled leaves as a point in $\mathbb{R}^{n(n+1)/2}$ known as the cophenetic vector, then comparing the two resulting Euclidean points using the $\ell^\infty$ distance. Meanwhile, the interleaving distance is a formal categorical construction generalized from the definition of Chazal et al., originally introduced to compare persistence modules arising from the field of topological data analysis. We show that the $\ell^\infty$-cophenetic metric is an example of an interleaving distance. To do this, we define phylogenetic trees as a category of merge trees with some additional structure; namely labelings on the leaves plus a requirement that morphisms respect these labels. Then we can use the definition of a flow on this category to give an interleaving distance. Finally, we show that, because of the additional structure given by the categories defined, the map sending a labeled merge tree to the cophenetic vector is, in fact, an isometric embedding, thus proving that the $\ell^\infty$-cophenetic metric is, in fact, an interleaving distance.

Time dependence is a universal phenomenon in nature, and a variety of mathematical models in terms of dynamical systems have been developed to understand the time-dependent behavior of real-world problems. Originally constructed to analyze the topological persistence over spatial scales, persistent homology has rarely been devised for time evolution. We propose the use of a new filtration function for persistent homology which takes as input the adjacent oscillator trajectories of a dynamical system. We also regulate the dynamical system by a weighted graph Laplacian matrix derived from the network of interest, which embeds the topological connectivity of the network into the dynamical system. The resulting topological signatures, which we call evolutionary homology (EH) barcodes, reveal the topology-function relationship of the network and thus give rise to the quantitative analysis of nodal properties. The proposed EH is applied to protein residue networks for protein thermal fluctuation analysis, rendering the most accurate B-factor prediction of a set of 364 proteins. This work extends the utility of dynamical systems to the quantitative modeling and analysis of realistic physical systems.

We introduce the first unified theory for target tracking using Multiple Hypothesis Tracking, Topological Data Analysis, and machine learning. Our string of innovations are 1) robust topological features are used to encode behavioral information, 2) statistical models are fitted to distributions over these topological features, and 3) the target type classification methods of Wigren and Bar Shalom et al. are employed to exploit the resulting likelihoods for topological features inside of the tracking procedure. To demonstrate the efficacy of our approach, we test our procedure on synthetic vehicular data generated by the Simulation of Urban Mobility package.