English
Related papers

Related papers: Partition regularity and multiplicatively syndetic…

200 papers

We describe an algorithm for computing the maximal invariant set for a Markov chain with linear safety constraints on the distribution over states. We then propose a Markov chain synthesis method that guarantees finite determination of the…

Optimization and Control · Mathematics 2019-05-06 Dylan Janak , Behçet Açıkmeşe

We give two Roth theorems, related to the nonlinear configuration $x$, $x+P_1(t)$, $x+P_2(t)$ involving two polynomials, for sets in $\mathbb{R}$ of positive density and of fractional dimensions. The proof uses Fourier analysis.

Classical Analysis and ODEs · Mathematics 2020-09-01 Xuezhi Chen , Jingwei Guo , Xiaochun Li

The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…

Combinatorics · Mathematics 2018-08-28 Samuel D. Judge , William J. Keith , Fabrizio Zanello

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

Optimization and Control · Mathematics 2018-12-19 Areesh Mittal , Can Gokalp , Grani A. Hanasusanto

A new iteration method is represented to study the interior $L_{p}$ regularity for Stokes systems both in divergence form and in non-divergence form. By the iteration, we improve the integrability of derivatives of solutions for Stokes…

Analysis of PDEs · Mathematics 2024-08-01 Rong Dong , Dongsheng Li , Lihe Wang

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

Computational Geometry · Computer Science 2026-01-13 Pankaj K. Agarwal , Boris Aronov , Esther Ezra , Joshua Zahl

In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…

Analysis of PDEs · Mathematics 2025-10-20 Vladimir P. Gerdt

A discrete analogue of the dressing method is presented and used to derive integrable nonlinear evolution equations, including two infinite families of novel continuous and discrete coupled integrable systems of equations of nonlinear…

Exactly Solvable and Integrable Systems · Physics 2018-10-18 Gino Biondini , Qiao Wang

In this paper, we consider nonlocal, nonlinear partial differential equations to model anisotropic dynamics of complex root sets of random polynomials under differentiation. These equations aim to generalise the recent PDE obtained by…

Numerical Analysis · Mathematics 2022-05-19 André Galligo

We show that, under suitable conditions, finite-dimensional systems describing invariant solutions of partial differential equations (PDEs) inherit local Hamiltonian operators through the mechanism of invariant reduction, which applies…

Exactly Solvable and Integrable Systems · Physics 2026-05-01 Kostya Druzhkov

This paper deals with the spatial and temporal regularity of the unique Hilbert space valued mild solution to a semilinear stochastic partial differential equation with nonlinear terms that satisfy global Lipschitz conditions. It is shown…

Analysis of PDEs · Mathematics 2012-08-21 Raphael Kruse , Stig Larsson

This paper introduces and investigates a regularity condition in the asymptotic sense for optimization problems whose objective functions are polynomial. Under this regularity condition, the normalization argument in asymptotic analysis…

Optimization and Control · Mathematics 2021-09-07 Vu Trung Hieu

We present an accelerated, or 'look-ahead' version of the Newton-Dinkelbach method, a well-known technique for solving fractional and parametric optimization problems. This acceleration halves the Bregman divergence between the current…

Data Structures and Algorithms · Computer Science 2021-05-24 Daniel Dadush , Zhuan Khye Koh , Bento Natura , László A. Végh

The synthesis of robust invariant sets for nonlinear systems has traditionally been hindered by the inherent non convexity and a strict reliance on exact analytical models. This paper presents a purely data-driven framework to compute…

Systems and Control · Electrical Eng. & Systems 2026-04-01 Sahand Kiani , Constantino M. Lagoa

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

Differential Geometry · Mathematics 2026-05-19 Boris Kruglikov , Eivind Schneider

We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…

Combinatorics · Mathematics 2024-09-18 Mohamed Omar

We prove that a certain matrix, which is not image partition regular over R near zero, is image partition regular over N. This answers a question of De and Hindman.

Combinatorics · Mathematics 2018-09-05 Ben Barber

In the previous work [2] (i.e., arXiv:2105.03385), we considered continuous solutions of an iterative equation involving the multiplication of iterates. In this paper, we continue to investigate this equation for differentiable solutions.…

Dynamical Systems · Mathematics 2021-05-19 Chaitanya Gopalakrishna

We introduce and study equivariant Hilbert series of ideals in polynomial rings in countably many variables that are invariant under a suitable action of a symmetric group or the monoid $Inc(\mathbb{N})$ of strictly increasing functions.…

Commutative Algebra · Mathematics 2021-05-18 Uwe Nagel , Tim Roemer

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

Numerical Analysis · Mathematics 2025-08-14 Elias Jarlebring , Gustaf Lorentzon