Related papers: Computing the $p$-adic Canonical Quadratic Form in…

This survey describes work on the number of variables required to ensure that a system of r quadratic forms over the p-adics has a non-trivial common zero.

In this paper, $\mathcal{P}$-canonical forms of $(A^{k})_{k}$ (or simply of the matrix $A$) are defined and some of their properties are proved. It is also shown how we can deduce from them many interesting informations about the matrix…

A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…

Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…

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 show that for every fixed non-negative integer k there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph in the plane with at most k…

This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its…

In this methodological paper, we first review the classic cubic Diophantine equation $a^3 + b^3 + c^3 = d^3$, and consider the specific class of solutions $q_1^3 + q_2^3 + q_3^3 = q_4^3$ with each $q_i$ being a binary quadratic form. Next…

In this paper we study q-Euler numbers and polynomials by using p-adic q-fermionic integrals on Z_p. The methods to study q-Euler numbers and polynomials in this paper are new.

For a prime $p>3$, let $D$ be the discriminant of an imaginary quadratic order with $|D|< \frac{4}{\sqrt{3}}\sqrt{p}$. We research the solutions of the class polynomial $H_D(X)$ mod $p$ in $\mathbb{F}_p$ if $D$ is not a quadratic residue in…

We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.

The purpose of this paper is to construct q-Euler numbers and polynomials by using p-adic q-integral equations on Zp. Finally, we will give some interesting formulae related to these q-Euler numbers and polynomials.

Let $p(x_1,...,x_n) =\sum_{(r_1,...,r_n) \in I_{n,n}} a_{(r_1,...,r_n)} \prod_{1 \leq i \leq n} x_{i}^{r_{i}}$ be homogeneous polynomial of degree $n$ in $n$ real variables with integer nonnegative coefficients. The support of such…

For $A \subseteq \{1,2,\ldots\}$, we consider $R(A) = \{a/a' : a,a' \in A\}$. If $A$ is the set of nonzero values assumed by a quadratic form, when is $R(A)$ dense in the $p$-adic numbers? We show that for a binary quadratic form $Q$,…

This note provides new methods for constructing quadratic nonresidues in finite fields of characteristic p. It will be shown that there is an effective deterministic polynomial time algorithm for constructing quadratic nonresidues in finite…

We establish necessary and sufficient conditions for a quadratic polynomial to be irreducible in the ring $Z[[x]]$ of formal power series with integer coefficients. For $n,m\ge 1$ and $p$ prime, we show that $p^n+p^m\beta x+\alpha x^2$ is…

We present an algorithm to perform a simultaneous modular reduction of several residues. This algorithm is applied fast modular polynomial multiplication. The idea is to convert the $X$-adic representation of modular polynomials, with $X$…

We obtain the quadratic term in Euler's asymptotic expansion of the nth harmonic number by a simple modification of Young's elementary determination of the linear term.

For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$ the polynomial interpolation problem (PIP) is to determine a \emph{generic node set} $P \subseteq \mathbb{R}^m$ and the coefficients of…

In this paper we discuss a method to apply Quantization rules for arbitrary Hamiltonians that are not necessarily Polynomials in variable p, so we have H of the form H(x,p)=F(x,p)+g(x) the method uses the results of "Fractional Calculus"…