Related papers: Common and Sidorenko Linear Equations

New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…

We consider linear stochastic differential-algebraic equations with constant coefficients and additive white noise. Due to the nature of this class of equations, the solution must be defined as a generalised process (in the sense of Dawson…

Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that the random 2-edge-coloring minimizes the number of…

We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…

We extend known results on the number of solutions to a linear equation in at least three prime numbers when the primes involved are required to lie in specified Chebotarev classes. We prove asymptotic results similar to previous ones only…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

This research article compares two characteristics of solutions of linear differential equations of the third order with variable coefficients. It appears that there is a lower estimate for wandering rate of solution to a linear equation in…

The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

We give necessary and sufficient existence criteria, and methods for finding, continuous solutions of linear equations whose coefficients are polynomials.

Let $P$ be a set of $n$ points in the plane, not all on a line, each colored \emph{red} or \emph{blue}. The classical Motzkin--Rabin theorem guarantees the existence of a \emph{monochromatic} line. Motivated by the seminal work of Green and…

Given an equation, the integers $[n] = \{1, 2, \dots, n\}$ as inputs, and the colors red and blue, how can we color $[n]$ in order to minimize the number of monochromatic solutions to the equation, and what is the minimum? The answer is…

A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…

We establish an averaging principle on the real semi-axis for semi-linear equation \begin{equation}\label{eqAb1} x'=\varepsilon (\mathcal A x+f(t)+F(t,x))\nonumber \end{equation} with unbounded closed linear operator $\mathcal A$ and…

For a ring R and system L of linear homogeneous equations, we call a coloring of the nonzero elements of R minimal for L if there are no monochromatic solutions to L and the coloring uses as few colors as possible. For a rational number q…

A graph $H$ is called common and respectively, strongly common if the number of monochromatic copies of $H$ in a 2-edge-coloring $\phi$ of a large clique is asymptotically minimised by the random coloring with an equal proportion of each…

A graph $H$ is said to be common if the number of monochromatic labelled copies of $H$ in a red/blue edge colouring of a large complete graph is asymptotically minimized by a random colouring with an equal proportion of each colour. We…

Let L be a linear difference operator with polynomial coefficients. We consider singularities of L that correspond to roots of the trailing (resp. leading) coefficient of L. We prove that one can effectively construct a left multiple with…

This article is devoted to the study of solutions of non-homogenous linear differential equations having entire coefficients. We get all non-trivial solutions of infinite order of equation $f^{(n)}+a_{n-1}(z)f^{(n-1)}+\ldots…

A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…