Related papers: On Kronecker's Solvability Theorem
We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…
A novel tensor-based formula for solving the linear systems involving Kronecker sum is proposed. Such systems are directly related to the matrix and tensor forms of Sylvester equation. The new tensor-based formula demonstrates the…
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a…
We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…
In this note we present an algorithm to generate new Schr\" odinger type equations explicitly solvable in terms of orthogonal polynomials or associated special functions.
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We describe a simple polynomial-time algorithm for the CDT problem that relies on a construction of Barvinok.
Szmytkowski derived a certain integral with Gegenbauer polynomials. A natural generalization is to derive lookalike integrals with Jacobi polynomials. Six methods are treated to derive the first integral. The first method should be enough…
We provide counter-examples to Mulmuley's strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…
Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…
We generalize the logarithmic decomposition theorem of Deligne-Illusie to a filtered version. There are two applications. The easier one provides a mod $p$ proof for a vanishing theorem in characteristic zero. The deeper one gives rise to a…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
The Weitzenboeck theorem states that the algebra of constants of a linear locally nilpotent derivation of the polynomial algebra K[Z]=K[z_1,...,z_m] in m variables over a field K of characteristic 0 is finitely generated. If m=2n and the…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
One construction of exactly-solvable potentials for Fokker-Planck equation is considered based on supersymmetric quantum mechanics approach.
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
We characterize the generating series of extended period polynomials of normalized Hecke eigenforms for $\operatorname{PSL}_2(\mathbb Z)$ studied by Zagier in terms of the period relations and existence of a suitable factorization. For this…