Related papers: On the Fixed-Length-Burst Levenshtein Ball with Un…
The finite Grassmannian $\mathcal{G}_{q}(k,n)$ is defined as the set of all $k$-dimensional subspaces of the ambient space $\mathbb{F}_{q}^{n}$. Subsets of the finite Grassmannian are called constant dimension codes and have recently found…
A Radial Basis Function Generated Finite-Differences (RBF-FD) inspired technique for evaluating definite integrals over the volume of the ball in three dimensions is described. Such methods are necessary in many areas of Applied…
Deterministic fabrication of random metamaterials requires filling of a space with randomly oriented and randomly positioned chords with an on-average homogenous density and orientation, which is a nontrivial task. We describe a method to…
In this paper, we revisit the Minimum Enclosing Ball (MEB) problem and its robust version, MEB with outliers, in Euclidean space $\mathbb{R}^d$. Though the problem has been extensively studied before, most of the existing algorithms need at…
We study the repeated balls-into-bins process introduced by Becchetti, Clementi, Natale, Pasquale and Posta (2019). This process starts with $m$ balls arbitrarily distributed across $n$ bins. At each round $t=1,2,\ldots$, one ball is…
The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…
We introduce the Random Subsequence Model, a spin glass model on pairs of random strings $(X,Y) \in \{0,1\}^N \times \{0,1\}^M$ whose partition function counts subsequence embeddings of $Y$ into $X$. We study two variants: the null model,…
A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…
Let $\widetilde{\alpha}$ be a length-$L$ cyclic sequence of characters from a size-$K$ alphabet $\mathcal{A}$ such that the number of occurrences of any length-$m$ string on $\mathcal{A}$ as a substring of $\widetilde{\alpha}$ is $\lfloor L…
Already in the 1960s, Levenshtein and others studied error-correcting codes that protect against synchronization errors, such as symbol insertions and deletions. However, despite significant efforts, progress on designing such codes has…
Recent experiments have demonstrated the feasibility of storing digital information in macromolecules such as DNA and protein. However, the DNA storage channel is prone to errors such as deletions, insertions, and substitutions. During the…
We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…
Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding…
Regular variation of a multivariate measure with a Lebesgue density implies the regular variation of its density provided the density satisfies some regularity conditions. Unlike the univariate case, the converse also requires regularity…
The primary objective of this paper is to establish the Ahlfors regularity of minimizers of set functions that satisfy a suitable maxitive condition on disjoint unions of sets. Our analysis focuses on minimizers within continua of the plane…
This paper explores the distribution of indistinguishable balls into distinct urns with varying capacity constraints, a foundational issue in combinatorial mathematics with applications across various disciplines. We present a comprehensive…
These series of notes serve as an introduction to some of both the classical and modern techniques in Reifenberg theory. At its heart, Reifenberg theory is about studying general sets or measures which can be, in one sense or another,…
We prove that every $1$-error-correcting code over a finite field can be embedded in a $1$-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting $1$-perfect code and can be…
Length density is a recently introduced factorization invariant, assigned to each element $n$ of a cancellative commutative atomic semigroup $S$, that measures how far the set of factorization lengths of $n$ is from being a full interval.…
This work lies at an intersection of three subjects: quantum field theory, algebraic geometry and number theory, in a situation where dialogue between practitioners has revealed rich structure. It contains a theorem and 7 conjectures,…