English
Related papers

Related papers: Partition regularity for systems of diagonal equat…

200 papers

A partition n = p_1 + p_2 + ... + p_k with 1 <= p_1 <= p_2 <= ... <= p_k is called non-squashing if p_1 + ... + p_j <= p_{j+1} for 1 <= j <= k-1. Hirschhorn and Sellers showed that the number of non-squashing partitions of n is equal to the…

Combinatorics · Mathematics 2014-09-17 N. J. A. Sloane , James A. Sellers

We find that a wide variety of families of partition statistics stabilize in a fashion similar to $p_k(n)$, the number of partitions of n with k parts, which satisfies $p_k(n) = p_{k+1}(n + 1), k \geq n/2$. We bound the regions of…

Combinatorics · Mathematics 2013-07-05 Robert P. Boyer , William J. Keith

We study finite and countably infinite systems of stochastic differential equations, in which the drift and diffusion coefficients of each component (particle) are determined by its rank in the vector of all components of the solution. We…

Probability · Mathematics 2011-09-20 Tomoyuki Ichiba , Ioannis Karatzas , Mykhaylo Shkolnikov

We prove Holder regularity for solutions of non divergence integro-differential equations with non necessarily even kernels. The even/odd decomposition of the kernel can be understood as a sum of a diffusion and a drift term. In our case we…

Analysis of PDEs · Mathematics 2012-10-31 Hector A. Chang Lara

The detection of multipartite entanglement in arbitrary dimensional systems is investigated. We derive useful $k$-separability criteria of mixed $n$-partite ($n\geq 3$) quantum states to detect $k$-nonseparable $n$-partite quantum states.…

Quantum Physics · Physics 2013-01-17 Ting Gao , Yan Hong

In 1933, Rado conjectured that for any positive integer n, there is always a linear homogeneous equation with degree of regularity n. In proving this conjecture, Alexeev and Tsimerman, and independently Golowich, found that some equations…

Combinatorics · Mathematics 2017-01-31 Nathan Johns

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

We consider consistent particle systems, which include independent random walkers, the symmetric exclusion and inclusion processes, as well as the dual of the KMP model. Consistent systems are such that the distribution obtained by first…

Probability · Mathematics 2019-12-24 Gioia Carinci , Cristian Giardinà , Frank Redig

We are concerned with the classification of positive radial solutions for the system $\Delta u=v^p$, $\Delta v=f(|\nabla u|)$, where $p>0$ and $f\in C^1[0,\infty)$ is a nondecreasing function such that $f(t)>0$ for all $t>0$. We show that…

Analysis of PDEs · Mathematics 2015-05-26 Gurpreet Singh

We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…

Dynamical Systems · Mathematics 2022-08-29 Sachin Bhalekar , Prashant M. Gade , Divya Joshi

The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference $d(n)$ between the largest and the smallest areas of the rectangles partitioning…

Combinatorics · Mathematics 2020-07-21 C. Dalfó , M. A. Fiol , N. López

A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.

Combinatorics · Mathematics 2008-08-11 Toufik Mansour , Simone Severini

Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split…

Discrete Mathematics · Computer Science 2013-06-21 Tomás Feder , Pavol Hell , Oren Shklarsky

We establish partial regularity for vector-valued solutions to parabolic systems where the coefficients are possibly discontinuous with respect to (x,t). More precisely, we assume a VMO-condition with respect to the (x,t) and continuity…

Analysis of PDEs · Mathematics 2013-12-19 Taku Kanazawa

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

Classical Analysis and ODEs · Mathematics 2012-05-07 Pedro J. Freitas , Shmuel Friedland , Gaspar Porta

Suppose that $A$ is a $k \times d$ matrix of integers and write $\mathfrak{R}_A:\mathbb{N} \rightarrow \mathbb{N}\cup \{ \infty\}$ for the function taking $r$ to the largest $N$ such that there is an $r$-colouring $\mathcal{C}$ of $[N]$…

Combinatorics · Mathematics 2020-10-14 Tom Sanders

We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…

Numerical Analysis · Mathematics 2014-01-15 Josef Sifuentes , Zydrunas Gimbutas , Leslie Greengard

The paper concerns the solvability by quadratures of linear differential systems, which is one of the questions of differential Galois theory. We consider systems with regular singular points as well as those with (non-resonant) irregular…

Classical Analysis and ODEs · Mathematics 2013-12-10 Renat Gontsov , Ilya Vyugin

In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…

Data Structures and Algorithms · Computer Science 2024-11-26 Frederik Glitzner , David Manlove

Consider the (almost surely) unique Radon partition of a set of $n$ random Gaussian vectors in $\mathbb R^{n-2}$; choose one of the two parts of this partition uniformly at random, and for $0 \le k \le n$, let $p_k$ denote the probability…

Combinatorics · Mathematics 2025-07-03 Swee Hong Chan , Gil Kalai , Bhargav Narayanan , Natalya Ter-Saakov , Moshe White