Related papers: Uncommon linear systems of two equations
In [5] Graham and Rothschild consider a geometric Ramsey problem: finding the least n such that if all edges of the complete graph on the points {+1,-1}^n are 2-colored, there exist 4 coplanar points such that the 6 edges between them are…
A $k$-coloring of a tournament is a partition of its vertices into $k$ acyclic sets. Deciding if a tournament is 2-colorable is NP-hard. A natural problem, akin to that of coloring a 3-colorable graph with few colors, is to color a…
We study linear equations in combinatorial Laplacians of $k$-dimensional simplicial complexes ($k$-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacians play a crucial role in homology and are a central tool in…
We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at most two nonzero entries in each row. The core of our…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
A system of linear equations is normally understood as a linear mapping between two vector spaces. However, most direct solutions (e.g., QR, LU, ...) rely on the inelegant approach of back-substitution: a significant departure from such a…
Let $S$ be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of $S$ with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the…
A locally irregular multigraph is a multigraph whose adjacent vertices have distinct degrees. The locally irregular edge coloring is an edge coloring of a multigraph $G$ such that every color induces a locally irregular submultigraph of…
We say a graph $H$ is $r$-rainbow-uncommon if the maximum number of rainbow copies of $H$ under an $r$-coloring of $E(K_n)$ is asymptotically (as $n \to \infty$) greater than what is expected from uniformly random $r$-colorings. Via…
In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn~(arXiv: 2002.00921). Given a graph $H$ and an integer $k\geqslant 2$, let $f_{k}(n,H)$ be the smallest number of colors $c$ such that there exists a…
R. Shorten, F. Wirth, O. Mason, K. Wulff and C. King have asked whether a linear switched system is guaranteed to be globally uniformly stable under arbitrary switching if it is known that every trajectory induced by a periodic switching…
The Lie linearizability criteria are extended to complex functions for complex ordinary differential equations. The linearizability of complex ordinary differential equations is used to study the linearizability of corresponding systems of…
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…
We present a linear system of difference equations whose entries are expressed in terms of theta functions. This linear system is singular at $4m+12$ points for $m \geq 1$, which appear in pairs due to a symmetry condition. We parameterize…
A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…
One formulation of the Erdos-Szekeres monotone subsequence theorem states that for any red/blue coloring of the edge set of the complete graph on $\{1, 2, \ldots, N\}$, there exists a monochromatic red $s$-clique or a monochromatic blue…
Mathematical models for flow and reactive transport in porous media often involve non-linear, degenerate parabolic equations. Their solutions have low regularity, and therefore lower order schemes are used for the numerical approximation.…
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…
A {\em hole} is an induced cycle of length at least 4, a $k$-hole is a hole of length $k$, and an {\em odd hole} is a hole of odd length. Let $\ell\ge 2$ be an integer. Let ${\cal A}_{\ell}$ be the family of graphs of girth at least $2\ell$…
Haxell et. al. [%P. Haxell, T. Luczak, Y. Peng, V. R\"{o}dl, A. %Ruci\'{n}ski, M. Simonovits, J. Skokan, The Ramsey number for hypergraph cycles I, J. Combin. Theory, Ser. A, 113 (2006), 67-83] proved that the 2-color Ramsey number of…