相关论文: Optimal partitions for the sum and the maximum of …

The optimal pricing problem is a fundamental problem that arises in combinatorial auctions. Suppose that there is one seller who has indivisible items and multiple buyers who want to purchase a combination of the items. The seller wants to…

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Given a weighted and complete graph G = (V, E), V denotes the set of n objects to be clustered, and the weight d(u, v) associated with an edge (u, v) belonging to E denotes the dissimilarity between objects u and v. The diameter of a…

We are concerned with the dependence of the lowest eigenvalue of the magnetic Dirichlet Laplacian on the geometry of rectangles, subject to homogeneous fields. We conjecture that the square is a global minimiser both under the area or…

A tiling of the unit square is an MTP tiling if the smallest tile can tile all the other tiles. We look at the function $f(n)=\max \sum s_i$, where $s_i$ is the side length of the $i$th tile and the sum is taken over all MTP tilings with…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

In this paper, we consider the optimization problem \scpl (\scp), which is to find a minimum cost subset of a ground set $U$ such that the value of a submodular function $f$ is above a threshold $\tau$. In contrast to most existing work on…

The structural study of entanglement in multipartite systems is hindered by the lack of necessary and sufficient operational criteria able to discriminate among the various entanglement properties of a given mixed state. Here, we pursue a…

In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the…

We consider the minimization or maximization of the $J$th largest eigenvalue of an analytic and Hermitian matrix-valued function, and build on Mengi et al. (2014, SIAM J. Matrix Anal. Appl., 35, 699-724). This work addresses the setting…

We consider a property of positive polynomials on a compact set with a small perturbation. When applied to a Polynomial Optimization Problem (POP), the property implies that the optimal value of the corresponding SemiDefinite Programming…

The efficiency of exact subset sum problem algorithms which compute individual subset sums is defined as $e=min(T/z, 1)$, where $z$ is the number of subset sums computed. $e$ is related to these algorithms' computational complexity. This…

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…

In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behavior of the optimal partition and optimal set mapping on a so-called nonlinearity…

We study the problem of computing the \textsc{Maxima} of a set of $n$ $d$-dimensional points. For dimensions 2 and 3, there are algorithms to solve the problem with order-oblivious instance-optimal running time. However, in higher…

Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to…

We consider cloning transformations of equatorial qubits and qutrits, with the transformation covariant for rotation of the phases. The optimal cloning maps are derived without simplifying assumptions from first principles, for any number…

We consider potentially non-convex optimization problems, for which optimal rates of approximation depend on the dimension of the parameter space and the smoothness of the function to be optimized. In this paper, we propose an algorithm…

We give results on optimal constants of isoperimetric inequalities involving Steklov eigenvalues on surfaces with boundary. We both consider this question on Riemannian surfaces with a same given topology or more specifically belonging to…

Let A(G) be the adjacency tensor (hypermatrix) of uniform hypergraph G. The maximum modulus of the eigenvalues of A(G) is called the spectral radius of G. In this paper, the conjecture of Fan et al. in [5] related to compare the spectral…