English
Related papers

Related papers: Matrix factorizations over elementary divisor doma…

200 papers

In general, representation rings are well-known as Green rings from module categories of Hopf algebras. In this paper, we study Green rings in the context of monoidal categories such that representations of Hopf algebras can be investigated…

Representation Theory · Mathematics 2014-06-30 Min Huang , Fang Li , Yichao Yang

This article provides some basic results on weight structures, weight complex functors and homotopy categories. We prove that the full subcategories K(A)^{w < n}, K(A)^{w > n}, K(A)^- and K(A)^+ (of objects isomorphic to suitably bounded…

Category Theory · Mathematics 2011-07-07 Olaf M. Schnürer

Let $C$ be a curve in $\mathbb{P}^4$ and $X$ be a hypersurface containing it. We show how it is possible to construct a matrix factorization on $X$ from the pair $(C,X)$ and, conversely, how a matrix factorization on $X$ leads to curves…

Algebraic Geometry · Mathematics 2019-04-09 Frank-Olaf Schreyer , Fabio Tanturri

Let $R=\bigoplus_{\alpha\in\Gamma}R_{\alpha}$ be a graded integral domain graded by an arbitrary grading torsionless monoid $\Gamma$, and $\star$ be a semistar operation on $R$. In this paper we define and study the graded integral domain…

Commutative Algebra · Mathematics 2014-12-12 Parviz Sahandi

The effectiveness of the aplication of constructions in $G$-graded $k$-categories to the computation of the fundamental group of a finite dimensional $k$-algebra, alongside with open problems still left untouched by those methods and new…

Rings and Algebras · Mathematics 2012-02-16 Edson R. Alvares , Marcelo M. S. Alves , Eliezer Batista

Matrix factorization is a simple and effective solution to the recommendation problem. It has been extensively employed in the industry and has attracted much attention from the academia. However, it is unclear what the low-dimensional…

Machine Learning · Computer Science 2018-08-29 Farhan Khawar , Nevin L. Zhang

We show that in certain Pr\"ufer domains, each nonzero ideal $I$ can be factored as $I=I^v \Pi$, where $I^v$ is the divisorial closure of $I$ and $\Pi$ is a product of maximal ideals. This is always possible when the Pr\"ufer domain is…

Commutative Algebra · Mathematics 2007-05-23 Marco Fontana , Evan Houston , Tom Lucas

Let $H$ be a multiplicatively written monoid with identity $1_H$ (in particular, a group). We denote by $\mathcal P_{\rm fin,\times}(H)$ the monoid obtained by endowing the collection of all finite subsets of $H$ containing a unit with the…

Rings and Algebras · Mathematics 2021-09-08 Austin A. Antoniou , Salvatore Tringali

We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…

Number Theory · Mathematics 2026-02-02 Hartosh Singh Bal , Gaurav Bhatnagar

In the realm of supercommutative superrings, this article investigates the unique factorization of elements. We build upon recent findings by Naser et. al. concerning similar results in noncommutative symmetric rings with zerodivisors,…

Rings and Algebras · Mathematics 2024-07-15 Pedro Rizzo , Joel Torres del Valle , Alexander Torres-Gomez

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

Commutative Algebra · Mathematics 2023-07-04 Scott T. Chapman , Harold Polo

For a finite quiver without sources or sinks, we prove that the homotopy category of acyclic complexes of injective modules over the corresponding finite dimensional algebra with radical square zero is triangle equivalent to the derived…

Representation Theory · Mathematics 2015-12-09 Xiao-Wu Chen , Dong Yang

Among the finitely generated modules over a Noetherian ring R, the semidualizing modules have been singled out due to their particularly nice duality properties. When R is a normal domain, we exhibit a natural inclusion of the set of…

Commutative Algebra · Mathematics 2007-05-23 Sean Sather-Wagstaff

Given a ring homomorphism $B \to A$, consider its centralizer $R = A^B$, bimodule endomorphism ring $S = \End {}_BA_B$ and sub-tensor-square ring $T = (A \o_B A)^B$. Nonassociative tensoring by the cyclic modules $R_T$ or ${}_SR$ leads to…

Rings and Algebras · Mathematics 2007-05-23 Lars Kadison

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative $n \times m$ matrix $M$ into a product of a nonnegative $n \times d$ matrix $W$ and a nonnegative $d \times m$ matrix $H$. A longstanding open…

Computational Complexity · Computer Science 2017-03-24 Dmitry Chistikov , Stefan Kiefer , Ines Marušić , Mahsa Shirmohammadi , James Worrell

We apply previous results on the representations of solvable linear algebraic groups to construct a new class of free divisors whose complements are $K(\pi, 1)$'s. These free divisors arise as the exceptional orbit varieties for a special…

Algebraic Topology · Mathematics 2013-10-31 James Damon , Brian Pike

We show that any homomorphism between Noetherian $F$-finite rings can be factored into a regular morphism between Noetherian $F$-finite rings followed by a surjection. This result establishes an analog of the 'smooth-by-surjective'…

Commutative Algebra · Mathematics 2025-01-17 Manuel Blickle , Daniel Fink

Nonnegative matrix factorization (NMF) is a linear dimensionality technique for nonnegative data with applications such as image analysis, text mining, audio source separation and hyperspectral unmixing. Given a data matrix $M$ and a…

Machine Learning · Computer Science 2021-04-14 Junjun Pan , Nicolas Gillis

Over an associative ring we consider a class $\mathbb{X}$ of left modules which is closed under set-indexed coproducts and direct summands. We investigate when the triangulated homotopy category $\mathsf{K}(\mathbb{X})$ is compactly…

Commutative Algebra · Mathematics 2007-05-23 Henrik Holm , Peter Jørgensen

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena
‹ Prev 1 8 9 10 Next ›