Related papers: Lehmer's Problem, McKay's Correspondence, and $2,3…
In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset,…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…
The L(2, 1)-labeling of a digraph G is a function f from the node set of $G$ to the set of all nonnegative integers such that $|f(x)-f(y)| \geq 2$ if $x$ and $y$ are at distance 1, and $f(x)=f(y)$ if $x$ and $y$ are at distance 2, where the…
We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.
A Thue-Mahler equation is a Diophantine equation of the form $$F(X,Y) = a\cdot p_1^{z_1}\cdots p_v^{z_v}, \qquad \gcd(X,Y)=1$$ where $F$ be an irreducible homogeneous binary form of degree at least $3$ with integer coefficients, $a$ is a…
The sequence reconstruction problem asks for the recovery of a sequence from multiple noisy copies, where each copy may contain up to $r$ errors. In the case of permutations on \(n\) letters under the Hamming metric, this problem is closely…
A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…
In this paper the authors consider four questions of primary interest for the representation theory of reductive algebraic groups: (i) Donkin's Tilting Module Conjecture, (ii) the Humphreys-Verma Question, (iii) whether $\operatorname{St}_r…
Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…
There are two restriction maps of the logarithmic modules of plane arrangements in a three dimensional vector space. One is the Euler restriction and the other is the Ziegler restriction. The dimension of the cokernel of the Ziegler…
Let L be a number field and let E be any subgroup of the units O_L^* of L. If rank(E) = 1, Lehmer's conjecture predicts that the height of any non-torsion element of E is bounded below by an absolute positive constant. If rank(E) =…
This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…
The wild McKay correspondence is a form of McKay correspondence in terms of stringy invariants that is generalized to arbitrary characteristics. It gives rise to an interesting connection between the geometry of wild quotient varieties and…
We study a generalization of the well-known disjoint paths problem which we call the metric Menger problem, denoted MM(r,k), where one is given two subsets of a graph and must decide whether they can be connected by $k$ paths of pairwise…
We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integrality gap of the integer linear programs min{cx: x in P, x…
The $k$-deck problem is concerned with finding the smallest positive integer $S(k)$ such that there exist at least two strings of length $S(k)$ that share the same $k$-deck, i.e., the multiset of subsequences of length $k$. We introduce the…
We establish Schmutz Schaller's conjecture that the hexagonal lattice is `better' than the square lattice. Schmutz Schaller (Bulletin of the AMS 35 (1998), p. 201), motivated by considerations from hyperbolic geometry, conjectured that in…
In the first part of this paper we develop some theorems in linear algebra applicable to information theory when all random variables involved are linear functions of the individual bits of a source of independent bits. We say that a…
A subset of points in a metric space is said to resolve it if each point in the space is uniquely characterized by its distance to each point in the subset. In particular, resolving sets can be used to represent points in abstract metric…