English
Related papers

Related papers: On integer solutions of Parsell-Vinogradov systems

200 papers

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

Optimization and Control · Mathematics 2024-04-03 Bernd Mulansky , Andreas Potschka

Finding point configurations, that yield the maximum polarization (Chebyshev constant) is gaining interest in the field of geometric optimization. In the present article, we study the problem of unconstrained maximum polarization on compact…

Optimization and Control · Mathematics 2023-03-20 Jan Rolfes , Robert Schüler , Marc Christian Zimmermann

We prove the existence of infinitely many solutions to a class of non-symmetric Dirichlet problems with exponential nonlinearities. Here the domain $\Omega \subset\subset \mathbb{R}^{2l}$ where $2l$ is the order of the equation. Considered…

Analysis of PDEs · Mathematics 2017-07-03 Edger Sterjo

We study integer-valued matrices with bounded determinants. Such matrices appear in the theory of integer programs (IP) with bounded determinants. For example, Artmann et al. showed that an IP can be solved in strongly polynomial time if…

Optimization and Control · Mathematics 2022-11-17 Jon Lee , Joseph Paat , Ingo Stallknecht , Luze Xu

We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…

Number Theory · Mathematics 2020-01-07 Jing-Jing Huang , Huixi Li

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

Number Theory · Mathematics 2024-07-24 Aleksandr Tuxanidy , Daniel Panario

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

Combinatorics · Mathematics 2014-08-01 M. Aaghabali , S. Akbari , S. Friedland , K. Markstrom , Z. Tajfirouz

We investigate lower bounds for the number of ideal and finite vertices of right-angled hyperbolic polyhedra of finite volume. We use a geometric method of orthogonal gluings to establish new bounds in low dimensions, specifically…

Combinatorics · Mathematics 2026-04-01 Andrey Egorov

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

Metric Geometry · Mathematics 2020-12-22 Gennadiy Averkov , Christopher Borger , Ivan Soprunov

Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerical verification of this conjecture up to $10^7$ and $1.4\cdot…

Number Theory · Mathematics 2024-11-05 Christian Hercher

We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…

Metric Geometry · Mathematics 2012-03-15 Henry Cohn , Noam Elkies

In this article, constant dimension subspace codes whose codewords have subspace distance in a prescribed set of integers, are considered. The easiest example of such an object is a {\it junta}; i.e. a subspace code in which all codewords…

Combinatorics · Mathematics 2021-08-09 Giovanni Longobardi , Leo Storme , Rocco Trombetti

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

Number Theory · Mathematics 2014-02-26 Xuancheng Shao

We obtain existence and conormal Sobolev regularity of strong solutions to the 3D compressible isentropic Navier-Stokes system on the half-space with a Navier boundary condition, over a time that is uniform with respect to the viscosity…

Analysis of PDEs · Mathematics 2014-10-13 Matthew Paddick

In this paper we study systems of autonomous algebraic ODEs in several differential indeterminates. We develop a notion of algebraic dimension of such systems by considering them as algebraic systems. Afterwards we apply differential…

Algebraic Geometry · Mathematics 2022-02-10 Jose Cano , Sebastian Falkensteiner , Daniel Robertz , Rafael Sendra

In this paper we prove that there exist infinitely many integers which can be expressed as a sum of four cubes of polynomials with integer coefficients. We give several identities that express the integers 1 and 2 as a sum of four cubes of…

Number Theory · Mathematics 2023-11-14 Ajai Choudhry

Let $f$ and $g$ be two monic polynomials with integer coefficients and nonzero resultant $r$. Assume that $v_p(f(n))\ge s_1$ and $v_p(g(n))\ge s_2$ hold for all integers $n$ for some $s_1, s_2$ fixed non-negative integers. Let $S$ denote…

Number Theory · Mathematics 2021-11-12 Kristof Szabo

Systems of parabolic, possibly degenerate parabolic SPDEs are considered. Existence and uniqueness are established in Sobolev spaces. Similar results are obtained for a class of equations generalizing the deterministic first order symmetric…

Analysis of PDEs · Mathematics 2019-03-14 Máté Gerencsér , István Gyöngy , Nicolai Krylov

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Combinatorics · Mathematics 2009-05-14 Dhruv Mubayi