English
Related papers

Related papers: Atomicity and Factorization of Puiseux Monoids

200 papers

We consider the family of polynomials $f_{d,c}(x)=x^d+c$ over the rational field $\Q$. Fixing integers $d, n\ge 2$, we show that the density of primes that can appear as primitive prime divisors of $f_{d,c}^n(0)$ for some $c\in\Q$ is…

Number Theory · Mathematics 2022-10-17 Mohammad Sadek , Mohamed Wafik

In this paper, we introduce the notions of quasi-triangular and factorizable Poisson bialgebras. A factorizable Poisson bialgebra induces a factorization of the underlying Poisson algebra. We prove that the Drinfeld classical double of a…

Rings and Algebras · Mathematics 2026-05-27 Yuanchang Lin , Dilei Lu

As is known to all, Hopf-Galois objects have a significant research value for analyzing tensor categories of comodules and classification questions of pointed Hopf algebras, and are natural generalizations of Hopf algebras with a…

Quantum Algebra · Mathematics 2020-05-28 Huihui Zheng , Liangyun Zhang

Over the last decades, two distinct approaches have been instrumental to our understanding of the computational complexity of statistical estimation. The statistical physics literature predicts algorithmic hardness through local stability…

Statistics Theory · Mathematics 2026-03-23 Konstantinos Tsirkas , Leda Wang , Ilias Zadik

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

Rings and Algebras · Mathematics 2018-08-09 Konrad Schrempf

We present a systematic effective method to construct coarse fundamental domains for the action of the Picard modular groups $PU(2,1,\mathcal{O}_d)$ where $\mathcal{O}_d$ has class number one, i.e. $d=1,2,3,7,11,19,43,67,163$. The…

Algebraic Geometry · Mathematics 2022-11-22 Martin Deraux , Mengmeng Xu

Let $S$ be a numerical monoid, i.e., a submonoid of the additive monoid $(\mathbb N, +)$ of non-negative integers such that $\mathbb N \setminus S$ is finite. Endowed with the operation of set addition, the family of all finite subsets of…

Combinatorics · Mathematics 2025-04-04 Salvatore Tringali , Weihao Yan

We give a conceptual treatment of the notion of joints, marginals, and independence in the setting of categorical probability. This is achieved by endowing the usual probability monads (like the Giry monad) with a monoidal and an opmonoidal…

Probability · Mathematics 2020-02-03 Tobias Fritz , Paolo Perrone

Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an…

Rings and Algebras · Mathematics 2024-11-11 Laura Cossu , Salvatore Tringali

We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…

Commutative Algebra · Mathematics 2023-11-29 Daniel Windisch

In this article we study modules endowed with a ultrametric, from the point of view of the geometric notion $C$-minimality. We give a complete characterization of $C$-minimal valued modules over non-commutative rings of skew polynomials of…

Logic · Mathematics 2019-03-15 Gönenç Onay

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

Commutative Algebra · Mathematics 2019-02-04 Michel Hickel , Mickaël Matusinski

We initiate the study of a large class of species monoids and comonoids which come equipped with a poset structure that is compatible with the multiplication and comultiplication maps. We show that if a monoid and a comonoid are related…

Combinatorics · Mathematics 2020-09-18 Mario Sanchez

Generalizing the notion of a multiplicative inequality among minors of a totally positive matrix, we describe, over full rank cluster algebras of finite type, the cone of Laurent monomials in cluster variables that are bounded as a…

Combinatorics · Mathematics 2024-09-11 Michael Gekhtman , Zachary Greenberg , Daniel Soskin

The aim of this paper is to solve a problem proposed by Dominique Bourn: to provide a categorical-algebraic characterisation of groups amongst monoids and of rings amongst semirings. In the case of monoids, our solution is given by the…

Category Theory · Mathematics 2017-11-17 Andrea Montoli , Diana Rodelo , Tim Van der Linden

We prove that every free group of finite rank can be realized as the fundamental group of a planar Rauzy fractal associated with a 4-letter unimodular cubic Pisot substitution. This characterizes all countable fundamental groups for planar…

Dynamical Systems · Mathematics 2016-03-11 Timo Jolivet , Benoît Loridant , Jun Luo

In this article, we are interested in the enumeration of Fully Packed Loops configurations on a grid with a given noncrossing matching. These quantities also appear as the groundstate components of the Completely Packed Loops model as…

Combinatorics · Mathematics 2013-05-27 Tiago Fonseca

We investigate the monoid of transformations that are induced by sequences of writing to and reading from a queue storage. We describe this monoid by means of a confluent and terminating semi-Thue system and study some of its basic…

Formal Languages and Automata Theory · Computer Science 2014-04-23 Martin Huschenbett , Dietrich Kuske , Georg Zetzsche

We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z <A>, with S = S_0 + S_1,…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Clelia De Felice