Related papers: On minimal presentations of numerical monoids
The Hadwiger number of a graph G is the largest integer h such that G has the complete graph K_h as a minor. We show that the problem of determining the Hadwiger number of a graph is NP-hard on co-bipartite graphs, but can be solved in…
In the classical probability model, let $f(n)$ be the maximum number of pairwise independent events for the sample space with $n$ sample points. The determination of $f(n)$ is equivalent to the problem of determining the maximum cardinality…
We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…
In this article, we study properties as simplicity, solvability and nilpotency for Lie bracket algebras arising from Leavitt path algebras, based on the talented monoid of the underlying graph. We show that graded simplicity and simplicity…
Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…
The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but…
Using Macaulay's correspondence we study the family of Artinian Gorenstein local algebras with fixed symmetric Hilbert function decomposition. As an application we give a new lower bound for cactus varieties of the third Veronese embedding.…
We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…
We study the submodular secretary problem with a cardinality constraint. In this problem, $n$ candidates for secretaries appear sequentially in random order. At the arrival of each candidate, a decision maker must irrevocably decide whether…
We obtain several presentations by generators and relations for the rook partition monoids and algebras, as well as their singular ideals. Among other results, we also calculate the minimal sizes of generating sets (some of our…
We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…
Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows…
Motivated by finding an effective way to compute the algebraic complexity of the nearest point problem for algebraic models, we introduce an efficient method for detecting the limit points of the stratified Morse trajectories in a small…
In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…
We give the definition of presentations of linear monoidal categories. Our main result is that given a presentation of a linear monoidal category, we can produce a presentation of the same category as a linear category. We apply this result…
In this note we find optimal one-sided majorants of exponential type for the signum function subject to certain monotonicity conditions. As an application, we use these special functions to obtain a simple Fourier analysis proof of the…
The resolvent degree $\textrm{rd}_{\mathbb{C}}(n)$ is the smallest integer $d$ such that a root of the general polynomial $$f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$$ can be expressed as a composition of algebraic functions in at most $d$…
The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…