Related papers: Numerical semigroups problem list

We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…

We determine the complete list of the gaps between successive elements of the multiplication table of the first N integers.

We study how certain invariants of numerical semigroups relate to the number of second kind gaps. Furthermore, given two fixed non-negative integers F and k, we provide an algorithm to compute all the numerical semigroups whose Frobenius…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…

We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.

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…

As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium--large (about a thousand digits) input data in a reasonably time cost on an ordinary computer.…

We begin the investigation of the variety of semilattices of Mal'cev blocks, which we call SMB algebras.

There are 123,650 partial groups of order at most 9 and 178,937,003 partial groups of order 10. We explain a computer enumeration of these results and provide a complete list of indecomposable partial groups of order at most 5. We also…

The structure of categorical at zero semigroups is studied from the point of view their likeness to categories.

We give a broad survey of recent results in Enumerative Combinatorics and their complexity aspects.

A new approach to classification of solvable spherical subgroups of semisimple algebraic groups is considered. This approach is completely different from the known approach by D. Luna and provides an explicit classification.

We discuss some challenging open problems in the geometric control theory and sub-Riemannian geometry.

A numerical set $T$ is a subset of $\mathbb N_0$ that contains $0$ and has finite complement. The atom monoid of $T$ is the set of $x \in \mathbb N_0$ such that $x+T \subseteq T$. Marzuola and Miller introduced the anti-atom problem: how…

A survey of problems, conjectures, and theorems about quasi-isometric classification and rigidity for finitely generated solvable groups.

This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Problems, which was…

We describe finite soluble groups in which every $n$-maximal subgroup is $\mathfrak F$-subnormal.

This paper presents an overview of the current state of knowledge in the field of equivariant map algebras and discusses some open problems in this area.

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…