Related papers: Integer packing sets form a well-quasi-ordering

A vector space is commonly defined as a set that satisfies several conditions related to addition and scalar multiplication. However, for beginners, it may be hard to immediately grasp the essence of these conditions. There are probably a…

In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of…

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

It follows from the Garloff-Wagner Theorem that the set of stable polynomials of degree $n$, denoted by $\mathcal{H}_n$, i.e., those whose zeros all lie in the open left complex half-plane, with the Hadamard product $*$, forms an abelian…

This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

A poset has the non-messing-up property if it has two covering sets of disjoint saturated chains so that for any labeling of the poset, sorting the labels along one set of chains and then sorting the labels along the other set yields a…

Packing is a complex phenomenon of prominence in many natural and industrial processes (liquid crystals, granular materials, infiltration, melting, flow, sintering, segregation, sedimentation, compaction, etc.). A variety of computational…

We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…

In 1935, Erd\H{o}s and Szekeres proved that every set of $n$ points in general position in the plane contains the vertices of a convex polygon of $\frac{1}{2}\log_2(n)$ vertices. In 1961, they constructed, for every positive integer $t$, a…

Given a set I of word, the set of all words obtained by the shuffle of (copies of) words of I is naturally provided with a partial order. In [FS05], the authors have opened the problem of the characterization of the finite sets I such that…

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…

An upper quasi-density on $\bf H$ (the integers or the non-negative integers) is a real-valued subadditive function $\mu^\ast$ defined on the whole power set of $\mathbf H$ such that $\mu^\ast(X) \le \mu^\ast({\bf H}) = 1$ and $\mu^\ast(k…

The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulation with edge variables and representative variables. We…

We consider the problem of finding all enclosing rectangles of minimum area that can contain a given set of rectangles without overlap. Our rectangle packer chooses the x-coordinates of all the rectangles before any of the y-coordinates. We…

Given a positive integer $u$ and a simple algebraic group $G$ defined over an algebraically closed field $K$ of characteristic $p$, we derive properties about the subvariety $G_{[u]}$ of $G$ consisting of elements of $G$ of order dividing…

In this paper, we study the quasisymmetric packing minimality of homogeneous perfect sets, and obtain that a special class of homogeneous perfect sets with $\operatorname{dim}_{P}E=1$ is quasisymmetrically packing minimal.

In a 2022 paper, Dawsey, Just and the present author prove that the set of integer partitions, taken as a monoid under a partition multiplication operation I defined in my Ph.D. work, is isomorphic to the positive integers as a monoid under…

The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum…

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our…