Related papers: Partial Matchings Induced by Morphisms between Per…
We derive exact form of the piecewise-linear finite element stiffness matrix on general non-uniform meshes for the integral fractional Laplacian operator in one dimension, where the derivation is accomplished in the Fourier transformed…
Considering Schur positivity of differences of plethysms of homogeneous symmetric functions, we introduce a new relation on integer partitions. This relation is conjectured to be a partial order, with its restriction to one part partitions…
We incorporate clockwork mechanism into the Standard Model flavour sector and show that the observed pattern of fermion masses and mixing can be obtained without any unnaturally small or large parameter in the fundamental theory. By…
Linear mixed effects models (LMMs) are a popular and powerful tool for analyzing clustered or repeated observations for numeric outcomes. LMMs consist of a fixed and a random component, specified in the model through their respective design…
This work introduces a new method for selecting the number of components in finite mixture models (FMMs) using variational Bayes, inspired by the large-sample properties of the Evidence Lower Bound (ELBO) derived from mean-field (MF)…
In order to better understand and to compare interleavings between persistence modules, we elaborate on the algebraic structure of interleavings in general settings. In particular, we provide a representation-theoretic framework for…
We introduce a new general purpose multiresolution preconditioner for symmetric linear systems. Most existing multiresolution preconditioners use some standard wavelet basis that relies on knowledge of the geometry of the underlying domain.…
An element of the algebra $M_n(\mathbb{F})$ of $n \times n$ matrices over a field $\mathbb{F}$ is called an involution if its square equals the identity matrix. Gustafson, Halmos, and Radjavi proved that any product of involutions in…
Matrix factorization (MF) is a versatile learning method that has found wide applications in various data-driven disciplines. Still, many MF algorithms do not adequately scale with the size of available datasets and/or lack…
In this work we investigate how to extract alternating time bounds from 'focussed' proof systems. Our main result is the obtention of fragments of MALLw (MALL with weakening) complete for each level of the polynomial hierarchy. In one…
In the present work, the notion of Super Fractal Interpolation Function (SFIF) is introduced for finer simulation of the objects of the nature or outcomes of scientific experiments that reveal one or more structures embedded in to another.…
This paper presents language techniques for applying memoization selectively. The techniques provide programmer control over equality, space usage, and identification of precise dependences so that memoization can be applied according to…
Multiresolution Matrix Factorization (MMF) was recently introduced as an alternative to the dominant low-rank paradigm in order to capture structure in matrices at multiple different scales. Using ideas from multiresolution analysis (MRA),…
In this paper we show how to approximate ("learn") a function f, where X and Y are metric spaces.
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
Let $\mathbb{F}$ be a field and $f : \mathfrak{S}_n \rightarrow \mathbb{F} \setminus \{0\}$ be an arbitrary map. The Schur matrix functional associated to $f$ is defined as $M \in \text{M}_n(\mathbb{F}) \mapsto…
A widely used approach to compute the action $f(A)v$ of a matrix function $f(A)$ on a vector $v$ is to use a rational approximation $r$ for $f$ and compute $r(A)v$ instead. If $r$ is not computed adaptively as in rational Krylov methods,…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
The concept of matchings originated in group theory to address a linear algebra problem related to canonical forms for symmetric tensors. In an abelian group $(G,+)$, a matching is a bijection $f: A \to B$ between two finite subsets $A$ and…