Related papers: Some results on integer solutions of quadratic pol…
The purpose of this paper is to show how the problem of finding the zeros of unilateral n-order quaternionic polynomials can be solved by determining the eigen-vectors of the corresponding companion matrix. This approach, probably…
We discuss the explicit construction of the Schroedinger equations admitting a representation through some family of general polynomials. Almost all solvable quantum potentials are shown to be generated by this approach. Some generalization…
In this paper we present several natural $q$-analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some relating analytical results and ask for combinatorial interpretations.
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
We introduce a general class of symmetric polynomials that have saturated Newton polytope and their Newton polytope has integer decomposition property. The class covers numerous previously studied symmetric polynomials.
In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
This manuscript reviews theoretical results and applications related to quadratic forms in Gaussian random variables. It summarizes definitions, canonical representations, exact and approximate distributional results, numerical inversion…
We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…
We investigate generalized quadratic forms with values in the set of rational integers over quadratic fields. We characterize the real quadratic fields which admit a positive definite binary generalized form of this type representing every…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the…
We give an asymptotic formula for the quadratic total variation of the sequence of fractional parts of the quotients of a positive real number by the consecutive natural numbers.
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…
We study quadratic polynomials giving bijections from the integer lattice points of sectors of $\mathbb{R}^2$ onto $\mathbb{N}_0$ , called packing polynomials. We determine all quadratic packing polynomials on rational sectors. This…
We introduce a family of polynomials in $q^2$ and four variables associated with the quantized algebra of functions $A_q(C_2)$. A new formula is presented for the recent solution of the 3D reflection equation in terms of these polynomials…
We study a refined version of the Linnik problem on the asymptotic behavior of the number of representations of integer $m$ by an integral polynomial as $m$ tends to infinity. We assume that the polynomial arises from invariant theory, and…
In this work, we describe our experience in learning the use of a computer proof assistant - specifically, Lean - from scratch, through proving formulae for the solutions of polynomial equations. Specifically, in this work we characterize…