Related papers: On semiring complexity of Schur polynomials
Given two numerical semigroups $S$ and $T$ we say that $T$ is a multiple of $S$ if there exists an integer $d \in \mathbb{N} \setminus \{0\}$ such that $S = \{x \in \mathbb{N} \mid d x \in T\}$. In this paper we study the family of…
We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations…
Let $K$ be a field of characteristic two, and let $\lambda$ be a two-part partition of some natural number $r$. Denote the permutation module corresponding to the (maximal) Young subgroup $\Sigma_\lambda$ in $\Sigma_r$ by $M^\lambda$. We…
Quasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time, called…
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
We establish new results concerning endomorphisms of a finite chain if the cardinality of the image of such endomorphism is no more than some fixed number. The semiring of all such endomorphisms can be seen as a simplex whose vertices are…
We show that the action of classical operators associated to the Macdonald polynomials on the basis of Schur functions, S_{\lambda}[X(t-1)/(q-1)], can be reduced to addition in \lambda-rings. This provides explicit formulas for the…
The Krohn-Rhodes Theorem proves that a finite semigroup divides a wreath product of groups and aperiodic semigroups. Krohn-Rhodes complexity equals the minimal number of groups that are needed. Determining an algorithm to compute complexity…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
This paper proves a combinatorial rule giving all maximal and minimal partitions $\lambda$ such that the Schur function $s_\lambda$ appears in a plethysm of two arbitrary Schur functions. Determining the decomposition of these plethysms has…
Semiholomorphic polynomials are functions $f:\mathbb{C}^2\to\mathbb{C}$ that can be written as polynomials in complex variables $u$, $v$ and the complex conjugate $\overline{v}$. We prove the semiholomorphic analogoue of Akbulut's and…
We consider a type of divided symmetrization $\overrightarrow{D}_{\lambda,G}$ where $\lambda$ is a nonincreasing partition on $n$ and where $G$ is a graph. We discover that in the case where $\lambda$ is a hook shape partition with first…
We show factorization of polynomials in one variable over the tropical semiring is in general NP-complete, either if all coefficients are finite, or if all are either 0 or infinity (Boolean case). We give algorithms for the factorization…
The set of hook lengths of an integer partition $\lambda$ is the complement of some numerical semigroup $S$. There has been recent interest in studying the number of partitions with a given set of hook lengths. Very little is known about…
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…
We prove that the partition function associated to a perturbation of the semi-classical harmonic oscillator is the Borel sum of its semi-classical expansion.
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
We provide a complete solution to the problem of extending arbitrary semistar operations of an integral domain $D$ to semistar operations of the polynomial ring $D[X]$. As an application, we show that one can reobtain the main results of…