English
Related papers

Related papers: A note-question on partitions of semigroups

200 papers

In this work we will show that if $F$ is a positive integer, then the set ${\mathrm{Arf}}(F)=\{S\mid S \mbox{ is an Arf numerical semigroup with Frobenius number } F\}$ verifies the following conditions: 1) $\Delta(F)=\{0,F+1,\rightarrow\}$…

Commutative Algebra · Mathematics 2023-03-23 M. A. Moreno-Frías , J. C. Rosales

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$, $G$ a finite group and $\sigma (G) =\{\sigma_{i} |\sigma_{i}\cap \pi (G)\ne \emptyset \}$. A set ${\cal H}$ of subgroups of $G$ is said to be a…

Group Theory · Mathematics 2016-09-29 Wenbin Guo , Alexander N. Skiba

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…

Combinatorics · Mathematics 2020-08-20 Deepesh Singhal

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

Computational Complexity · Computer Science 2018-04-17 Lukas Fleischer

Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…

Combinatorics · Mathematics 2013-10-07 Oriol Serra , Gilles Zémor

Let $S$ be a semigroup and $\mathbb F$ be a field. For an ideal $J$ of the semigroup algebra ${\mathbb F}[S]$ of $S$ over $\mathbb F$, let $\varrho _J$ denote the restriction (to $S$) of the congruence on ${\mathbb F}[S]$ defined by the…

Rings and Algebras · Mathematics 2015-11-30 Attila Nagy , Márton Zubor

Let $G$ be a finite group and $\sigma=\{\sigma_{i}|i\in I\}$ be a partition of the set of all primes $\mathbb{P}$, that is, $\mathbb{P}=\bigcup_{i\in I}\sigma_{i}$ and $\sigma_{i}\cap \sigma_{j}=\emptyset$ for all $i\neq j$. A chief factor…

Group Theory · Mathematics 2021-04-20 Zhenfeng Wu , Chi Zhang

We study the structure of nilpotent subsemigroups in the semigroup $M(n,\mathbb{F})$ of all $n\times n$ matrices over a field, $\mathbb{F}$, with respect to the operation of the usual matrix multiplication. We describe the maximal…

Group Theory · Mathematics 2010-04-02 Ganna Kudryavtseva , Volodymyr Mazorchuk

The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…

Combinatorics · Mathematics 2026-04-29 Nathan Kaplan , Kaylee Kim , Cole McGeorge , Fabian Ramirez , Deepesh Singhal

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

Commutative Algebra · Mathematics 2017-10-11 J. I. García-García , D. Marín-Aragón , M. A. Moreno-Frías , J. C. Rosales , A. Vigneron-Tenorio

Let $H$ be a subgroup of a finite group $G$. We say that $H$ satisfies partial $\Pi$-property in $G$ if there exists a chief series $\mathit{\Gamma}_G:1=G_0<G_1<\cdots<G_n=G$ of $G$ such that for every $G$-chief factor $G_i/G_{i-1}$ ($1\leq…

Group Theory · Mathematics 2014-11-05 Xiaoyu Chen , Wenbin Guo

In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…

Quantum Physics · Physics 2019-01-23 Qian Lilong , Chu Delin

We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…

Combinatorics · Mathematics 2018-06-07 Joshua Culver , Andreas Weingartner

We provide a new way to represent numerical semigroups by showing that the position of every Ap\'ery set of a numerical semigroup $S$ in the enumeration of the elements of $S$ is unique, and that $S$ can be re-constructed from this…

Commutative Algebra · Mathematics 2014-07-16 Lance Bryant , James Hamblin

From any poset isomorphic to the poset of gaps of a numerical semigroup $S$ with the order induced by $S$, one can recover $S$. As an application, we prove that two different numerical semigroups cannot have isomorphic posets (with respect…

Commutative Algebra · Mathematics 2024-04-08 Pedro A. Garcia-Sanchez

Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…

Algebraic Geometry · Mathematics 2012-09-17 Massimo Ferrarotti , Elisabetta Fortuna , Leslie Wilson

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Group Theory · Mathematics 2019-06-18 Stefanos Aivazidis , Thomas W. Müller

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

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Combinatorics · Mathematics 2007-11-07 Jean-Christophe Aval
‹ Prev 1 3 4 5 6 7 10 Next ›