Related papers: On Kronecker's Solvability Theorem

These notes are an expanded version of a talk given by the second author. Our main interest is focused on the challenging problem of computing Kronecker coefficients. We decided, at the beginning, to take a very general approach to the…

In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…

We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…

In this paper we study a mixed problem for the nonlinear Schr\"odinger equation globally that have a nonlinear adding, in which the coefficient is a generalized function. Here is proved a global solvability theorem of the considered problem…

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

This is the final article in a series of four articles. Richard Karp has proven that a deterministic polynomial time solution to K-SAT will result in a deterministic polynomial time solution to all NP-Complete problems. However, it is…

It is argued that Goedel's incompleteness theorem should be seen as self-evident, rather than unexpected or surprising.

This paper proposes fast randomized algorithms for computing the Kronecker Tensor Decomposition (KTD). The proposed algorithms can decompose a given tensor into the KTD format much faster than the existing state-of-the-art algorithms. Our…

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

We present a new and direct proof of Grothendieck's generic freeness lemma in its general form. Unlike the previously published proofs, it does not proceed in a series of reduction steps and is fully constructive, not using the axiom of…

We prove that nonlinear Schr\"odinger equations on the circle, without external parameters, admits plenty of almost periodic solutions. Indeed, we prove that arbitrarily close to most of the finite dimensional KAM tori constructed by…

In this paper, we study the combinatorics of congruence subgroups of the modular group by generalizing results obtained in the non-modular case. For this, we define a notion of irreducible solutions from which we can build all the…

We present a simple alternative viewpoint on Hodge-Newton indecomposability, illustrating its explanatory value through a uniform proof of a combinatorial identity arising from affine Deligne-Lusztig varieties with finite Coxeter part.

Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…

A transformation method is applied to the second order ordinary differential equation satisfied by orthogonal polynomials to construct a family of exactly solvable quantum systems in any arbitrary dimensional space. Using the properties of…

We extend the famous diophantine Frobenius problem to the case of polynomials over a field $k$. Similar to the classical problem, we show that the $n=2$ case of the Frobenius problem for polynomials is easy to solve. In addition, we…

We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root…

A conjecture of Kac states that the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field with given dimension vector has positive coefficients and furthermore that its constant term is…

In a 1962 paper, Zariski introduced the decomposition theory that now bears his name. Although it arose in the context of algebraic geometry and deals with the configuration of curves on an algebraic surface, we have recently observed that…