Related papers: Least zero of a cubic form

We obtain lower bound of caliber number of real quadratic field $K=\FQ(\sqrt{d})$ using splitting primes in $K$. We find all real quadratic fields of caliber number 1 and find all real quadratic fields of caliber number 2 if $d$ is not 5…

The positive semidefinite rank of a convex body $C$ is the size of its smallest positive semidefinite formulation. We show that the positive semidefinite rank of any convex body $C$ is at least $\sqrt{\log d}$ where $d$ is the smallest…

For $A\subseteq \{1, 2, \ldots\}$, we consider $R(A)=\{a/b: a, b\in A\}$. It is an open problem to study the denseness of $R(A)$ in the $p$-adic numbers when $A$ is the set of nonzero values assumed by a cubic form. We study this problem…

We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq…

For every positive integer k, it is shown that there exists a positive definite diagonal quaternary integral quadratic form that represents all positive integers except for precisely those which lie in k arithmetic progressions. For k=1,…

In this note we present algorithms for computing Euclidean minima of cubic number fields; in particular, we were able to find all norm-Euclidean cubic number fields with discriminants -999 < d < 10000.

For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…

We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.

A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…

Let $b \ge 2$ be an integer. Not much is known on the representation in base $b$ of prime numbers or of numbers whose prime factors belong to a given, finite set. Among other results, we establish that any sufficiently large integer which…

A long-standing conjecture states that every positive integer other than 15, 22, 23, 50, 114, 167, 175, 186, 212, 231, 238, 239, 303, 364, 420, 428, 454 is a sum of at most seven positive cubes. This was first observed by Jacobi in 1851 on…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query all but 7 input bits to compute its value, even if we know beforehand that the number…

Assuming an integral quadratic polynomial with nonsingular quadratic part has a nontrivial zero on an integer lattice outside of a union of finite-index sublattices, we prove that there exists such a zero of bounded norm and provide an…

A rational positive-definite quadratic form is perfect if it can be reconstructed from the knowledge of its minimal nonzero value m and the finite set of integral vectors v such that f(v) = m. This concept was introduced by Voronoi and…

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

Let $d$ be a fixed positive integer and let $\epsilon>0$. It is shown that for every sufficiently large $n\geq n_0(d,\epsilon)$, the $d$-dimensional unit cube can be decomposed into exactly $n$ smaller cubes such that the ratio of the side…

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at most 16 by hand, thereby uncovering new phenomena beyond the…