Related papers: On Kronecker's Solvability Theorem

The famous van der Waerden theorem states that if partition N into finitely many cells then one of them will contain arbitrary length arithmetic progressions. It has a polynomial version also. In this article we will prove the near 0…

We provide a new simple and transparent proof of the version of Kummer's test given in [Tong, J. (1994). Amer. Math. Monthly. 101(5): 450--452]. Our proof is based on an application of a Hardy--Littlewood Tauberian theorem.

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

The author has previously shown that solvable Lie A-algebras and complemented solvable Lie algebras decompose as a vector space direct sum of abelian subalgebras, and their ideals relate nicely to this decomposition. However, neither of…

Using the classical Lazard's elimination theorem, we obtain a decomposition theorem for Lie algebras defined by generators and relations of a certain type. This is a preprint version of the paper appearing in Communications in Algebra…

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…

The analysis of many physical phenomena can be reduced to the study of solutions of differential equations with polynomial coefficients. In the present work, we establish the necessary and sufficient conditions for the existence of…

We prove that in the geometric complexity theory program the vanishing of rectangular Kronecker coefficients cannot be used to prove superpolynomial determinantal complexity lower bounds for the permanent polynomial. Moreover, we prove the…

In this note we point out the relation between Brion's formula for the lattice point generating function of a convex polytope in terms of the vertex cones [Brion1988] on the one hand, and the polar decomposition \`a la Lawrence/Varchenko…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

We prove that every 0/1-polytope has a unique Minkowski decomposition into indecomposable polytopes, up to translation of summands. The summands lie in pairwise orthogonal subspaces. Thus, every 0/1-polytope is the Cartesian product of…

Let $A$ be a finite-dimensional algebra over an algebraically closed field. The problem of constructing indecomposable $A$-modules inductively from simple ones by means of exact sequences - called accessibility - is the starting point of…

In the paper we analyse the exact solutions to scalar PDEs obtained thanks to summable Taylor series provided by Adomian's decomposition method. We propose the modification of the method which makes the calculations of Taylor coefficients…

A polynomial is a direct sum if it can be written as a sum of two non-zero polynomials in some distinct sets of variables, up to a linear change of variables. We analyze criteria for a homogeneous polynomial to be decomposable as a direct…

Although there are many simple proofs of Jordan's decomposition theorem in the literature (see [1], the references mentioned there, and [2]), our proof seems to be even more elementary. In fact, all we need is the theorem on the dimensions…

All groups are 2-generator. For any prime-power q, Theorem 1 constructs a solvable matrix group over a quotient of a Laurent polynomial ring. This group is closely related to a group of exponent q as shown in Theorems 2 & 3 . Theorem 4 in…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…