Related papers: Partial Matchings Induced by Morphisms between Per…
A trace $\tau$ on a separable C*-algebra $A$ is called matricial field (MF) if there is a trace-preserving morphism from $A$ to $Q_\omega$, where $Q_\omega$ denotes the norm ultrapower of the universal UHF-algebra $Q$. In general, the trace…
Let A be a finite-dimensional associative algebra and $\phi$ a symmetric linear function on $A$. In this note, we will show that the pseudotrace maps are obtained as special cases of well-known symmetric linear functions on the endomorphism…
We present a generalization of the induced matching theorem and use it to prove a generalization of the algebraic stability theorem for $\mathbb{R}$-indexed pointwise finite-dimensional persistence modules. Via numerous examples, we show…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
We demonstrate that any function $f$ from a finite set $Y$ to itself can be represented linearly. Specifically, we prove the existence of an injective map $j$ from $Y$ into a modular ring $\mathbb{Z}/m\mathbb{Z}$ and a constant $a \in…
Given a quiver associated to a cluster algebra and a sequence of vertices, iterative mutation leads to $F$-Polynomials which appear in numerous places in the cluster algebraic literature. The coefficients of the monomials in these…
Maxwell's equations are a system of partial differential equations that govern the laws of electromagnetic induction. We study a mimetic finite-difference (MFD) discretization of the equations which preserves important underlying physical…
In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.
We explore inflectional morphology as an example of the relationship of the discrete and the continuous in linguistics. The grammar requests a form of a lexeme by specifying a set of feature values, which corresponds to a corner M of a…
We construct (in significant generality) moduli spaces representing the functor of morphisms from a scheme into a solvable algebraic group.
For a poset P, a subposet A, and an order preserving map F from A into the real numbers, the marked order polytope parametrizes the order preserving extensions of F to P. We show that the function counting integral-valued extensions is a…
The theory of persistence modules is an emerging field of algebraic topology which originated in topological data analysis. In these notes we provide a concise introduction into this field and give an account on some of its interactions…
A partial field is an algebraic object that allows one to simultaneously abstract several different representability properties of matroids. In this paper we study partial fields as algebraic objects in their own right. We characterize the…
Algebraic persistence studies persistence modules (typically, linear representations of the poset $\mathbf{R}^n$ with $n \geq 1$) and the algebraic relationships between persistence modules that are interleaved. The notion of…
We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies of depth functions in linear and metric spaces, there is very little discussion on depth functions…
Generative models for sequential data often struggle with sparsely sampled and high-dimensional trajectories, typically reducing the learning of dynamics to pairwise transitions. We propose Interpolative Multi-Marginal Flow Matching…
Reconfigurable interaction induces another dimension of nondeterminism in concurrent systems which makes it hard to reason about the different choices of the system from a global perspective. Namely, (1) choices that correspond to…
We consider the approximation of the inverse of the finite element stiffness matrix in the data sparse $\mathcal{H}$-matrix format. For a large class of shape regular but possibly non-uniform meshes including graded meshes, we prove that…
The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…
In this paper we propose a new efficient interpolation tool, extremely suitable for large scattered data sets. The partition of unity method is used and performed by blending Radial Basis Functions (RBFs) as local approximants and using…