English
Related papers

Related papers: Graver bases of shifted numerical semigroups with …

200 papers

We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…

Combinatorics · Mathematics 2018-03-20 P. A. García-Sánchez , D. Marín-Aragón , A. M. Robles-Pérez

The $k$th power of a graph $G$, denoted $G^k$, has the same vertex set as $G$, and two vertices are adjacent in $G^k$ if and only if there exists a path between them in $G$ of length at most $k$. A $K_r$-factor in a graph is a spanning…

Combinatorics · Mathematics 2022-11-29 Ajit Diwan , Aniruddha Joshi

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

Group Theory · Mathematics 2016-07-14 Michael Giudici , Luke Morgan

We introduce the \emph{Generalized Latin Square Graph} $\Gamma(S)$ of a finite semigroup $S$. Since we record global factorization multiplicities and local alternative counts, we define three counting invariants $N_S,N_R,N_C$. This gives…

Combinatorics · Mathematics 2026-01-01 Mohammad Reza Sorouhesh , Mayam Golriz , Bozorg Panbehkar

A foundation model like GPT elicits many emergent abilities, owing to the pre-training with broad inclusion of data and the use of the powerful Transformer architecture. While foundation models in natural languages are prevalent, can we…

Machine Learning · Computer Science 2025-06-18 Ziyuan Tang , Jie Chen

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

Combinatorics · Mathematics 2007-05-23 Edwin O'Shea

Let S be a semigroup and let T be a subsemigroup of S. Then T acts on S by left- and by right multiplication. This gives rise to a partition of the complement of T in S, and to each equivalence class of this partition we naturally associate…

Group Theory · Mathematics 2009-12-08 Alan J. Cain , Robert Gray , Nik Ruskuc

The domination multisubdivision number of a nonempty graph $G$ was defined as the minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to increase the domination number of $G$. Similarly we define…

Combinatorics · Mathematics 2013-09-30 Diana Avella-Alaminos , Magda Dettlaff , Magdalena Lemańska , Rita Zuazua

Let $G$ be the automorphism group of an extension $F|k$ of algebraically closed fields of characteristic zero and of transcendence degree $n$, $1\le n\le\infty$. In this paper we (i) construct some maximal closed non-open subgroups $G_v$,…

Representation Theory · Mathematics 2009-04-07 M. Rovinsky

Modular graph forms (MGFs) are a class of non-holomorphic modular forms which naturally appear in the low-energy expansion of closed-string genus-one amplitudes and have generated considerable interest from pure mathematicians. MGFs satisfy…

High Energy Physics - Theory · Physics 2021-05-26 Jan E. Gerken

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

Combinatorics · Mathematics 2020-08-17 Alex Schaefer , Eric Swartz

Let $G$ be a commutative algebraic group embedded in projective space and $\Gamma$ a finitely generated subgroup of $G$. From these data we construct a chain of algebraic subgroups of $G$ which is intimately related to obstructions to…

Number Theory · Mathematics 2012-09-12 Stéphane Fischler , Michael Nakamaye

Let $S,T$ be two numerical semigroups. We study when $S$ is one half of $T$, with $T$ almost symmetric. If we assume that the type of $T$, $t(T)$, is odd, then for any $S$ there exist infinitely many such $T$ and we prove that $1 \leq t(T)…

Commutative Algebra · Mathematics 2014-04-22 Francesco Strazzanti

A numerical semigroup is a co-finite submonoid of the monoid of non-negative integers under addition. Many properties of numerical semigroups rely on some fundamental invariants, such as, among others, the set of gaps (and its cardinality),…

Discrete Mathematics · Computer Science 2025-05-30 Massimo Bartoletti , Stefano Bonzio , Marco Ferrara

Let $G$ be a group. The subsets $A_1,\ldots,A_k$ of $G$ form a complete factorization of group $G$ if if they are pairwise disjoint and each element $g\in G$ is uniquely represented as $g=a_1\ldots a_k$, with $a_i\in A_i$. We prove the…

Group Theory · Mathematics 2024-02-26 Mikhail Kabenyuk

Suppose that R is an ordered ring, G_n(R) is a subsemigroup of $GL_n(R)$, consisting of all matrices with nonnegative elements. A.V. Mikhalev and M.A. Shatalova described all automorphisms of G_n(R), where R is a linearly ordered skewfield…

Rings and Algebras · Mathematics 2007-11-06 E. I. Bunina , P. P. Semenov

A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…

Combinatorics · Mathematics 2018-07-09 C. R. Donoven , J. D. Mitchell , W. A. Wilson

We introduce the semiring of values $\Gamma$ with respect to the tropical operations associated to an algebroid curve. As a set, $\Gamma$ determines and is determined by the well known semigroup of values $S$ and we prove that $\Gamma$ is…

Algebraic Geometry · Mathematics 2018-02-22 Emilio Carvalho , Marcelo Escudeiro Hernandes

For numerical semigroups with a specified list of (not necessarily minimal) generators, we obtain explicit asymptotic expressions, and in some cases quasipolynomial/quasirational representations, for all major factorization length…

Combinatorics · Mathematics 2021-02-05 Stephan Ramon Garcia , Mohamed Omar , Christopher O'Neill , Samuel Yih

We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…

Combinatorics · Mathematics 2024-07-23 Arsh Chhabra , Stephan Ramon Garcia , Christopher O'Neill