Related papers: Linearly dependent powers of binary quadratic form…

The normal form for a system of ode's is constructed from its polynomial symmetries of the linear part of the system, which is assumed to be semi-simple. The symmetries are shown to have a simple structure such as invariant function times…

A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…

For certain types of quadratic forms lying in the n-th power of the fundamental ideal, we compute upper bounds and where possible exact values for the minimal number of general n-fold Pfister forms, that are needed to write the Witt class…

Let $\phi$ be a birational map of the complex projective plane. We know that $\phi$ can be written as a composition of automorphisms of $\mathbb{P}^2_\mathbb{C}$ and the standard quadratic birational map $\sigma$. This writing, that is…

The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…

We consider some families of binary binomial forms $aX^d+bY^d$, with $a$ and $b$ integers. Under suitable assumptions, we prove that every rational integer $m$ with $|m|\ge 2$ is only represented by a finite number of the forms of this…

Given a negative $D>-(\log X)^{\log 2-\delta}$, we give a new upper bound on the number of square free integers $<X$ which are represented by some but not all forms of the genus of a primitive positive definite binary quadratic form $f$ of…

We prove that a bivariate polynomial f with exactly t non-zero terms, restricted to a real line {y=ax+b}, either has at most 6t-4 zeroes or vanishes over the whole line. As a consequence, we derive an alternative algorithm to decide whether…

For any irreducible quadratic polynomial f(x) in Z[x] we obtain the estimate log l.c.m.(f(1),...,f(n))= n log n + Bn + o(n) where B is a constant depending on f.

We apply Tatuzawa's version of Siegel's theorem to derive two lower bounds on the size of the principal genus of positive definite binary quadratic forms.

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

Given a symmetric non degenerated bilinear form b on a vector space V, G. Pinczon and R. Ushirobira defined a bracket {,} on the space of multilinear skewsymmetric forms on V. With this bracket, the quadratic Lie algebra structure equation…

The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…

A pair of symmetric bilinear forms A and B determine a binary form $f(x,y) = disc(Ax-By)$. We prove that the question of whether a given binary form can be written in this way as a discriminant form generically satisfies a local-global…

This paper presents a quadratic formula-based nonlinear representation for a given single-variable function f(x), $-1 \leq x \leq 1$. First, we construct the explicit polynomial coefficient functions a(x), b(x), and c(x) using a…

We analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…

This note is devoted to the construction of two very easy examples, of respective dimensions 4 and 6, of graded Lie algebras whose grading is not given by a semigroup, the latter one being a semisimple algebra. It is shown that 4 is the…

Linear complementary dual (LCD) codes are linear codes that intersect with their dual codes trivially. We study the largest minimum weight $d_2(n,k)$ among all binary LCD $[n,k]$ codes and the largest minimum weight $d_3(n,k)$ among all…

The result of Padrol asserts that for every $d\geq 4$, there exist $2^{\Omega(n\log n)}$ distinct combinatorial types of $\lfloor d/2\rfloor$-neighborly simplicial $(d-1)$-spheres with $n$ vertices. We present a construction showing that…