Related papers: Partition Regularity of Nonlinear Polynomials: a N…
An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…
A well-known consequence of Schur's theorem is that for $r\in \mathbb{N}$, if $n$ is sufficiently large, then any $r$-colouring of $[n]$ results in monochromatic $a,b,c\in [n]$ such that $ab=c$. In this paper we are interested in the…
We demonstrate a kind of linear superposition for a large number of nonlinear equations, both continuum and discrete. In particular, we show that whenever a nonlinear equation admits solutions in terms of Jacobi elliptic functions…
Let $H_{n,(p_m)_{m=2,\ldots,M}}$ be a random non-uniform hypergraph of dimension $M$ on $2n$ vertices, where the vertices are split into two disjoint sets of size $n$, and colored by two distinct colors. Each non-monochromatic edge of size…
The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…
For each positive integer $n$ it is shown how to construct a finite collection of multivariable polynomials $\{F_{i}:=F_{i}(t,X_{1},..., X_{\lfloor \frac{n+1}{2} \rfloor})\}$ such that each positive integer whose squareroot has a continued…
We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…
Raimi's classical theorem establishes a partition of the natural numbers with a remarkable unavoidability property: for every finite coloring of $\mathbb{N}$, there is a color class whose translate meets both parts of the partition in…
We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…
We show that for every non-spherical set $X$ in $\mathbb{E}^d$, there exists a natural number $m$ and a red/blue-colouring of $\mathbb{E}^n$ for every $n$ such that there is no red copy of X and no blue progression of length $m$ with each…
Let $B_{n}(t)$ be the $n$th Stern polynomial, i.e., the $n$th term of the sequence defined recursively as $B_{0}(t)=0, B_{1}(t)=1$ and $B_{2n}(t)=tB_{n}(t), B_{2n+1}(t)=B_{n}(t)+B_{n-1}(t)$ for $n\in\N$. It is well know that $i$th…
Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…
The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…
Let $N\ge 4$. We show that, if $x_1,\dots,x_N$ and $y_1,\dots,y_N$ are $N$-tuples of strictly positive numbers whose arithmetic, geometric and harmonic means agree, then \[ \max_j x_j <(N-2)\max_j y_j \quad\text{and}\quad \min_j x_j…
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…
This is a Research and Instructional Development Project from the U. S. Naval Academy. In this monograph, the basic methods of nonstandard analysis for n-dimensional Euclidean spaces are presented. Specific rules are deveoped and these…
We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…
Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…
The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference $d(n)$ between the largest and the smallest areas of the rectangles partitioning…
We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…