English
Related papers

Related papers: On numerical semigroups with at most 12 left eleme…

200 papers

A family of sets F is said to be union-closed if A \cup B is in F for every A and B in F. Frankl's conjecture states that given any finite union-closed family of sets, not all empty, there exists an element contained in at least half of the…

Combinatorics · Mathematics 2007-05-23 Robert Morris

Let $N$ be a finite set and $\mathcal{F}$, an intersection-closed family of subsets. Frankl conjectured that there always exists an element in $N$ which is contained in at most half the number of sets in $\mathcal{F}$ unless $\mathcal{F}…

Combinatorics · Mathematics 2025-01-08 Rainer Schrader

Let $W$ be a finite reflection group, either real or complex, and $S_\ell$ a Sylow $\ell$-subgroup of $W$. We prove the existence of a semidirect product decomposition of $N_W(S_\ell)$ in terms of the unique parabolic subgroup of $W$…

Group Theory · Mathematics 2024-09-09 Kane Douglas Townsend

Let $\Gamma\subset \bar{\mathbb{Q}}^*$ be a finitely generated subgroup. Denote by $\Gamma_\mathrm{div}$ its division group. A recent conjecture due to R\'emond, related to the Zilber-Pink conjecture, predicts that the absolute logarithmic…

Number Theory · Mathematics 2023-02-13 Arnaud Plessis

Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…

Group Theory · Mathematics 2015-10-20 Attila Nagy

We consider the finite W-superalgebras for a basic classical Lie superalgebra g associated with an even nilpotent element in g both over the field of complex numbers field and and over a filed of positive characteristic. We present the PBW…

Representation Theory · Mathematics 2014-05-13 Yang Zeng , Bin Shu

Given a semigroup $S$ and an $n$-partition $\mathcal{P}$ of $S$, $n\in \mathbb{N}$, do there exist $A\in \mathcal{P}$ and a subset $F$ of $S$ such that $S=F ^{-1} \{x \in S: x A \bigcap A\neq\emptyset\}$ and $|F |\leq n$? We give an…

Combinatorics · Mathematics 2015-08-31 Igor Protasov , Ksenia Protasova

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_lg)$ where $g\in G$ and $n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…

Number Theory · Mathematics 2014-01-31 Caixia Shen , Li-meng Xia

In this paper we formulate a conjecture about the minimal dimensional representations of the finite $W$-superalgebra $U(\mathfrak{g}_\bbc,e)$ over the field of complex numbers and demonstrate it with examples including all the cases of type…

Representation Theory · Mathematics 2014-12-23 Yang Zeng , Bin Shu

Let $\mathcal{C}$ be a positive integer cone and $k\in \mathcal{C}$. A $\mathcal{C}$-semigroup $S$ is $k$-positioned if for every $h\in \mathcal{C}\setminus S$ we have that $k-h$ belongs to $S$. In this work, we focus on this family of…

Combinatorics · Mathematics 2026-01-28 Carmelo Cisto , Raquel Tapia-Ramos

Given a numerical semigroup $S = < a_1, a_2,..., a_t>$ and $s\in S$, we consider the factorization $s = c_1 a_1 + c_2 a_2 +... + c_t a_t$ where $c_i\ge0$. Such a factorization is {\em maximal} if $c_1+c_2+...+c_t$ is a maximum over all such…

Commutative Algebra · Mathematics 2014-07-15 Lance Bryant , James Hamblin , Lenny Jones

Let $r,k,\ell$ be integers such that $0\le\ell\le\binom{k}{r}$. Given a large $r$-uniform hypergraph $G$, we consider the fraction of $k$-vertex subsets which span exactly $\ell$ edges. If $\ell$ is 0 or $\binom{k}{r}$, this fraction can be…

Combinatorics · Mathematics 2025-08-22 Vishesh Jain , Matthew Kwan , Dhruv Mubayi , Tuan Tran

Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…

Rings and Algebras · Mathematics 2022-05-04 Victoria Gould , Georgia Schneider

The delta set of a numerical semigroup $S$, denoted $\Delta(S)$, is a factorization invariant that measures the complexity of the sets of lengths of elements in $S$. We study the following problem: Which finite sets occur as the delta set…

Commutative Algebra · Mathematics 2022-01-25 Stefan Colton , Nathan Kaplan

A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…

Combinatorics · Mathematics 2020-09-15 Matthew Guhl , Jazmine Juarez , Vadim Ponomarenko , Rebecca Rechkin , Deepesh Singhal

For a positive integer $s$, a lattice $L$ is said to be $s$-integrable if $\sqrt{s}\cdot L$ is isometric to a sublattice of $\mathbb{Z}^n$ for some integer $n$. Conway and Sloane found two minimal non $2$-integrable lattices of rank $12$…

Number Theory · Mathematics 2021-04-12 Qianqian Yang , Kiyoto Yoshino

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

In this paper we present and study the numerical duplication of a numerical semigroup, a construction that, starting with a numerical semigroup $S$ and a semigroup ideal $E\subseteq S$, produces a new numerical semigroup, denoted by…

Commutative Algebra · Mathematics 2012-11-16 Marco D'Anna , Francesco Strazzanti

It is known that every countable semigroup admits a weight w for which the semigroup algebra l_1(S,w) is Arens regular and no uncountable group admits such a weight; see [4]. In this paper, among other things, we show that for a large class…

Functional Analysis · Mathematics 2015-01-27 B. Khodsiani , A. Rejali , H. R. Ebrahimi Vishki

A set S of vertices in a graph G is a dominating set of G if every vertex not in S is adjacent to a vertex in S . The domination number of G, denoted by $\gamma$(G), is the minimum cardinality of a dominating set in G. In a breakthrough…

Discrete Mathematics · Computer Science 2024-10-07 Paul Dorbec , Michael Antony Henning
‹ Prev 1 3 4 5 6 7 10 Next ›