Related papers: A short proof of solution formulas for the linear …
By making use of a recently developed method to solve linear differential equations of arbitrary order, we find a wide class of polynomial solutions to the Heun equation. We construct the series solution to the Heun equation before…
The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…
We present a new, short proof of the increased regularity obtained by solutions to uniformly parabolic partial differential equations. Though this setting is fairly introductory, our new method of proof, which uses a priori estimates, can…
Explicit solutions of differential equations of complex fractional orders with respect to functions and with continuous variable coefficients are established. The representations of solutions are given in terms of some convergent infinite…
We study the problem of solvability of linear differential systems with small coefficients in the Liouvillian sense (or, by generalized quadratures). For a general system, this problem is equivalent to that of solvability of the Lie algebra…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We develop a Galois theory for systems of linear difference equations with periodic parameters, for which we also introduce linear difference algebraic groups. We then apply this to constructively test if solutions of linear q-difference…
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
We present a simple proof of the well-known fact concerning the number of solutions of diagonal equations over finite fields. In a similar manner, we give an alternative proof of the recent result on generalizations of Carlitz equations. In…
Let $K$ be an algebraically closed field with an absolute value. This note gives an elementary proof of the classical result that the roots of a polynomial with coefficients in $K$ are continuous functions of the coefficients of the…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…
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…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
We use Newton's method to find all roots of several polynomials in one complex variable of degree up to and exceeding one million and show that the method, applied to appropriately chosen starting points, can be turned into an algorithm…
For a polynomial $f$ from a class $\mathcal{C}$ of polynomials, we show that the problem to compute all the constant degree irreducible factors of $f$ reduces in polynomial time to polynomial identity tests (PIT) for class $\mathcal{C}$ and…
Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…
We consider existence and stability of an almost periodic solution of the quasilinear system of differential equations with piecewise constant argument of generalized type. The associated linear homogeneous system satisfies exponential…
We establish necessary and sufficient conditions for an arbitrary polynomial of degree $n$, especially with only real roots, to be trivial, i.e. to have the form a(x-b)^n. To do this, we derive new properties of polynomials and their roots.…