Related papers: On uncommon systems of equations

A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…

In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…

It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…

A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring. We prove that, given $k,r>0$, there exists a $k$-connected common…

We define a linear homogeneous equation to be strongly r-regular if, when a finite number of inequalities is added to the equation, the system of the equation and inequalities is still r-regular. In this paper, we show that, if a linear…

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…

Schur's theorem states that in any $k$-colouring of the set of integers $[n]$ there is a monochromatic solution to $a+b=c$, provided $n$ is sufficiently large. Abbott and Wang studied the size of the largest subset of $[n]$ such that there…

In this paper, we study uniqueness properties of solutions to the generalized fourth-order Schr\"odinger equations in any dimension $d$ of the following forms, $$i \partial_t u + \sum_{j=1}^d \partial_{x_j}^{\, 4} u = V(t, x) u, \quad…

This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…

We provide a characterization for a periodic system of generalized Sylvester and conjugate-Sylvester equations, with at most one generalized conjugate-Sylvester equation, to have a unique solution when all coefficient matrices are square…

Using geometric methods for linearizing systems of second order cubically semi-linear ordinary differential equations and third order quintically semi-linear ordinary differential equations, we extend to the fourth order by differentiating…

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…

Nonlinear perturbation of Fuchsian systems are studied in regions including two singularities. Such systems are not necessarily analytically equivalent to their linear part (they are not linearizable). Nevertheless, it is shown that in the…

A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erdos, conjectured that every graph is common.…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

The famous four color theorem states that for all planar graphs, every vertex can be assigned one of 4 colors such that no two adjacent vertices receive the same color. Since Francis Guthrie first conjectured it in 1852, it is until 1976…

This paper aims to establish counterparts of fundamental regularity statements for solutions to elliptic equations in the setting of low-dimensional structures such as, for instance, glued manifolds or CW-complexes. The main result proves…

A repetition free Longest Common Subsequence (LCS) of two sequences x and y is an LCS of x and y where each symbol may appear at most once. Let R denote the length of a repetition free LCS of two sequences of n symbols each one chosen…

For a positive linear map F and a normal matrix N, we show that |F(N)| is bounded by some simple linear combinations in the unitary orbit of F(|N|). Several elegant sharp inequalities are derived, especially for the Schur product.

In this study, the existence and uniqueness of the unpredictable solution for a non-homogeneous linear system of ordinary differential equations is considered. The hyperbolic case is under discussion. New properties of unpredictable…