Related papers: Bounding invariants of fat points using a coding t…
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…
We give a general criterion for Zariski degeneration of integral points in the complement of a divisor $D$ with $n$ components in a variety of dimension $n$ defined over $\mathbb{Q}$ or over a quadratic imaginary field. The key condition is…
We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p…
In this article, we study new methods for constructing uninorms on bounded lattices. First, we present new methods for constructing uninorms on bounded lattices under the additional constraints and prove that some of these constraints are…
A design is a collection of distinct points in a given set $X$, which is assumed to be a compact subset of $R^d$, and the mesh-ratio of a design is the ratio of its fill distance to its separation radius. The uniformity constant of a…
Several known constructions relate initial degenerations of projective toric varieties and Grassmannians to regular subdivisions of appropriate point configurations. We define a general framework which allows for partial generalizations of…
Fragment-based shape signature techniques have proven to be powerful tools for computer-aided drug design. They allow scientists to search for target molecules with some similarity to a known active compound. They do not require reference…
Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…
Let $m>1$ be an integer, and let $I(\mathbb{Z}_m)^*$ be the set of all non-zero proper ideals of $\mathbb{Z}_m$. The intersection graph of ideals of $\mathbb{Z}_m$, denoted by $G(\mathbb{Z}_m)$, is a graph with vertices $I(\mathbb{Z}_m)^*$…
A restricted $d$th power of an ideal $I$ is obtained by restricting the exponent vectors allowed to appear on the "natural" generating set of $I^d$, for some integer $d$. In this paper, we study homological properties of restricted powers…
It is well known that a pair of compact sets in $\mathbb{R}^d$ ($d \in \mathbb{N}$) can be separated by small deformations if the sum of their upper box dimensions is less than $d$. In this paper, we demonstrate that this dimension…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that…
Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the…
We develop a complete obstruction theory for the $\mathbb{Z}_2$-index of a compact connected 4-dimensional manifold with free involution. This $\mathbb{Z}_2$-index, equal to the minimum integer $n$ for which there exists an equivariant map…
Eberhard and Pohoata conjectured that every $3$-cube-free subset of $[N]$ has size less than $2N/3+o(N)$. In this paper we show that if we replace $[N]$ with $\mathbb{Z}_N$ the upper bound of $2N/3$ holds, and the bound is tight when $N$ is…
For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$. We consider a…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
We study two popular ways to sketch the shortest path distances of an input graph. The first is distance preservers, which are sparse subgraphs that agree with the distances of the original graph on a given set of demand pairs. Prior work…
In this paper, we provide constructions to enumerate large numbers of CI-liaison classes. To this end, we introduce a liaison invariant and prove several results concerning it, notably that it commutes with hypersurface sections. This…