Related papers: On semiring complexity of Schur polynomials
A packing function on a set Omega in R^n is a one-to-one correspondence between the set of lattice points in Omega and the set N_0 of nonnegative integers. It is proved that if r and s are relatively prime positive integers such that r…
For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…
The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
We explore "semibounded" expansions of arbitrary ordered groups; namely, expansions that do not define a field on the whole universe. We show that if $\mathcal R=\langle R, <, +, \dots\rangle$ is a semibounded o-minimal structure and…
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…
In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the…
The concept of integral as an inverse to that of derivation was already introduced for rings and recently also for lattices. Since semirings generalize both rings and bounded distributive lattices, it is natural to investigate integration…
The Krohn--Rhodes complexity of the Brauer semigroup $\mathfrak{B}_n$ and of the annular semigroup $\mathfrak{A}_n$ is computed.
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic programs or sets of rewriting rules over first-order terms.…
In this paper, we continue the enumeration of Schur rings over cyclic groups. Cyclic groups of semiprime order $pq$, where $p$ and $q$ are distinct primes, are considered. Additionally, cyclic groups of order $4p$ are considered.
In this paper we consider the relationship between monomial-size and bit-complexity in Sums-of-Squares (SOS) in Polynomial Calculus Resolution over rationals (PCR/$\mathbb{Q}$). We show that there is a set of polynomial constraints $Q_n$…
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…
The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…
We propose a new class of mathematical structures called (m,n)-semirings} (which generalize the usual semirings), and describe their basic properties. We also define partial ordering, and generalize the concepts of congruence, homomorphism,…
We consider the non-selfadjoint, semiclassical Schr\"odinger operator $\mathscr{L}(h) := -h^2\partial_x^2+e^{i\alpha}V$, where $\alpha \in (-\pi,\pi)$ and $V: \mathbb{R}\to \mathbb{R}_+$ is even and vanishes at exactly two (symmetric)…
An expression is given for the plethysm $p_{2}\circ S_{\square}$, where $p_{2}$ is the power sum of degree two and $S_{\square}$ is the Schur function indexed by a rectangular partition. The formula can be well understood from the viewpoint…
We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row, duplicating a column, or adding a zero row or column.…
For an arbitrary ring $R$, the largest strong left quotient ring $Q_l^s(R)$ of $R$ and the strong left localization radical $\glsR$ are introduced and their properties are studied in detail. In particular, it is proved that…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…