Related papers: On semiring complexity of Schur polynomials
In this paper, we study the computational complexity of the commutative determinant polynomial computed by a class of set-multilinear circuits which we call regular set-multilinear circuits. Regular set-multilinear circuits are commutative…
Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition \lambda, we denote by…
Generally, in any human field, a Smarandache Structure on a set A means a weak structure W on A such that there exists a proper subset B which is embedded with a stronger structure S. By proper subset one understands a set included in A,…
The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…
The plethysm coefficient $p(\nu, \mu, \lambda)$ is the multiplicity of the Schur function $s_\lambda$ in the plethysm product $s_\nu \circ s_\mu$. In this paper we use Schur--Weyl duality between wreath products of symmetric groups and the…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
Schur-Szego composition of polynomials of degree N introduces an interesting semigroup structure on polynomial spaces. In this note we show how it interacts with the stratification of polynomials according to the multiplicity of their zeros…
We generalize the idea of a Schur ring of a group to the category of semigroups. Fundamental results of Schur rings over groups are shown to be true for Schur rings over semigroups. Examples where Schur rings differ between the two…
The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…
Let \lambda be a partition of a positive integer n. Let C be a symmetric rigid tensor category over a field k of characteristic 0 or char(k)>n, and let V be an object of C. In our main result (Theorem 4.3) we introduce a finite set of…
In this article we study operators with a dimension $\Delta\sim O(N)$ and show that simple analytic expressions for the action of the dilatation operator can be found. The operators we consider are restricted Schur polynomials. There are…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
The polynomial ring $B$ in infinitely many indeterminates $(x_1,x_2,\ldots)$, with rational coefficients, has a vector space basis of Schur polynomials, parametrized by partitions. The goal of this note is to provide an explanation of the…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…
Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…
A semi-projective representation is a homomorphism of a finite group into the group of semi-projective transformations of a finite dimensional vector space over a field. Schur's concept of a representation group for projective…