English
Related papers

Related papers: Extremal factorization lengths of elements in comm…

200 papers

We construct equivalences among four notions associated to a reductive group scheme $G$: factorization super central extensions of the loop group of $G$ by $\mathbb G_m$ subject to a condition on the commutator, factorization super line…

Algebraic Geometry · Mathematics 2025-02-14 Yifei Zhao

Let $H$ be a Krull monoid with finite class group $G$ and suppose that every class contains a prime divisor. If an element $a \in H$ has a factorization $a=u_1 \cdot \ldots \cdot u_k$ into irreducible elements $u_1, \ldots, u_k \in H$, then…

Number Theory · Mathematics 2019-07-09 Alfred Geroldinger , Qinghai Zhong

In this paper we prove that the subalgebras of cocommutative elements in the quantized coordinate rings of $M_{n}$, $GL_{n}$ and $SL_{n}$ are the centralizers of the trace $x_{1,1}+\dots+x_{n,n}$ in each algebra, for…

Rings and Algebras · Mathematics 2015-12-15 Szabolcs Mészáros

We prove that any weak* continuous semigroup $(T_t)_{t \geq 0}$ of factorizable Markov maps acting on a von Neumann algebra $M$ equipped with a normal faithful state can be dilated by a group of Markov $*$-automorphisms analogous to the…

Operator Algebras · Mathematics 2018-12-04 Cédric Arhancet

We study the properties of groups that have presentations in which the square of each generator gives the identity and all relations are of even length. We consider the parabolic subgroups of such a group and show that every element has a…

Group Theory · Mathematics 2021-07-23 Isobel Webster

Let $M$ be a commutative cancellative monoid. The set $\Delta(M)$, which consists of all positive integers which are distances between consecutive factorization lengths of elements in $M$, is a widely studied object in the theory of…

Commutative Algebra · Mathematics 2016-09-12 Scott T. Chapman , Felix Gotti , Roberto Pelayo

For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization…

Combinatorics · Mathematics 2020-10-02 Stephan Ramon Garcia , Mohamed Omar , Christopher O'Neill , Timothy Wesley

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

Group Theory · Mathematics 2015-03-09 Martino Garonzi , Dan Levy , Attila Maróti , Iulian I. Simion

Let $H$ be a multiplicatively written monoid. Given $k\in{\bf N}^+$, we denote by $\mathscr U_k$ the set of all $\ell\in{\bf N}^+$ such that $a_1\cdots a_k=b_1\cdots b_\ell$ for some atoms $a_1,\ldots,a_k,b_1,\ldots,b_\ell\in H$. The sets…

Number Theory · Mathematics 2019-12-13 Salvatore Tringali

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

Rings and Algebras · Mathematics 2024-08-19 Salvatore Tringali

The aim of this article is to study the ideal class monoid $\mathcal{C}\ell(S)$ of a numerical semigroup $S$ introduced by V. Barucci and F. Khouja. We prove new bounds on the cardinality of $\mathcal{C}\ell(S)$. We observe that…

Commutative Algebra · Mathematics 2023-02-23 Laura Casabella , Marco D'Anna , Pedro A. García-Sánchez

For a commutative cancellative monoid $M$, we introduce the notion of the length density of both a nonunit $x\in M$, denoted $\mathrm{LD}(x)$, and the entire monoid $M$, denoted $\mathrm{LD}(M)$. This invariant is related to three widely…

Commutative Algebra · Mathematics 2020-08-18 Scott T. Chapman , Christopher O'Neill , Vadim Ponomarenko

A numerical semigroup is a cofinite subset of $\mathbb Z_{\ge 0}$ containing $0$ and closed under addition. Each numerical semigroup $S$ with smallest positive element $m$ corresponds to an integer point in the Kunz cone $\mathcal C_m…

Combinatorics · Mathematics 2025-02-26 Cole Brower , Joseph McDonough , Christopher O'Neill

Most factorization invariants in the literature extract extremal factorization behavior, such as the maximum and minimum factorization lengths. Invariants of intermediate size, such as the mean, median, and mode factorization lengths are…

Commutative Algebra · Mathematics 2021-02-05 Stephan Ramon Garcia , Christopher O'Neill , Samuel Yih

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…

Combinatorics · Mathematics 2021-08-16 Stephan Ramon Garcia , Christopher O'Neill , Gabe Udell

We determine subnormalisers of semisimple elements of prime power order in finite quasi-simple groups of Lie type. For this, we determine the maximal overgroups of normalisers of Sylow tori. This is motivated by the recent character…

Group Theory · Mathematics 2025-12-02 Gunter Malle

A problem by Feichtinger, Heil, and Larson asks whether every infinite matrix $A$ with $\sum_{k,l}|A_{kl}| < \infty$ (an equivalent substitute for the Feichtinger algebra) that is positive-semidefinite admits a symmetric rank-one…

Functional Analysis · Mathematics 2026-05-11 Radu Balan , Fushuai Jiang

Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…

Combinatorics · Mathematics 2023-05-02 Khalid Ajran , Felix Gotti

We study the decomposition matrices for the unipotent $\ell$-blocks of finite special unitary groups SU$_n(q)$ for unitary primes $\ell$ larger than $n$. Up to very few unknown entries, we give a complete solution for $n=2,\ldots,10$. We…

Representation Theory · Mathematics 2015-06-12 Olivier Dudas , Gunter Malle

We consider the problem of summarizing a multi set of elements in $\{1, 2, \ldots , n\}$ under the constraint that no element appears more than $\ell$ times. The goal is then to answer \emph{rank} queries --- given $i\in\{1, 2, \ldots ,…

Data Structures and Algorithms · Computer Science 2017-04-26 Ran Ben Basat