Related papers: On semiring complexity of Schur polynomials

Let $R$ be a ring, $\CC_R$ and $\pCCR$ be the set of regular and left regular elements of $R$ ($\CC_R\subseteq \pCCR$). Goldie's Theorem is a semisimplicity criterion for the classical left quotient ring $Q_{l,cl}(R):=\CC_R^{-1}R$.…

We study equivariant modules over $GL(V)$ over the polynomial ring $R = Sym V$. We introduce for every partition $\lambda$ the elementary equivariant module $M_{\lambda}$. Then we prove that any finitely generated equivariant module admits…

We give a pattern-avoidance characterization of $w \in S_n$ such that the Schubert polynomial $\mathfrak{S}_w$ is a standard elementary monomial. This characterization tells us which quantum Schubert polynomials are easiest to compute. We…

We present pumping lemmas for five classes of functions definable by fragments of weighted automata over the min-plus semiring, the max-plus semiring and the semiring of natural numbers. As a corollary we show that the hierarchy of…

It is well known that the full matrix ring over a skew-field is a simple ring. We generalize this theorem to the case of semirings. We characterize the case when the matrix semiring $\mathbf{M}_n(S)$, of all $n\times n$ matrices over a…

We introduce the notion of a Schur-finite element in a $\lambda$-ring.

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

We determine the semisimplicity criterion for even partition algebras over the complex field. Specifically we prove that the even/2-tonal partition algebras $P_n^2(\delta)$ over $\mathbb{C}$ are semisimple for all $n$ if and only if…

We present two methods to algorithmically compute both least and greatest solutions of polynomial equation systems over absorptive semirings (with certain completeness and continuity assumptions), such as the tropical semiring. Both methods…

We propose semiringKanren, a relational programming language where each relation expression denotes a semiring array. We formalize a type system that restricts the arrays to finite size. We then define a semantics that is parameterized by…

We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to…

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 k. The semiring of all such endomorphisms can be seen as a k - simplex whose vertices…

We show that any $L^2$-bounded rational function in free semicircular random variables is a bounded operator, which implies the coincidence of the usual spectrum and $L^2$-spectrum for rational functions. Based on this observation, we also…

A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…

A ring $R$ is called right SSP (SIP) if the sum (intersection) of any two direct summands of $R_{R}$ is also a direct summand. Left sides can be defined similarly. The following are equivalent: (1) $R$ is right SSP. (2) $R$ is right C3 and…

Domain operations on semirings have been axiomatised in two different ways: by a map from an additively idempotent semiring into a boolean subalgebra of the semiring bounded by the additive and multiplicative unit of the semiring, or by an…

We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…

In this paper, we introduce and investigate \emph{semicorings} over associative semirings and their categories of \emph{semicomodules.} Our results generalize old and recent results on corings over rings and their categories of comodules.…

As basic elements of the quantum computer - quantum bits (qubits) we offer semiconductor quantum dots containing one electron each and consisting each of two tunnel-connected parts. The numerical solution of a Schroedinger equation with the…

The left quotient ring (i.e. the left classical ring of fractions) $Q_{cl}(R)$ of a ring $R$ does not always exist and still, in general, there is no good understanding of the reason why this happens. In this paper, it is proved existence…