Related papers: A formula for the minimal coordination number of a…
Let $C$ be a smooth projective curve and $V$ an orthogonal bundle over $C$. Let $\IQeV$ be the isotropic Quot scheme parameterizing degree $e$ isotropic subsheaves of maximal rank in $V$. We give a closed formula for intersection numbers on…
The direct correlation function of a fluid mixture of parallel hard cubes is obtained by using Rosenfeld's fundamental measure approximation. This approximation is thermodynamically consistent (compressibility and virial equations of state…
We algorithmically characterize the maximal contact number problem for finite congruent lattice sphere packings in $\mathbb{R}^d$ and show that in $\mathbb{R}^3$ this problem is equivalent to determining the maximal coordination of a…
This paper focuses on the performance evaluation of the parallel manipulators for milling of composite materials. For this application the most significant performance measurements, which denote the ability of the manipulator for the…
Efficient numerical methods to approximate the parallel transport operators of the induced connection on a sub-bundle of a vector bundle are presented. These methods are simpler than naive applications of a Runge--Kutta algorithm, and have…
In this work, we develop a variant of a bundle method in order to find a zero of a maximal monotone operator. This algorithm relies on two polyhedral approximations of the epsilon-enlargement of the considered operator, via a systematic use…
In this work, we put to light a formula that relies the number of fully packed loop configurations (FPLs) associated to a given coupling pi to the number of half-turn symmetric FPLs (HTFPLs) of even size whose coupling is a punctured…
Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
We study convergence rates of the classic proximal bundle method for a variety of nonsmooth convex optimization problems. We show that, without any modification, this algorithm adapts to converge faster in the presence of smoothness or a…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…
The identity of the smallest quadrangulation with minimum degree 3 also containing parallel edges is unknown. However, it has already been determined that its order (the number of vertices) is between 11 and 14. This paper narrows this…
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between…
The aim of structured optimization is to assemble a solution, using a given set of (possibly uncountably infinite) atoms, to fit a model to data. A two-stage algorithm based on gauge duality and bundle method is proposed. The first stage…
This paper revisits the modal truncation from an optimisation point of view. In particular, the concept of dominant poles is formulated with respect to different systems norms as the solution of the associated optimal modal truncation…
We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…
In this paper we characterize minimal free resolutions of homogeneous bundles on P^2. Besides we study stability and simplicity of homogeneous bundles on P^2 by means of their minimal free resolutions; in particular we give a criterion to…
Parallelization is a popular strategy for improving the performance of iterative algorithms. Optimization methods are no exception: design of efficient parallel optimization methods and tight analysis of their theoretical properties are…
We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…