English
Related papers

Related papers: The Honest Embedding Dimension of a Numerical Semi…

200 papers

Denote by $\mathrm m(S)$ the multiplicity of a numerical semigroup $S$. A covariety is a nonempty family $\mathscr{C}$ of numerical semigroups that fulfills the following conditions: there is the minimum of $\mathscr{C},$ the intersection…

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

We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…

Rings and Algebras · Mathematics 2019-09-24 Miguel Couceiro , Jimmy Devillet

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least nonnegative integer $n$ such that $G$ embeds in the symmetric group $\Sym(n)$. We prove that if $H$ is a group then $\mu(G)=\mu(G\times H)$ for some group…

Group Theory · Mathematics 2017-01-23 David Easdown , Michael Hendriksen , Neil Saunders

We develop a geometric procedure for finding the Ap\'ery set of any numerical semigroup with embedding dimension four. Previous methods of comparable strength worked only for embedding dimension three or under very specific conditions. We…

Number Theory · Mathematics 2026-05-27 Kazimierz Chomicz

In this paper, we prove that the numerical-semigroup-gap counting problem is #NP-complete as a main theorem. A numerical semigroup is an additive semigroup over the set of all nonnegative integers. A gap of a numerical semigroup is defined…

Computational Complexity · Computer Science 2017-01-05 Shunichi Matsubara

The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…

Probability · Mathematics 2016-12-02 G. Budzban , Ph. Feinsilver

Given a semianalytic set S in a complex space and a point p in S, there is a unique smallest complex-analytic germ at p which contains the germ of S, called the holomorphic closure of S at p. We show that if S is semialgebraic then its…

Complex Variables · Mathematics 2017-09-29 Janusz Adamus , Serge Randriambololona

A numerical semigroup $S$ is a subset of the non-negative integers containing $0$ that is closed under addition. The Hilbert series of $S$ (a formal power series equal to the sum of terms $t^n$ over all $n \in S$) can be expressed as a…

Commutative Algebra · Mathematics 2019-03-26 Jeske Glenn , Christopher O'Neill , Vadim Ponomarenko , Benjamin Sepanski

A closed algebraic embedding of $\mathbb{C}^*=\mathbb{C}^1\setminus\{0\}$ into $\mathbb{C}^2$ is 'sporadic' if for every curve $A\subseteq \mathbb{C}^2$ isomorphic to an affine line the intersection with $\mathbb{C}^*$ is at least $2$.…

Algebraic Geometry · Mathematics 2019-04-30 Mariusz Koras , Karol Palka , Peter Russell

Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Known results easily imply polynomiality of EMBED(k,2) (k=1,2;…

Computational Geometry · Computer Science 2009-04-22 Jiří Matoušek , Martin Tancer , Uli Wagner

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Number Theory · Mathematics 2012-11-06 Maria Bras-Amorós , Pedro A. García-Sánchez , Albert Vico-Oton

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

Optimization and Control · Mathematics 2022-09-08 Dogyoon Song , Pablo A. Parrilo

Let A,B be finite dimensional G-graded algebras over an algebraically closed field K with char(K)=0, where G is an abelian group, and let Id_G(A) be the set of graded identities of A (res. Id_G(B)). We show that if A,B are G-simple then…

Rings and Algebras · Mathematics 2012-12-04 Ofir David

In the past few years, the study of receptive field codes has been of large interest to mathematicians. Here we give a complete characterization of receptive field codes realizable by connected receptive fields and we give the minimal…

Combinatorics · Mathematics 2020-11-30 Raffaella Mulas , Ngoc M Tran

Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…

Combinatorics · Mathematics 2019-12-05 Carmelo Cisto , Gioia Failla , Chris Peterson , Rosanna Utano

In this paper, we carry out a fairly comprehensive study of two special classes of numerical semigroups, one generated by the sequence of partial sums of an arithmetic progression and the other one generated by the partial sums of a…

Commutative Algebra · Mathematics 2021-04-26 Sudip Pandit , Joydip Saha , Indranath Sengupta

The representation dimension of a finite group $G$ is the minimal dimension of a faithful complex linear representation of $G$. We prove that the representation dimension of any finite group $G$ is at most $\sqrt{|G|}$ except if $G$ is a…

Group Theory · Mathematics 2026-02-18 Alexander Moretó

The aim of this manuscript is to give some basic notions related to numerical semigroups, and from these on the one hand describe a classical application to the study of singularities of plane algebraic curves, and on the other, show how…

Algebraic Geometry · Mathematics 2014-11-25 Abdallah Assi , Pedro A. García-Sánchez

The algebraic degree $Deg(G)$ of a graph $G$ is the dimension of the splitting field of the adjacency polynomial of $G$ over the field $\mathbb{Q}$. It can be shown that for every positive integer $d$, there exists a circulant graph with…

Combinatorics · Mathematics 2025-07-24 Sauvik Poddar , Angsuman Das

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

Combinatorics · Mathematics 2014-01-14 Rajneesh Hegde , Robin Thomas
‹ Prev 1 3 4 5 6 7 10 Next ›