相关论文: Bounds on the number of higher-dimensional partiti…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

We extend recent results by G. E. Andrews and G. Simay on the $m$th largest and $m$th smallest parts of a partition to the more general context of skew plane partitions. In order to do this, we introduce new objects called skew plane…

We deal with the problem of estimating the volume of inclusions using a finite number of boundary measurements in electrical impedance tomography. We derive upper and lower bounds on the volume fractions of inclusions, or more generally two…

The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…

By examining the rate of growth of an invariant volume $\mathcal V$ of some spacetime region along a divergence-free vector field $v^\alpha$, we introduce the concept of a "vector volume" $\mathcal{V}_v$. This volume can be defined in…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…

Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…

We obtain estimates for the number $p_d(n)$ of $(d-1)$-dimensional integer partitions of a number $n$. It is known that the two-sided inequality $C_1(d)n^{1-1/d}<\log p_d(n)< C_2(d)n^{1-1/d}$ is always true and that $C_1(d)>1$ whenever…

We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…

In accordance with current models of the accelerating Universe as a spacetime with a positive cosmological constant, new results about a cosmological upper bound for the area of stable marginally outer trapped surfaces are found taking into…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to…

It is well-known that the coefficients in Faa di Bruno's chain rule for higher derivatives can be expressed via numeration of partitions. It turns out that this has a natural form as a formula for the vector case. To this formula two proofs…

The size estimation problem in electrical impedance tomography is considered when the conductivity is a complex number and the body is two-dimensional. Upper and lower bounds on the volume fraction of the unknown inclusion embedded in the…