Related papers: Least zero of a cubic form

We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…

The minimal integral Mahler measure of a number field $K$, $M(\mathcal{O}_K)$, is the minimal Mahler measure of a non-torsion primitive element of $\mathcal{O}_K$. Upper and lower bounds, which depend on the discriminant, are known. We show…

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…

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

We consider the set E of curves with positive algebraic curvature, whose extremities and tangents in their extremities are given. For each of the curves of E, we define the minimum of the radius of curvature. We first prove that there…

In this paper, we analyze a derivative-free line search method designed for bound-constrained problems. Our analysis demonstrates that this method exhibits a worst-case complexity comparable to other derivative-free methods for…

Let $F \in \mathbf{Z}[\boldsymbol{x}]$ be a diagonal, non-singular quadratic form in $4$ variables. Let $\lambda(n)$ be the normalised Fourier coefficients of a holomorphic Hecke form of full level. We give an upper bound for the problem of…

A binary constant weight code is a type of error-correcting code with a wide range of applications. The problem of finding a binary constant weight code has long been studied as a combinatorial optimization problem in coding theory. In this…

For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots +…

We introduce the integrality number of an integer program (IP) in inequality form. Roughly speaking, the integrality number is the smallest number of integer constraints needed to solve an IP via a mixed integer (MIP) relaxation. One…

In response to the Numberphile video regarding the Mondrian Puzzle https://www.youtube.com/watch?v=49KvZrioFB0, we provide a lower bound on how many integers less than a given threshold $x$ satisfy $M(n) \neq 0$ where $M(n)$ is the quantity…

In [1], finite associative rings wih identity and such that the set of all zero-divisors form and ideal M, called the Jacobson Radical, of cube zero and square non-zero, were constructed for all the characteristics. These rings are…

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

This paper explores special arrangements of clues in $m \times n$ Numbrix puzzles. The maximum number of clues which fails to define an $m \times n$ puzzle is demonstrated for all $m$ and $n$. In addition, a small upper bound on the minimum…

Let $F$ be a diagonal cubic form over $\mathbb{Z}$ in $6$ variables. From the dual variety in the delta method of Duke--Friedlander--Iwaniec and Heath-Brown, we unconditionally extract a weighted count of certain special integral zeros of…

In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…

Sufficient conditions for performing changes of the variable of integration when using the new definitions of improper integrals given in in "An Alternative Definition for Improper Integral with Infinite Limit" (arXiv:0805.3559v1) and "An…

Minimal codewords have applications in decoding linear codes and in cryptography. We study the maximum number of minimal codewords in binary linear codes of a given length and dimension. Improved lower and upper bounds on the maximum number…

We establish a criterion for a complex number to be algebraic over Q of degree at most two. It requires that, for any sufficiently large real number X, there exists a non-zero polynomial with integral coefficients, of degree at most two and…

A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…