Related papers: On minimal presentations of numerical monoids
In this paper, we consider the following question: "given the multiplicity $m$ and embedding dimension $e$ of a numerical semigroup $S$, what can be said about the cardinality $\eta$ of a minimal presentation of $S$?" We approach this…
We introduce and study blob and framed blob monoids. In particular, several realizations of these monoids are given. We compute the cardinality of the framed blob monoid and derive some combinatorial formulas involving this cardinality.
In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…
We study the problem of finding a maximum cardinality minimal separator of a graph. This problem is known to be NP-hard even for bipartite graphs. In this paper, we strengthen this hardness by showing that for planar bipartite graphs, the…
The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…
We describe the resolution of singularities of a threefold which has minimal Picard number. We describe the relation between this minimal resolution and an arbitrary resolution of singularities.
A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…
We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…
A solution is given to the following problem: how to compute the multiplicity, or more generally the Hilbert function, at a point on a Schubert variety in an orthogonal Grassmannian. Standard monomial theory is applied to translate the…
The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…
We give conditions for determining the extremal behavior for the (graded) Betti numbers of squarefree monomial ideals. For the case of non-unique minima, we give several conditions which we use to produce infinite families, exponentially…
In this survey article we revisit Hilbert's $19^{\text{th}}$ problem concerning the regularity of minimizers of variational integrals. We first discuss the classical theory (that is, the statement and resolution of Hilbert's problem in all…
This paper presents two enumeration techniques based on Hilbert functions. The paper illustrates these techniques by solving two chessboard problems.
We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.
We develop general methods to obtain fast (polynomial time) estimates of the cardinality of a combinatorially defined set via solving some randomly generated optimization problems on the set. Geometrically, we estimate the cardinality of a…
We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…
A memory-efficient framework is described for the cardinality-constrained structured data-fitting problem. Dual-based atom-identification rules are proposed that reveal the structure of the optimal primal solution from near-optimal dual…
We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2)…
This preprint is dedicated to a self contained simple proof of the classical criteria for representability of algebraic functions of several complex variables by radicals. It also contains a criteria for representability of algebroidal…
We survey optimization problems that involve the cardinality of variable vectors in constraints or the objective function. We provide a unified viewpoint on the general problem classes and models, and give concrete examples from diverse…