English
Related papers

Related papers: Group lifting structures for multirate filter bank…

200 papers

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),…

Numerical Analysis · Mathematics 2019-10-14 Pramod Kaushik Mudrakarta , Shubhendu Trivedi , Risi Kondor

We present a model for exact recursive Bayesian filtering based on lifted multiset states. Combining multisets with lifting makes it possible to simultaneously exploit multiple strategies for reducing inference complexity when compared to…

Artificial Intelligence · Computer Science 2018-05-08 Stefan Lüdtke , Max Schröder , Sebastian Bader , Kristian Kersting , Thomas Kirste

Given an isolated, quasi-homogeneous singularity $X$ we prove that there is a group isomorphism between the group of rank one reflexive sheaves on $X$ and the free abelian group generated by $\mathbb{C}^*$-divisors, modulo linear…

Algebraic Geometry · Mathematics 2023-01-13 Ananyo Dan , Agustín Romano-Velázquez

For an Abelian group $G$, any homomorphism $\mu\colon G\otimes G\rightarrow G$ is called a \textsf{multiplication} on $G$. The set $\text{Mult}\,G$ of all multiplications on an Abelian group $G$ itself is an Abelian group with respect to…

Group Theory · Mathematics 2022-05-24 Ekaterina Kompantseva , Askar Tuganbaev

When Fourier series are employed to solve partial differential equations, low-pass filters can be used to regularize divergent series that may appear. In this paper we show that the linear low-pass filters defined in a previous paper can be…

Complex Variables · Mathematics 2015-03-25 Jorge L. deLyra

Let $\varphi\colon\Gamma\to G$ be a homomorphism of groups. We consider factorizations $\Gamma\xrightarrow{f} M\xrightarrow{g} G$ of $\varphi$ such that either $g$ or $f$ are universal normal maps (namely, crossed modules). These two…

Group Theory · Mathematics 2014-11-04 Emmanuel D. Farjoun , Yoav Segev

We describe an equivalent formulation of algebraic weak factorisation systems, not involving monads and comonads, but involving double categories of morphisms equipped with a lifting operation satisfying lifting and factorisation axioms.

Category Theory · Mathematics 2022-12-16 John Bourke

We study the injectivity of the matrix attenuated and nonabelian ray transforms on compact surfaces with boundary for nontrapping $\lambda$-geodesic flows and the general linear group of invertible complex matrices. We generalize the loop…

Differential Geometry · Mathematics 2024-12-31 Shubham R. Jathar , Manas Kar , Jesse Railo

A formalism for electronic-structure calculations is presented that is based on the functional renormalization group (FRG). The traditional FRG has been formulated for systems that exhibit a translational symmetry with an associated Fermi…

Materials Science · Physics 2016-10-12 Christian Seiler , Ferdinand Evers

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

Algebraic Geometry · Mathematics 2024-06-18 Trevor Jones

We construct a lift of the degree filtration on the integer valued polynomials to (even MU-based) synthetic spectra. Namely, we construct a bialgebra in modules over the evenly filtered sphere spectrum which base-changes to the degree…

Algebraic Geometry · Mathematics 2025-06-24 Alice Hedenlund , Tasos Moulinos

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…

Machine Learning · Computer Science 2017-07-28 Sanjar Karaev , Pauli Miettinen

Factorization of matrices of Laurent polynomials plays an important role in mathematics and engineering such as wavelet frame construction and filter bank design. Wavelet frames (a.k.a. framelets) are useful in applications such as signal…

Classical Analysis and ODEs · Mathematics 2021-12-03 Chenzhe Diao , Bin Han , Ran Lu

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A,B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an explicit formula for $B$. We use this approach to give an…

Group Theory · Mathematics 2024-11-26 Donald L. Kreher , William J. Martin , Douglas R. Stinson

We study the non-uniqueness of factorizations of non zero-divisors into atoms (irreducibles) in noncommutative rings. To do so, we extend concepts from the commutative theory of non-unique factorizations to a noncommutative setting. Several…

Rings and Algebras · Mathematics 2015-09-03 Nicholas R. Baeth , Daniel Smertnig

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…

Machine Learning · Computer Science 2023-11-07 Mengyuan Zhang , Kai Liu

Given an element $f$ in a regular local ring, we study matrix factorizations of $f$ with $d \ge 2$ factors, that is, we study tuples of square matrices $(\varphi_1,\varphi_2,\dots,\varphi_d)$ such that their product is $f$ times an identity…

Commutative Algebra · Mathematics 2021-02-16 Tim Tribone

Factorization of quantum mechanical potentials has a long history extending back to the earliest days of the subject. In the present paper, the non-uniqueness of the factorization is exploited to derive new isospectral non-singular…

Quantum Physics · Physics 2010-11-09 Micheal S. Berger , Nail S. Ussembayev

An algorithm is presented allowing the construction of fast Fourier transforms for any solvable group on a classical computer. The special structure of the recursion formula being the core of this algorithm makes it a good starting point to…

Quantum Physics · Physics 2023-11-27 Markus Pueschel , Martin Roetteler , Thomas Beth