English
Related papers

Related papers: Weak Factorization System for Actions of Po-monoid…

200 papers

A poset-stratified space is a pair $(S, S \xrightarrow \pi P)$ of a topological space $S$ and a continuous map $\pi: S \to P$ with a poset $P$ considered as a topological space with its associated Alexandroff topology. In this paper we show…

Algebraic Topology · Mathematics 2019-10-10 Toshihiro Yamaguchi , Shoji Yokura

We explain how any cofibrantly generated weak factorisation system on a category may be equipped with a universally and canonically determined choice of cofibrant replacement. We then apply this to the theory of weak omega-categories,…

Category Theory · Mathematics 2011-10-17 Richard Garner

We give an elementary construction of the exact completion of a weakly lex category for categories enriched in the cartesian closed category $\mathsf{Pos}$ of partially ordered sets. Paralleling the ordinary case, we characterize categories…

Category Theory · Mathematics 2025-12-16 Vasileios Aravantinos-Sotiropoulos

We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…

Combinatorics · Mathematics 2024-04-19 Vincent Pilaud , Nathan Reading , Sibylle Schroll

In this paper we investigate the concept of radical factorization with respect to finitary ideal systems of cancellative monoids. We present new characterizations for r-almost Dedekind r-SP-monoids and provide specific descriptions of…

Commutative Algebra · Mathematics 2019-06-25 Bruce Olberding , Andreas Reinhart

We study the problem of ranking with submodular valuations. An instance of this problem consists of a ground set $[m]$, and a collection of $n$ monotone submodular set functions $f^1, \ldots, f^n$, where each $f^i: 2^{[m]} \to R_+$. An…

Data Structures and Algorithms · Computer Science 2010-07-16 Yossi Azar , Iftah Gamzu

Using an action of the Richardson-Springer monoid on involutions, we study the weak order on the variety of complete quadrics. Maximal chains in the poset are explicitly determined. Applying results of Brion, our calculations describe…

Combinatorics · Mathematics 2012-03-09 Mahir Bilen Can , Michael Joyce

Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…

Machine Learning · Computer Science 2021-11-18 Léon Zheng , Elisa Riccietti , Rémi Gribonval

We prove a factorization formula for the point-to-point partition function associated with a model of directed polymers on the space-time lattice $\mathbb{Z}^{d+1}$, subject to an i.i.d. random potential and in the regime of weak disorder.…

Probability · Mathematics 2021-07-28 Tobias Hurth , Konstantin Khanin , Beatriz Navarro Lameda , Fedor Nazarov

Weakly supervised object localization (WSOL) aims to localize objects by only utilizing image-level labels. Class activation maps (CAMs) are the commonly used features to achieve WSOL. However, previous CAM-based methods did not take full…

Computer Vision and Pattern Recognition · Computer Science 2021-08-03 Jun Wei , Qin Wang , Zhen Li , Sheng Wang , S. Kevin Zhou , Shuguang Cui

The weak-map order on the matroid base polytopes is the partial order defined by inclusion. Lucas proved that the base polytope of no binary matroid includes the base polytope of a connected matroid. A matroid base polytope is said to be…

Combinatorics · Mathematics 2012-03-26 Kenji Kashiwabara

Let $\mathcal H$ be a reproducing kernel Hilbert space with a normalized complete Nevanlinna-Pick (CNP) kernel. We prove that if $(f_n)$ is a sequence of functions in $\mathcal H$ with $\sum\|f_n\|^2<\infty$, then there exists a contractive…

Functional Analysis · Mathematics 2018-11-28 Michael T. Jury , Robert T. W. Martin

A positive monoid is a submonoid of the nonnegative cone of a linearly ordered abelian group. The positive monoids of rank $1$ are called Puiseux monoids, and their atomicity, arithmetic of length, and factorization have been systematically…

Commutative Algebra · Mathematics 2025-05-06 Scott. T. Chapman , Felix Gotti , Marly Gotti , Harold Polo

Let $G$ be a finite group and $H$ be a subgroup of $G$. Then $H$ is called a weakly $S\Phi$-supplemented subgroup of $G$, if there exists a subgroup $T$ of $G$ such that $G =HT$ and $H \cap T \leq \Phi (H) H_{sG}$, where $H_{sG}$ denotes…

Group Theory · Mathematics 2024-07-29 Shengmin Zhang , Zhencai Shen

This article develops the theory of fusion categories acting on algebras. We will demonstrate that weak Hopf algebra actions on algebras correspond to specific actions of fusion categories. As an application of this theory, we introduce a…

Quantum Algebra · Mathematics 2025-10-09 Alexander Betz

We prove a weak factorization result on birational maps of Deligne-Mumford stacks, and deduce the following: Let $U \subset X$ be an open embedding of smooth Deligne-Mumford stacks such that $D = X-U$ is a normal crossings divisor, then the…

Algebraic Geometry · Mathematics 2017-06-27 Alicia Harper

We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

Extriangulated categories, introduced by Nakaoka and Palu, serve as a simultaneous generalization of exact and triangulated categories. In this paper, we first introduce the concept of admissible weak factorization systems and establish a…

Category Theory · Mathematics 2024-08-28 Yajun Ma , Hanyang You , Dongdong Zhang , Panyue Zhou

The small object argument is a transfinite construction which, starting from a set of maps in a category, generates a weak factorisation system on that category. As useful as it is, the small object argument has some problematic aspects: it…

Category Theory · Mathematics 2011-10-17 Richard Garner

Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…

Numerical Analysis · Computer Science 2016-09-19 Saskia Metzler , Pauli Miettinen
‹ Prev 1 8 9 10 Next ›