1,592 research outputs found
Basic Module Theory over Non-Commutative Rings with Computational Aspects of Operator Algebras
The present text surveys some relevant situations and results where basic
Module Theory interacts with computational aspects of operator algebras. We
tried to keep a balance between constructive and algebraic aspects.Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be
published in Lecture Notes in Computer Scienc
Near-optimal Bootstrapping of Hitting Sets for Algebraic Models
The classical lemma of Ore-DeMillo-Lipton-Schwartz-Zippel
[Ore22,DL78,Zip79,Sch80] states that any nonzero polynomial of degree at most will evaluate to a nonzero value at some point on a
grid with . Thus, there is an explicit
hitting set for all -variate degree , size algebraic circuits of size
.
In this paper, we prove the following results:
- Let be a constant. For a sufficiently large constant and
all , if we have an explicit hitting set of size
for the class of -variate degree polynomials that are computable by
algebraic circuits of size , then for all , we have an explicit hitting
set of size for -variate circuits of
degree and size . That is, if we can obtain a barely non-trivial
exponent compared to the trivial sized hitting set even for
constant variate circuits, we can get an almost complete derandomization of
PIT.
- The above result holds when "circuits" are replaced by "formulas" or
"algebraic branching programs".
This extends a recent surprising result of Agrawal, Ghosh and Saxena [AGS18]
who proved the same conclusion for the class of algebraic circuits, if the
hypothesis provided a hitting set of size at most
(where is any constant). Hence, our work significantly weakens the
hypothesis of Agrawal, Ghosh and Saxena to only require a slightly non-trivial
saving over the trivial hitting set, and also presents the first such result
for algebraic branching programs and formulas.Comment: The main result has been strengthened significantly, compared to the
older version of the paper. Additionally, the stronger theorem now holds even
for subclasses of algebraic circuits, such as algebraic formulas and
algebraic branching program
Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra
We present algorithms to factorize weighted homogeneous elements in the first
polynomial Weyl algebra and -Weyl algebra, which are both viewed as a
-graded rings. We show, that factorization of homogeneous
polynomials can be almost completely reduced to commutative univariate
factorization over the same base field with some additional uncomplicated
combinatorial steps. This allows to deduce the complexity of our algorithms in
detail. Furthermore, we will show for homogeneous polynomials that
irreducibility in the polynomial first Weyl algebra also implies irreducibility
in the rational one, which is of interest for practical reasons. We report on
our implementation in the computer algebra system \textsc{Singular}. It
outperforms for homogeneous polynomials currently available implementations
dealing with factorization in the first Weyl algebra both in speed and elegancy
of the results.Comment: 26 pages, Singular implementation, 2 algorithms, 1 figure, 2 table
Survey on counting special types of polynomials
Most integers are composite and most univariate polynomials over a finite
field are reducible. The Prime Number Theorem and a classical result of
Gau{\ss} count the remaining ones, approximately and exactly.
For polynomials in two or more variables, the situation changes dramatically.
Most multivariate polynomials are irreducible. This survey presents counting
results for some special classes of multivariate polynomials over a finite
field, namely the the reducible ones, the s-powerful ones (divisible by the
s-th power of a nonconstant polynomial), the relatively irreducible ones
(irreducible but reducible over an extension field), the decomposable ones, and
also for reducible space curves. These come as exact formulas and as
approximations with relative errors that essentially decrease exponentially in
the input size.
Furthermore, a univariate polynomial f is decomposable if f = g o h for some
nonlinear polynomials g and h. It is intuitively clear that the decomposable
polynomials form a small minority among all polynomials. The tame case, where
the characteristic p of Fq does not divide n = deg f, is fairly
well-understood, and we obtain closely matching upper and lower bounds on the
number of decomposable polynomials. In the wild case, where p does divide n,
the bounds are less satisfactory, in particular when p is the smallest prime
divisor of n and divides n exactly twice. The crux of the matter is to count
the number of collisions, where essentially different (g, h) yield the same f.
We present a classification of all collisions at degree n = p^2 which yields an
exact count of those decomposable polynomials.Comment: to appear in Jaime Gutierrez, Josef Schicho & Martin Weimann
(editors), Computer Algebra and Polynomials, Lecture Notes in Computer
Scienc
- …