Related papers: On semiring complexity of Schur polynomials
A semibrick is a set of modules satisfying Schur's Lemma, and it is said to be maximal if it is not properly contained in another semibrick. For any finite dimensional algebra $\varLambda$ over an algebracally closed field $K$, we prove…
The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…
We study the expressivity and computational aspects of first-order logic and its extensions in the semiring semantics developed by Gr\"adel and Tannen. We characterize the complexity of model checking and data complexity of first-order…
The computational complexity of the circuit evaluation problem for finite semirings is considered, where semirings are not assumed to have an additive or multiplicative identity. The following dichotomy is shown: If a finite semiring is…
A generalization of Selberg's beta integral involving Schur polynomials associated with partitions with entries not greater than 2 is explicitly computed. The complex version of this integral is given after proving a general statement…
A semilinear relation is a finite union of finite intersections of open and closed half-spaces over, for instance, the reals, the rationals, or the integers. Semilinear relations have been studied in connection with algebraic geometry,…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
We consider the problem of embedding the semi-ring of Schur-positive symmetric polynomials into its analogue for the classical types $B/C/D$. If we preserve highest weights and add the additional Lie-theoretic parity assumption that the…
Classical approach of solvability problem has shed much light on what we can solve and what we cannot solve mathematically. Starting with quadratic equation, we know that we can solve it by the quadratic formula which uses square root.…
Arithmetic circuit complexity studies the complexity of computing polynomials using only arithmetic operations such as addition, multiplication, subtraction, and division. Polynomials over rings of integers model counting problems.…
In our previous work, motivated by the study of tropical polynomials, a definition for prime congruences was given for an arbitrary commutative semiring. It was shown that for additively idempotent semirings this class exhibits some…
Let $s_\nu \circ s_\mu$ denote the plethystic product of the Schur functions $s_\nu$ and $s_\mu$. In this article we define an explicit polynomial representation corresponding to $s_\nu \circ s_\mu$ with basis indexed by certain…
We prove that a local ring $R$ of embedding codepth at most 3 has at most two semidualizing complexes up to shift-isomorphism, namely, $R$ itself and a dualizing $R$-complex if one exists.
Let $k$ and $m$ be positive integers and $\lambda/\mu$ a skew partition. We compute the principal specialization of the skew Schur polynomials $s_{\lambda /\mu}(x_1, \ldots, x_{k})$ modulo $q^m-1$ under suitable conditions. We interpret the…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
A semiring can be ``completed'' (i.e., embedded into a semiring in which all infinite sums are defined and satisfy some reasonable properties) iff this semiring can be naturally partially ordered. This construction is ``natural'' (a left…
Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…
The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their…
Schur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of Symmetric functions, in Representation theory [Sta99], in Schubert…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.