English
Related papers

Related papers: On systems of complexity one in the primes

200 papers

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an…

Number Theory · Mathematics 2011-06-09 Tomasz Schoen , Ilya D. Shkredov

We are concerned with the existence and uniqueness of solutions with only bounded density for the barotropic compressible Navier-Stokes equations. Assuming that the initial velocity has slightly sub-critical regularity and that the initial…

Analysis of PDEs · Mathematics 2020-01-08 Raphaël Danchin , Francesco Fanelli , Marius Paicu

Given a bivariate system of polynomial equations with fixed support sets $A, B$ it is natural to ask which multiplicities its solutions can have. We prove that there exists a system with a solution of multiplicity $i$ for all $i$ in the…

Algebraic Geometry · Mathematics 2021-10-26 I. Nikitin

The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…

Computational Complexity · Computer Science 2018-10-11 Katrin Casel , Henning Fernau , Mehdi Khosravian Ghadikolaei , Jérôme Monnot , Florian Sikora

We consider properties of binomial series $\sum_{n=0}^\infty a_n z^{\underline{n}}$, where $z^{\underline{n}}=z(z-1)\cdots(z-n+1)$ and the convergence of binomial series in the complex domain. The order of growth of entire and meromorphic…

Complex Variables · Mathematics 2020-03-12 Katsuya Ishizaki , Zhi-Tao Wen

The problem of solving linear systems is one of the most fundamental problems in computer science, where given a satisfiable linear system $(A,b)$, for $A \in \mathbb{R}^{n \times n}$ and $b \in \mathbb{R}^n$, we wish to find a vector $x…

Data Structures and Algorithms · Computer Science 2021-06-25 Mitali Bafna , Nikhil Vyas

Let $(a_n)_{n \geq 0}$ be a sequence of integers such that its generating series satisfies $\sum_{n \geq 0} a_nt^n = \frac{h(t)}{(1-t)^d}$ for some polynomial $h(t)$. For any $r \geq 1$ we study the coefficient sequence of the numerator…

Combinatorics · Mathematics 2011-08-16 Martina Kubitzke , Volkmar Welker

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

Number Theory · Mathematics 2007-05-23 Chunlei Liu

We present a general method for introducing finitely axiomatizable "minimal" two-sorted theories for various subclasses of P (problems solvable in polynomial time). The two sorts are natural numbers and finite sets of natural numbers. The…

Logic in Computer Science · Computer Science 2017-01-11 Phuong Nguyen , Stephen Cook

This paper proposes a new approach to describe the stability of linear time-invariant systems via the torsion $\tau(t)$ of the state trajectory. For a system $\dot{r}(t)=Ar(t)$ where $A$ is invertible, we show that (1) if there exists a…

Optimization and Control · Mathematics 2020-01-07 Yuxin Wang , Huafei Sun , Yueqi Cao , Shiqiang Zhang

Solving a singular linear system for an individual vector solution is an ill-posed problem with a condition number infinity. From an alternative perspective, however, the general solution of a singular system is of a bounded sensitivity as…

Numerical Analysis · Mathematics 2021-02-22 Zhonggang Zeng

Let $(a_n)_{n \geq 0}$ be a sequence of complex numbers such that its generating series satisfies $\sum_{n \geq 0} a_nt^n = \frac{h(t)}{(1-t)^d}$ for some polynomial $h(t)$. For any $r \geq 1$ we study the transformation of the coefficient…

Combinatorics · Mathematics 2007-12-18 Francesco Brenti , Volkmar Welker

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

Computational Complexity · Computer Science 2025-03-04 Alberto Larrauri , Stanislav Živný

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…

Logic · Mathematics 2014-10-21 Tuomo Kauranne

Let K be a number field, and let a be a non-zero element of K. Fix some prime number l. We compute the density of the following set: the primes p of K such that the multiplicative order of the reduction of a modulo p is coprime to l (or,…

Number Theory · Mathematics 2014-05-20 Antonella Perucca

The Vlasov-Poisson system describes interacting systems of collisionless particles. For solutions with small initial data in three dimensions it is known that the spatial density of particles decays like $t^{-3}$ at late times. In this…

Analysis of PDEs · Mathematics 2007-05-23 Hyung Ju Hwang , Alan D. Rendall , Juan J. L. Velazquez

We discuss the solvability of an infinite system of first order ordinary differential equations on the half line, subject to nonlocal initial conditions. The main result states that if the nonlinearities possess a suitable "sub-linear"…

Classical Analysis and ODEs · Mathematics 2015-03-25 Gennaro Infante , Petru Jebelean , Fadila Madjidi

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Number Theory · Mathematics 2012-07-30 Pieter Moree

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

Algebraic Topology · Mathematics 2012-07-20 Mark Grant , Gregory Lupton , John Oprea

A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…

Classical Analysis and ODEs · Mathematics 2019-09-20 Jonathan M. Fraser