English
Related papers

Related papers: Factorizations of $k$-Nonnegative Matrices

200 papers

We prove that, in any field of characteristic not two and not three except the five-element field, each element decomposes into a product of four factors whose sum vanishes. We also find all $k,n,q$ such that every $n\times n$ matrix over…

Rings and Algebras · Mathematics 2017-04-25 Anton A. Klyachko , Andrey M. Mazhuga , Anastasia N. Ponfilenko

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Group Theory · Mathematics 2026-03-10 Alfred Geroldinger , Zachary Mesyan

A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most…

Rings and Algebras · Mathematics 2026-01-13 Jason P. Bell , Ken Brown , Zahra Nazemian , Daniel Smertnig

We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…

Combinatorics · Mathematics 2007-05-23 I. P. Goulden , D. M. Jackson

We introduce a real-parameter refinement of the classical integer hierarchies underlying Schmidt number, block-positivity, and $k$-positivity for maps between matrix algebras. Starting from a compact family of $\alpha$-admissible unit…

Functional Analysis · Mathematics 2026-02-16 Mohsen Kian

This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.

Group Theory · Mathematics 2021-08-03 Cai Heng Li , Lei Wang , Binzhou Xia

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…

Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…

Combinatorics · Mathematics 2015-12-02 Gregory Berkolaiko , John Irving

Thin sums matroids were introduced to extend the notion of representability to non-finitary matroids. We give a new criterion for testing when the thin sums construction gives a matroid. We show that thin sums matroids over thin families…

Combinatorics · Mathematics 2012-04-30 Hadi Afzali , Nathan Bowler

We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…

Algebraic Geometry · Mathematics 2026-05-05 Alessandro Lehmann , Nicolò Sibilla

In [11] we showed that a loop in a simply connected compact Lie group $\dot{U}$ has a unique Birkhoff (or triangular) factorization if and only if the loop has a unique root subgroup factorization (relative to a choice of a reduced sequence…

Representation Theory · Mathematics 2017-07-05 Arlo Caine , Doug Pickrell

In this paper we will give a similar factorization as in \cite{4}, \cite{5}, where the autors Svrtan and Meljanac examined certain matrix factorizations on Fock-like representation of a multiparametric quon algebra on the free associative…

Rings and Algebras · Mathematics 2015-04-13 Milena Sosic

We say that a square real matrix $M$ is \emph{off-diagonal nonnegative} if and only if all entries outside its diagonal are nonnegative real numbers. In this note we show that for any off-diagonal nonnegative symmetric matrix $M$, there…

Data Structures and Algorithms · Computer Science 2021-03-02 Sergio Mercado , Marcos Villagra

The theory of quantum symmetric pairs provides a universal K-matrix which is an analogue of the universal R-matrix for quantum groups. The main ingredient in the construction of the universal K-matrix is a quasi K-matrix which has so far…

Quantum Algebra · Mathematics 2018-04-10 Liam Dobson , Stefan Kolb

We consider a type III subfactor $N\subset M$ of finite index with a finite system of braided $N$-$N$ morphisms which includes the irreducible constituents of the dual canonical endomorphism. We apply $\alpha$-induction and, developing…

Operator Algebras · Mathematics 2009-10-31 J. Böckenhauer , D. E. Evans , Y. Kawahigashi

In this paper we compute the generating function of modular, $k$-noncrossing diagrams. A $k$-noncrossing diagram is called modular if it does not contains any isolated arcs and any arc has length at least four. Modular diagrams represent…

Combinatorics · Mathematics 2019-10-15 Christian M. Reidys , Rita R. Wang , Y. Y. Zhao

It is a challenging open problem to construct an explicit 1-factorization of the bipartite Kneser graph $H(v,t)$, which contains as vertices all $t$-element and $(v-t)$-element subsets of $[v]:=\{1,\ldots,v\}$ and an edge between any two…

Discrete Mathematics · Computer Science 2019-04-04 Kai Jin

We investigate some weighted integer partitions whose generating functions are double-series. We will establish closed formulas for these $q$-double series and deduce that their coefficients are non-negative. This leads to inequalities…

Number Theory · Mathematics 2025-07-15 George E. Andrews , Mohamed El Bachraoui

A 1-factorization $\mathcal{M} = \{M_1,M_2,\ldots,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i, M_j$ with $i \ne j$ is a Hamilton cycle. It is called $k$-semi-perfect if the union of any pair of…

Combinatorics · Mathematics 2020-08-28 Natalie C. Behague

To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…

Combinatorics · Mathematics 2013-03-12 Ravindra Bapat , Ebrahim Ghorbani
‹ Prev 1 8 9 10 Next ›