相关论文: Cutting the same fraction of several measures
Let m be a unidimensional measure with dimension d. A natural question is to ask if the measure m is comparable with the Hausdorff measure (or the packing measure) in dimension d. We give an answer (which is in general negative) to this…
We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…
In this paper, we study $(s,s+1)$-core partitions with $d$-distinct parts. We obtain results on the number and the largest size of such partitions, so we extend Xiong's paper in which the results are obtained about $(s,s+1)$-core partitions…
Learning the embedding space, where semantically similar objects are located close together and dissimilar objects far apart, is a cornerstone of many computer vision applications. Existing approaches usually learn a single metric in the…
The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts and then measure the joint…
Let $d, r \in \N$, $\|\cdot\|$ any norm on $\R^d$ and $B$ denote the unit ball with respect to this norm. We show that any sequence $v_1,v_2,...$ of vectors in $B$ can be partitioned into $r$ subsequences $V_1, ..., V_r$ in a balanced…
Current algorithms for large-scale industrial optimization problems typically face a trade-off: they either require exponential time to reach optimal solutions, or employ problem-specific heuristics. To overcome these limitations, we…
This paper studies disjunctive cutting planes in Mixed-Integer Conic Programming. Building on conic duality, we formulate a cut-generating conic program for separating disjunctive cuts, and investigate the impact of the normalization…
In the paper, the quantum-statistical approach is used to estimate the number of restricted plane partitions of an integer $n$ with the number of parts not exceeding some finite $N$. The analogy between this number-theoretical problem and…
This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are…
Partition-wise models offer a flexible approach for modeling complex and multidimensional data that are capable of producing interpretable results. They are based on partitioning the observed data into regions, each of which is modeled with…
The conventional definition of a topological metric over a space specifies properties that must be obeyed by any measure of "how separated" two points in that space are. Here it is shown how to extend that definition, and in particular the…
We develop a cut finite element method (CutFEM) for the convection problem in a so called fractured domain which is a union of manifolds of different dimensions such that a $d$ dimensional component always resides on the boundary of a $d+1$…
Let $d\nu$ be a measure in $\mathbb{R}^d$ obtained from adding a set of mass points to another measure $d\mu$. Orthogonal polynomials in several variables associated with $d\nu$ can be explicitly expressed in terms of orthogonal polynomials…
Discrete optimization belongs to the set of $\mathcal{NP}$-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard approach to solving convex discrete optimization problems is the…
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties of the kernel with recombination results about point measures. This results in effective algorithms that construct convex quadrature rules…
This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.
We construct a planar homogeneous self-similar measure, with strong separation, dense rotations and dimension greater than $1$, such that there exist lines for which dimension conservation does not hold and the projection of the measure is…
We study the problem of supervised learning a metric space under discriminative constraints. Given a universe $X$ and sets ${\cal S}, {\cal D}\subset {X \choose 2}$ of similar and dissimilar pairs, we seek to find a mapping $f:X\to Y$, into…
We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…