Related papers: Ideal solutions in the Prouhet-Tarry-Escott proble…

We study the problem of existence of (nontrivial) perfect codes in the discrete $ n $-simplex $ \Delta_{\ell}^n := \left\{ \begin{pmatrix} x_0, \ldots, x_n \end{pmatrix} : x_i \in \mathbb{Z}_{+}, \sum_i x_i = \ell \right\} $ under $ \ell_1…

In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…

Suppose that m is a positive integer, not a perfect square. We present a formula solution to the 2-variable Frobenius problem in Z[\sqrt m] of the "first kind" ([3]).

We present an extension of the Prouhet-Tarry-Escott problem by demonstrating that signed sums of noninteger powers of consecutive integers can be made arbitrarily close to zero.

This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are \emph{compatible} if they have the same vertex set and their union is also non-crossing. Our first result states that for any two perfect matchings…

A perfect cuboid (PC) is a rectangular parallelepiped with rational sides $a,b,c$ whose face diagonals $d_{ab}$, $d_{bc}$, $d_{ac}$ and space (body) diagonal $d_s$ are rationals. The existence or otherwise of PC is a problem known since at…

We study the diametric problem (i.e., optimal anticodes) in the space of permutations under the Ulam distance. That is, let $S_n$ denote the set of permutations on $n$ symbols, and for each $\sigma, \tau \in S_n$, define their Ulam distance…

Given a pattern x of length m and a text y of length n, both over an ordered alphabet, the order-preserving pattern matching problem consists in finding all substrings of the text with the same relative order as the pattern. It is an…

We consider the following problem: Given a rational matrix $A \in \setQ^{m \times n}$ and a rational polyhedron $Q \subseteq\setR^{m+p}$, decide if for all vectors $b \in \setR^m$, for which there exists an integral $z \in \setZ^p$ such…

In this paper we elucidate the advantage of examining the connections between Hilbert-Kamke equations and geometric designs, or Chebyshev-type quadrature, for classical orthogonal polynomials. We first establish that if a $5$-design with…

For $n\leq 1.5 \cdot 10^{10}$, we have found a total number of 1268 solutions to the Erd\"os-Sierpi\'nski problem finding positive integer solutions of $\sigma(n)=\sigma(n+1)$, where $\sigma(n)$ is the sum of the positive divisors of n. On…

In "Recognizing the Maximum of a Sequence", Gilbert and Mosteller analyze a full information game where n measurements from an uniform distribution are drawn and a player (knowing n) must decide at each draw whether or not to choose that…

The existence of a perfect odd number is an old open problem of number theory. An Euler's theorem states that if an odd integer $ n $ is perfect, then $ n $ is written as $ n = p ^ rm ^ 2 $, where $ r, m $ are odd numbers, $ p $ is a prime…

Suppose $\mathcal I$ and $\mathcal J$ are proper ideals on some set $X$. We say that $\mathcal I$ and $\mathcal J$ are incompatible if $\mathcal I \cup \mathcal J$ does not generate a proper ideal. Equivalently, $\mathcal I$ and $\mathcal…

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…

This paper deals with quadratic irrationals of the form $m/q+\sqrt v$ for fixed positive integers $v$ and $q$, $v$ not a square, and varying integers $m$, $(m,q)=1$. Two numbers $m/q+\sqrt v$, $n/q+\sqrt v$ of this kind are equivalent (in a…

Let $k\ge 1$ be an integer, and let $P= (f_1(x), \ldots, f_k(x) )$ be $k$ admissible linear polynomials over the integers, or \textit{the pattern}. We present two algorithms that find all integers $x$ where $\max{ \{f_i(x) \} } \le n$ and…

Considering the optimal alignment of two i.i.d. random sequences of length $n$, we show that when the scoring function is chosen randomly, almost surely the empirical distribution of aligned letter pairs in all optimal alignments converges…

We study the truncated two-dimensional moment problem (with rectangular data): to find a non-negative measure $\mu(\delta)$, $\delta\in\mathfrak{B}(\mathbb{R}^2)$, such that $\int_{\mathbb{R}^2} x_1^m x_2^n d\mu = s_{m,n}$, $0\leq m\leq…