Related papers: Nonlinear Kernel Partition Regularity: Necessary a…
An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…
A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…
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]$…
We study linear systems of equations with coefficients in a generic partially ordered ring $R$ and a unique solution, and seek conditions for the solution to be nonnegative, that is, every component of the solution is a quotient of two…
Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…
A linear equation is $r$-regular, if, for every $r$-coloring of the positive integers, there exist positive integers of the same color which satisfy the equation. In 2005, Fox and Radoicic conjectured that the equation $x_1 + 2x_2 + \cdots…
In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive integer k, there exists a linear equation that is (k-1)-regular…
Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…
An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…
We study the Ramsey properties of equations $a_1P(x_1) + \cdots + a_sP(x_s) = b$, where $a_1,\ldots,a_s,b$ are integers, and $P$ is an integer polynomial of degree $d$. Provided there are at least $(1+o(1))d^2$ variables, we show that…
A matrix is \emph{simple} if it is a (0,1)-matrix and there are no repeated columns. Given a (0,1)-matrix $F$, we say a matrix $A$ has $F$ as a \emph{configuration}, denoted $F\prec A$, if there is a submatrix of $A$ which is a row and…
The row (column) completion problem of polynomial matrices of given degree with prescribed eigenstructure has been studied in \cite{AmBaMaRo23}, where several results of prescription of some of the four types of invariants that form the…
We consider Rado numbers of the regular equations $\mathcal{E}(b)$ of the form \[ c_1x_1+c_2x_2+\dots+ c_{k-1}x_{k-1} = x_k + b, \] where $b \in \mathbb{Z}$ and $c_i \in \mathbb{Z}^{+}$ for all $i$. We give the upper bounds and the…
The Rado number of an equation is a Ramsey-theoretic quantity associated to the equation. Let $\mathcal{E}$ be a linear equation. Denote by $\operatorname{R}_r(\mathcal{E})$ the minimal integer, if it exists, such that any $r$-coloring of…
A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emph{nonrepetitive chromatic number} of a graph $G$ is the…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
Monte Carlo is famous for accepting model extensions and model refinements up to infinite dimension. However, this powerful incremental design is based on a premise which has severely limited its application so far: a state-variable can…
We study the linearization problem of germs of holomorphic diffeomorphisms with resonant linear part. The formal linearization requires in general an infinite number of algebraic relations to be satisfied by the coefficients of the power…
Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…