Related papers: A coding perspective on the lower bound for diagon…

In this paper, we propose and study $r$-minimal codes, a natural extension of minimal codes which have been extensively studied with respect to Hamming metric, rank metric and sum-rank metric. We first propose $r$-minimal codes in a general…

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

We find the exact values for constants in bilateral Calderon-Stein-Weiss inequalities between tail (Marcinkiewicz) norm and weak Lebesgue (Lorentz) norm. Possible applications: Functional Analysis (for instance, interpolation of operators),…

We compute a variance lower bound for unbiased estimators in specified statistical models. The construction of the bound is related to the original Cram\'er-Rao bound, although it does not require the differentiability of the model.…

In this work, we give several new upper and lower bounds on Ramsey numbers for books and wheels, including a tight upper bound establishing $R(W_5, W_7) = 15$, matching upper and lower bounds giving $R(W_5, W_9) = 18$, $R(B_2, B_8) = 21$,…

For a partially ordered set $(A, \le)$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a \neq b\in A$ are adjacent if either $a \le b$ or $b \le a$. We call $G_A$ the \emph{partial order graph} or…

We consider the parabolic Lam\'{e} system on a bounded domain. We focus on two types of inequalities for higher-order derivatives of solutions. The first is related to an $L^p$-$L^p$ estimate locally in time in the Lebesgue space setting,…

We provide two new exact Sidon-Ramsey numbers to the list known so far. We also improve the upper bounds of the next two Sidon-Ramsey numbers. In doing so, we comment on the tendencies we found on the Sidon-Ramsey partitions that were…

Given a finite point set $P \subset \mathbb{R}^d$, a $k$-ary semi-algebraic relation $E$ on $P$ is the set of $k$-tuples of points in $P$, which is determined by a finite number of polynomial equations and inequalities in $kd$ real…

In 2013, Bollob\'as, Mitsche, and Pralat at gave upper and lower bounds for the likely metric dimension of random Erd\H{o}s-R\'enyi graphs $G(n,p)$ for a large range of expected degrees $d=pn$. However, their results only apply when $d \ge…

The goal of this paper is to obtain lower bounds on the height of an algebraic number in a relative setting, extending previous work of Amoroso and Masser. Specifically, in our first theorem we obtain an effective bound for the height of an…

We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed in the literature.

This paper provides new lower bounds for van der Waerden numbers using Rabung's method, which colors based on the discrete logarithm modulo some prime. Through a distributed computing project with 500 volunteers over one year, we checked…

The minimum distance of expander codes over GF(q) is studied. A new upper bound on the minimum distance of expander codes is derived. The bound is shown to lie under the Varshamov-Gilbert (VG) bound while q >= 32. Lower bounds on the…

A $k$-ordering of a graph $G$ assigns distinct order-labels from the set $\{1,\ldots,|G|\}$ to $k$ vertices in $G$. Given a $k$-ordering $H$, the ordered Ramsey number $R_<(H)$ is the minimum $n$ such that every edge-2-coloring of the…

Let $f$ be a polynomial in $n$ variables $x_1,\dots,x_n$ with real coefficients. In [Ghasemi-Marshal], Ghasemi and Marshall give an algorithm, based on geometric programming, which computes a lower bound for $f$ on $\mathbb{R}^n$. In…

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…

We prove explicit Erd\H{o}s--Wintner bounds for Cantor numeration systems via a simple trailing-window decomposition. We temporarily discard the last block of digits (the ``window'') and analyze the remaining prefix. The resulting bound has…

We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show…