Related papers: Nonlinear Kernel Partition Regularity: Necessary a…
In this text we study the regularity of matrices with special polynomial entries. Barring some mild conditions we show that these matrices are regular if a natural limit size is not exceeded. The proof draws connections to generalized…
Although a unique solution is guaranteed in the Linear complementarity problem (LCP) when the matrix $\mathbf{M}$ is positive definite, practical applications often involve cases where $\mathbf{M}$ is only positive semi-definite, leading to…
We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and…
It is well known that square matrices with independent and identically distributed (iid) random entries are typically well conditioned. A natural question is whether this favorable behavior persists for random matrices whose entries obey…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
Given an $n\times n$ array $M$ ($n\ge 7$), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of $M$ into $n$ diagonals, each containing at least one cell of each…
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…
Let $f_r(k)$ be the smallest positive integer $n$ such that every $r$-coloring of $\{1,2,...,n\}$ has a monochromatic solution to the nonlinear equation \[1/x_1+\cdots+1/x_k=1/y,\] where $x_1,...,x_k$ are not necessarily distinct. Brown and…
We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…
In parametric, nonlinear structural models a classical sufficient condition for local identification, like Fisher (1966) and Rothenberg (1971), is that the vector of moment conditions is differentiable at the true parameter with full rank…
We develop a multigraded variant of Castelnuovo-Mumford regularity. Motivated by toric geometry, we work with modules over a polynomial ring graded by a finitely generated abelian group. As in the standard graded case, our definition of…
The typical extremal problem asks how large a structure can be without containing a forbidden substructure. The Erd\H{o}s-Rothschild problem, introduced in 1974 by Erd\H{o}s and Rothschild in the context of extremal graph theory, is a…
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…
A $P_m$ path in a graph is a path on $m$ vertices. A $P_m$ system of order $n>1$ is a partition of the edges of the complete graph $K_n$ into $P_m$ paths. A $P_m$ system is said to be $k$-colourable if the vertex set of $K_n$ can be…
We give a necessary and sufficient condition for a system of linear inhomogeneous fractional differential equations to have at least one bounded solution. We also obtain an explicit description for the set of all bounded (or decay)…
We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems…
Written with respect to an appropriate Poisson structure, a partially integrable Hamiltonian system is viewed as a completely integrable system with parameters. Then, the theorem on quasi-periodic stability in Ref. [1] (the KAM theorem) can…
If E is a linear homogenous equation and c a natural then the Rado number $R_c(E)$ is the least N so that any c-coloring of the positive integers from 1 to N contains a monochromatic solution. Rado characterized for which E R_c(E) always…
Erd\H{o}s & Graham ask whether the equation $x^2+y^2=z^2$ is partition regular, i.e. whether it has a finite Rado number. This note provides a lower bound and also states results in the affirmative for two similar quadratic equations.
Understanding the structure of the fermion mixing matrices is an important question in particle physics. The quark mixing matrix is approximately diagonal while the lepton mixing matrix has large off-diagonal elements. Attempting to…