English
Related papers

Related papers: Counting numerical semigroups by genus and even ga…

200 papers

The domination number $\gamma(G)$ of a graph $G$, its exponential domination number $\gamma_e(G)$, and its porous exponential domination number $\gamma_e^*(G)$ satisfy $\gamma_e^*(G)\leq \gamma_e(G)\leq \gamma(G)$. We contribute results…

Combinatorics · Mathematics 2016-05-17 Michael A. Henning , Simon Jäger , Dieter Rautenbach

Term Coding asks: given a finite system of term identities $\Gamma$ in $v$ variables, how large can its solution set be on an $n$--element alphabet, when we are free to choose the interpretations of the function symbols? This turns familiar…

Information Theory · Computer Science 2026-01-26 Søren Riis

The fractional matching number of a graph G, is the maximum size of a fractional matching of G. The following sharp lower bounds for a graph G of order n are proved, and all extremal graphs are characterized in this paper. (1)The sum of the…

Combinatorics · Mathematics 2021-05-31 Ting Yang , Xiying Yuan

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…

Group Theory · Mathematics 2016-07-14 Ilya Gorshkov

Zeckendorf proved that any integer can be decomposed uniquely as a sum of non-adjacent Fibonacci numbers, $F_n$. Using continued fractions, Lekkerkerker proved the average number of summands of an $m \in [F_n, F_{n+1})$ is essentially…

Combinatorics · Mathematics 2014-02-27 Amanda Bower , Rachel Insoft , Shiyu Li , Steven J. Miller , Philip Tosteson

The aim of this work is to investigate the nonnegative signed domination number $\gamma^{NN}_s$ with emphasis on regular, ($r+1$)-clique-free graphs and trees. We give lower and upper bounds on $\gamma^{NN}_s$ for regular graphs and prove…

Combinatorics · Mathematics 2018-09-25 Doost Ali Mojdeh , Babak Samadi , Lutz Volkmann

We present two criteria for a group $G$ to satisfy the following statements: any $G$-graded gr-prime (gr-semiprime) right gr-Goldie ring admits a gr-semisimple graded right classical quotient ring. The criterion for gr-semiprime rings is…

Rings and Algebras · Mathematics 2016-06-23 Andrei L. Kanunnikov

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

Combinatorics · Mathematics 2025-11-19 Mariah Moschetti , Christopher O'Neill

For given positive integers $a_1,a_2,\dots,a_k$ with $\gcd(a_1,a_2,\dots,a_k)=1$, the denumerant $d(n)=d(n;a_1,a_2,\dots,a_k)$ is the number of nonnegative solutions $(x_1,x_2,\dots,x_k)$ of the linear equation $a_1 x_1+a_2 x_2+\dots+a_k…

Number Theory · Mathematics 2023-06-28 Takao Komatsu , Haotian Ying

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

The notion of formal Siegel modular forms for an arithmetic subgroup $\Gamma$ of the symplectic group of genus $n$ is a generalization of symmetric formal Fourier-Jacobi series. Assuming an upper bound on the affine covering number of the…

Number Theory · Mathematics 2024-07-09 Jan Hendrik Bruinier , Martin Raum

The covering number of a group $G$, denoted by $\sigma(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$…

Group Theory · Mathematics 2018-11-30 Martino Garonzi , Luise-Charlotte Kappe , Eric Swartz

We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…

Combinatorics · Mathematics 2019-12-25 Martin E. Malandro

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Group Theory · Mathematics 2026-02-02 Andrea Lucchini

This paper continues the study of two numbers that are associated with Lie groups. The first number is $N(G,m)$, the number of conjugacy classes of elements in $G$ whose order divides $m$. The second number is $N(G,m,s)$, the number of…

Combinatorics · Mathematics 2024-07-09 Tamar Friedmann , Qidong He

The Huneke-Wiegand conjecture is a decades-long open question in commutative algebra. Garc\'ia-S\'anchez and Leamer showed that a special case of this conjecture concerning numerical semigroup rings $\Bbbk[\Gamma]$ can be answered in the…

Commutative Algebra · Mathematics 2024-04-22 Miguel Landeros , Christopher O'Neill , Roberto Pelayo , Karina Peña , James Ren , Brian Wissman

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…

Commutative Algebra · Mathematics 2018-08-15 Claire Kiers , Christopher O'Neill , Vadim Ponomarenko

Let $G$ be the multiplicative group generated by the gamma functions $\Gamma(ax+1)$ $(a=1,2,\dots)$, and $H$ be the subgroup of all elements of $G$ that converge to nonzero constants as $x\rightarrow\infty$. The quotient group $G/H$ is the…

Group Theory · Mathematics 2013-11-26 Kazuto Asai

Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…

A numerical semigroup is a submonoid of $\mathbb N$ with finite complement in $\mathbb N$. A generalized numerical semigroup is a submonoid of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. In the context of numerical…

Combinatorics · Mathematics 2019-10-01 Carmelo Cisto , Michael DiPasquale , Gioia Failla , Zachary Flores , Chris Peterson , Rosanna Utano