Related papers: Linearly dependent powers of binary quadratic form…

If f(x_1, x_2, ..., x_n) is a polynomial dependent on a large number of independent Bernoulli random variables, what can be said about the maximum concentration of f on any single value? For linear polynomials, this reduces to one version…

Let $d$ be a square-free positive integer and $h(d)$ the class number of the real quadratic field $\mathbb{Q}{(\sqrt{d})}.$ In this paper we give an explicit lower bound for $h(n^2+r)$, where $r=1,4$, and also establish an equivalent…

Let $r_Q(n)$ be the representation number of a nonnegative integer $n$ by the quaternary quadratic form $Q=x_1^2+2x_2^2+x_3^2+x_4^2+x_1x_3+x_1x_4+x_2x_4$. We first prove the identity $r_Q(p^2n)=r_Q(p^2)r_Q(n)/r_Q(1)$ for any prime $p$…

Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, linear codes…

We determine explicit formulas for the number of representations of a positive integer $n$ by quaternary quadratic forms with coefficients $1$, $2$, $5$ or $10$. We use a modular forms approach.

In this article, the standard correspondence between the ideal class group of a quadratic number field and the equivalence classes of binary quadratic forms of given discriminant is generalized to any base number field of narrow class…

We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…

We give improved bounds for our theorem in [GW09], which shows that a system of linear forms on $\mathbb{F}_p^n$ with squares that are linearly independent has the expected number of solutions in any linearly uniform subset of…

Let $r,m$ be positive integers. Let $0\le x <1$ be a rational number. Let $\Phi_s(x,z)$ be the $s$-th Lerch function $\sum_{k=0}^{\infty}\tfrac{z^{k+1}}{(k+x+1)^s}$ with $s=1,2,\ldots ,r$. When $x=0$, this is the polylogarithmic function.…

This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…

Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Some interesting (periodic!) solutions of certain systems of $4$ nonlinear Ordinary Differential Equations $dx_{n}\left( t\right) /dt=P_{2}^{\left( n\right) }\left[ x_{m}\left( t\right) \right] /\left[ x_{1}\left( t\right) +x_{2}\left(…

The local minima of a quadratic functional depending on binary variables are discussed. An arbitrary connection matrix can be presented in the form of quasi-Hebbian expansion where each pattern is supplied with its own individual weight.…

A conjecture of N. Terai states that for any integer $k>1$, the equation $x^2+(2k-1)^y =k^z$ has only one solution, namely, $(x, y, z) = (k-1, 1, 2).$ Using the structure of class groups of binary quadratic forms, we prove the conjecture…

Let $f_r(n)$ be the minimum number of complete $r$-partite $r$-graphs needed to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. Graham and Pollak showed that $f_2(n) = n-1$. An easy construction shows that…

Let $k\leq n$ be two positive integers and $q$ a prime power. The basic question in minimal linear codes is to determine if there exists an $[n,k]_q$ minimal linear code. The first objective of this paper is to present a new sufficient and…

For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…

We study the linear algebra of finite subsets $S$ of a Segre variety $X$. In particular we classify the pairs $(S,X)$ with $S$ linear dependent and $\#(S)\le 5$. We consider an additional condition for linear dependent sets (no two of their…